AProVE 1.2: Automatic termination proofs in the dependency pair framework

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

Volumn 4130 LNAI, Issue , 2006, Pages 281-286

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

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTER SOFTWARE; NUMERICAL METHODS; THEOREM PROVING;

DEPENDENCY PAIR FRAMEWORK; TERM REWRITE SYSTEMS; TERMINATION PROOF TECHNIQUES;

AUTOMATA THEORY;

EID: 33749559876     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814771_24     Document Type: Conference Paper

References (20)

1. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133-178, 2000.
2. C. Borralleras. Ordering-based methods for proving termination automatically. PhD thesis, Universitat Politècnica de Catalunya, 2003.
3. E. Contejean, C. Marché, B. Monate, and X. Urbain. CiME. http://cime.lri.fr.
4. A. Geser, D. Hofbauer, and J. Waldmann. Match-bounded string rewriting systems. Applicable Algebra in Eng., Comm. and Computing, 15(3,4):149-171, 2004.
5. J. Giesl, T. Arts, and E. Ohlebusch, Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation, 34(1):21-58, 2002.
6. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Improving dependency pairs. In Proc. 10th LPAR, LNAI 2850, pages 165-179, 2003.
7. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Automated termination proofs with AProVE. In Proc. 15th RTA, LNCS 3091, pages 210-220, 2004.
8. J. Giesl, R. Thiemann, and P. Schneider-Kamp. The DP framework: Combining techn. for aut. termination proofs. Proc. 11th LPAR, LNAI 3452, p. 301-331, 2005.
9. J. Giesl, R. Thiemann, and P. Schneider-Kamp. Proving and disproving termination of higher-order functions. Proc. 5th FroCoS, LNAI 3717, pp. 216-231, 2005.
10. N. Hirokawa and A. Middeldorp. Dependency pairs revisited. In Proc. 15th RTA, LNCS 3091, pages 249-268, 2004.
11. N. Hirokawa and A. Middeldorp. Polynomial interpretations with negative coefficients. In Proc. 7th AISC, LNAI 3249, pages 185-198, 2004.
12. N. Hirokawa and A. Middeldorp. Automating the dependency pair method. Information and Computation, 199(1,2):172-199, 2005.
13. N. Hirokawa and A. Middeldorp. Tyrolean Termination Tool. In Proc. RTA '05, LNCS 3467, pages 175-184, 2005.
14. A. Koprowski. TPA: Termination proved automatically. In Proc. 17th RTA, LNCS, 2006. To appear.
15. C. S. Lee, N. D. Jones, and A. M. Ben-Amram. The size-change principle for program termination. In Proc. 28th POPL, pages 81-92, 2001.
16. R. Thiemann and J. Giesl. The size-change principle and dependency pairs for termination of term rewriting. AAECC, 16(4):229-270, 2005.
17. R. Thiemann, J. Giesl, and P. Schneider-Kamp. Improved modular termination proofs using dependency pairs. Proc. 2nd IJCAR, LNAI 3097, pp. 75-90, 2004.
18. J. v. d. Wulp. Teparla. http://www.win.tue.nl/~hzantema/torpa.html
19. J. Waldmann. Matchbox: A tool for match-bounded string rewriting. In Proc. 15th RTA, LNCS 3091, pages 85-94, 2004.
20. H. Zantema. Termination of term rewriting by semantic labelling. Fundamenta Informaticae, 24:89-105, 1995.