The dependency pair framework: Combining techniques for automated termination proofs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3452 LNAI, Issue , 2005, Pages 301-331

  Giesl, Jürgen ^a   Thiemann, René ^a   Schneider Kamp, Peter ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; PROBLEM SOLVING;

TERMINATION ANALYSIS; THE DEPENDENCY PAIR APPROACH;

ARTIFICIAL INTELLIGENCE;

EID: 26844487849     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-32275-7_21     Document Type: Conference Paper

References (24)

1. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133-178, 2000.
2. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
3. N. Dershowitz. Termination of rewriting. J. Symb. Computation, 3:69-116, 1987.
4. N. Dershowitz, Termination by abstraction. In Proc. ICLP '04, LNCS 3132, pages 1-18, 2004.
5. A. Geser, D. Hofbauer, and J. Waldmann. Match-bounded string rewriting systems. In Proc. MFCS '03, LNCS 2747, pages 449-459, 2003.
6. J. Giesl and T. Arts. Verification of Erlang processes by dependency pairs. Appl. Algebra in Engineering, Communication and Computing, 12(1,2):39-72, 2001.
7. J. Giesl, T. Arts, and E. Ohlebusch. Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation, 34(1):21-58, 2002.
8. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Improving dependency pairs. In Proc. LPAR '03, LNAI 2850, pages 165-179, 2003.
9. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Automated termination proofs with AProVE. In Proc. RTA '04, LNCS 3091, pages 210-220, 2004.
10. B. Gramlich. Abstract relations between restricted termination and confluence properties of rewrite systems. Fundamenta Informaticae, 24:3-23, 1995.
11. N. Hirokawa and A. Middeldorp. Automating the dependency pair method. In Proc. CADE '03, LNAI 2741, pages 32-46, 2003. Full version to appear in Information and Computation.
12. N. Hirokawa and A. Middeldorp. Dependency pairs revisited. In Proc. RTA '04, LNCS 3091, pages 249-268, 2004.
13. N. Hirokawa and A. Middeldorp. Polynomial interpretations with negative coefficients. In Proc. AISC '04, LNAI 3249, pages 185-198, 2004.
14. S. Kamin and J. J. Lévy. Two generalizations of the recursive path ordering. Unpublished Manuscript, University of Illinois, IL, USA, 1980.
15. D. Knuth and P. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263-297, 1970.
16. K. Kusakari, M. Nakamura, and Y. Toyama. Argument filtering transformation. In Proc. PPDP '99, LNCS 1702, pages 48-62, 1999.
17. D. Lankford. On proving term rewriting systems are Noetherian. Technical Report MTP-3, Louisiana Technical University, Ruston, LA, USA, 1979.
18. Aart Middeldorp. A simple proof to a result of Bernhard Gramlich. Presented at the 5th Japanese Term Rewriting Meeting, Tsukuba, 1994. Available from http://informatik.uibk.ac.at/users/ami/research/papers/bg.pdf.
19. J. Steinbach. Simplification orderings: History of results. Fundamenta, Informaticae, 24:47-87, 1995.
20. Termination Problem Data Base (TPDB). Available from http://www.lri.fr/ ~marche/wst2004-competition/tpdb.html.
21. R. Thiemann, J. Giesl, and P. Schneider-Kamp. Improved modulai- termination proofs using dependency pairs. In Proc. IJCAR '04, LNAI 3097, pages 75-90, 2004.
22. Y. Toyama. Counterexamples to the termination for the direct sum of term rewriting systems. Information Processing Letters, 25:141-143, 1987.
23. X. Urbain. Modular and incremental automated termination proofs. Journal of Automated Reasoning, 32(4): 315-355, 2004.
24. H. Zantema. Termination of term rewriting by semantic labelling. Fundamenta Informaticae, 24:89-105, 1995.