Automated termination proofs with AProVE

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

Volumn 3091, Issue , 2004, Pages 210-220

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

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

AUTOMATED TERMINATION; AUTOMATED TERMINATION PROOFS; DEPENDENCY PAIRS; GRAPHICAL INTERFACE; SIZE-CHANGE PRINCIPLE; TERM REWRITE SYSTEMS; TERMINATION PROOF; USER FRIENDLY;

AUTOMATION;

EID: 35048887144     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25979-4_15     Document Type: Article

References (31)

1. T. Arts. System description: The dependency pair method. In Proc. 11th RTA, LNCS 1833, pages 261-264, 2000.
2. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133-178, 2000.
3. 3, RWTH Aachen, 2001.
4. C. Borralleras, M. Ferreira, and A. Rubio. Complete monotonic semantic path orderings. In Proc. 17th CADE, LNAI 1831, pages 346-364, 2000.
5. E. Contejean, C. Marché, B. Monate, and X. Urbain. CiME. http://cime.lri.fr.
6. N. Dershowitz. Termination of rewriting. J. Symb. Comp., 3:69-116, 1987.
7. N. Dershowitz. 33 examples of termination. In Proc. French Spring School of Theoretical Computer Science, LNCS 909, pages 16-26, 1995.
8. N. Dershowitz, N. Lindenstrauss, Y. Sagiv, and A. Serebrenik. A general framework for automatic termination analysis of logic programs. Applicable Algebra in Engineering, Communication and Computing, 12(1,2):117-156, 2001.
9. J. Dick, J. Kalmus, and U. Martin. Automating the Knuth-Bendix ordering. Acta Informatica, 28:95-119, 1990.
10. O. Fissore, I. Gnaedig, and H. Kirchner. Cariboo: An induction based proof tool for termination with strategies. In Proc. 4th PPDP, pages 62-73. ACM, 2002.
11. J. Giesl. Generating polynomial orderings for termination proofs. In Proc. 6th RTA, LNCS 914, pages 426-431, 1995.
12. 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.
13. J. Giesl, T. Arts, and E. Ohlebusch. Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation, 34(1):21-58, 2002.
14. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Improving dependency pairs. In Proc. 10th LPAR, LNAI 2850, pages 165-179, 2003.
15. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Mechanizing dependency pairs. Technical Report AIB-2003-083, RWTH Aachen, Germany, 2003.
16. J. Giesl and H. Zantema. Liveness in rewriting. In Proc. 14th RTA, LNCS 2706, pages 321-336, 2003.
17. N. Hirokawa and A. Middeldorp. Automating the dependency pair method. In Proc. 19th CADE, LNAI 2741, 2003.
18. N. Hirokawa and A. Middeldorp. Tsukuba termination tool. In Proc. 14th RTA, LNCS 2706, pages 311-320, 2003.
19. S. Kamin and J. J. Lévy. Two generalizations of the recursive path ordering. Unpublished Manuscript, University of Illinois, IL, USA, 1980.
20. D. Knuth and P. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Comp. Problems in Abstract Algebra, pages 263-297. Pergamon, 1970.
21. K. Korovin and A. Voronkov. Verifying orientability of rewrite rules using the Knuth-Bendix order. In Proc. 10th RTA, LNCS 2051, pages 137-153, 2001.
22. D. Lankford. On proving term rewriting systems are Noetherian. Technical Report MTP-3, Louisiana Technical University, Ruston, LA, USA, 1979.
23. C. S. Lee, N. D. Jones, and A. M. Ben-Amram. The size-change principle for program termination. In Proc. POPL '01, pages 81-92, 2001.
24. E. Ohlebusch. Termination of logic programs: Transformational approaches revisited. Appl. Algebra in Engineering, Comm. and Comp., 12(1,2):73-116, 2001.
25. Available from http://aib.informatik.rwth-aachen.de
26. E. Ohlebusch, G. Claves, and C. Marché. TALP: A tool for the termination analysis of logic programs. In Proc. 11th RTA, LNCS 1833, pages 270-273, 2000.
27. J. Steinbach. Automatic termination proofs with transformation orderings. In Proc. 6th RTA, LNCS 914, pages 11-25, 1995. Full version appeared as Technical Report SR-92-23, Universität Kaiserslautern, Germany.
28. R. Thiemann and J. Giesl. Size-change termination for term rewriting. In Proc. 14th RTA, LNCS 2706, pages 264-278, 2003.
29. R. Thiemann, J. Giesl, and P. Schneider-Kamp. Improved modular termination proofs using dependency pairs. In Proc. 2nd IJCAR, LNAI, 2004. To appear.
30. X. Urbain. Automated incremental termination proofs for hierarchically defined term rewriting systems. In Proc. 1st IJCAR, LNAI 2083, pages 485-498, 2001.
31. H. Zantema. TORPA: Termination of rewriting proved automatically. In Proc. 15th RTA, LNCS, 2004.