Improved Modular Termination Proofs Using Dependency Pairs-Reference-Cited by-同舟云学术

Improved Modular Termination Proofs Using Dependency Pairs

Published:2004 Issue: Volume: Page:75-90
ISSN:0302-9743
Container-title:Automated Reasoning
language:
Short-container-title:

Author:

Thiemann René,Giesl Jürgen,Schneider-Kamp Peter

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-25984-8_4.pdf

Reference30 articles.

1. Lecture Notes in Computer Science;T. Arts,2000

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

3. Arts, T., Giesl, J.: A collection of examples for termination of term rewriting using dependency pairs. Technical Report AIB-2001-0912, RWTH Aachen (2001)

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

5. Lecture Notes in Computer Science;C. Borralleras,2000

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

1. The 2D Dependency Pair Framework for Conditional Rewrite Systems—Part II: Advanced Processors and Implementation Techniques;Journal of Automated Reasoning;2020-01-16

2. Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems;IEICE Transactions on Information and Systems;2009

3. Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques;IEICE Transactions on Information and Systems;2009

4. Enhancing dependency pair method using strong computability in simply-typed term rewriting;Applicable Algebra in Engineering, Communication and Computing;2007-07-11

5. Tyrolean termination tool: Techniques and features;Information and Computation;2007-04