Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures-Reference-Cited by-同舟云学术

Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures

Published: Issue: Volume: Page:94-109
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Falke Stephan,Kapur Deepak

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-70590-1_7.pdf

Reference23 articles.

1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. TCS 236(1–2), 133–178 (2000)

2. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

3. Lecture Notes in Computer Science;F. Blanqui,2007

4. Contejean, E., Marché, C., Tomás, A.P., Urbain, X.: Mechanically proving termination using polynomial interpretations. JAR 34(4), 325–363 (2005)

5. Falke, S., Kapur, D.: Dependency pairs for rewriting with built-in numbers and semantic data structures. Technical Report TR-CS-2007-21, Department of Computer Science, University of New Mexico (2007), http://www.cs.unm.edu/research/tech-reports/

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Operationally-based program equivalence proofs using LCTRSs;Journal of Logical and Algebraic Methods in Programming;2023-10

2. Generalized rewrite theories, coherence completion, and symbolic methods;Journal of Logical and Algebraic Methods in Programming;2020-01

3. Rewriting induction for constrained inequalities;Science of Computer Programming;2018-04

4. Transforming Dependency Chains of Constrained TRSs into Bounded Monotone Sequences of Integers;Electronic Proceedings in Theoretical Computer Science;2018-02-16

5. Transforming Proof Tableaux of Hoare Logic into Inference Sequences of Rewriting Induction;Electronic Proceedings in Theoretical Computer Science;2018-02-16