Improving dependency Pairs

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2850, Issue , 2003, Pages 167-182

  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; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; HEURISTIC METHODS; THEOREM PROVING;

ARGUMENT FILTERING; AUTOMATED TERMINATION; DEPENDENCY PAIR APPROACH; TERM RE-WRITE SYSTEMS (TRS);

MATHEMATICAL TRANSFORMATIONS; ARTIFICIAL INTELLIGENCE;

AUTOMATED TERMINATION; DEPENDENCY PAIRS; INEQUALITY CONSTRAINT; TERM REWRITE SYSTEMS; TERMINATION PROOF; TRANSFORMATION TECHNIQUES;

EID: 9444259855     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-39813-4_11     Document Type: Conference Paper

References (27)

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. T. Arts and J. Giesl. A collection of examples for termination of term rewriting using dependency pairs. Technical Report AIB-2001-093, RWTH Aachen, 2001.
4. F. Baader and T. Nipkow. Term Rewriting and All That. Cambr. Univ. Pr., 1998.
5. C. Borralleras, M. Ferreira, and A. Rubio. Complete monotonic semantic path orderings. In Proc. 17th CADE, LNAI 1831, pages 346-364, 2000.
6. E. Contejean, C. Marché, B. Monate, and X. Urbain. Cime version 2, 2000. Available from http://cime.lri.fr.
7. N. Dershowitz. Termination of rewriting. J. Symbolic Comp., 3:69-116, 1987.
8. N. Dershowitz. 33 examples of termination. In Proc. French Spring School of Theoretical Computer Science, LNCS 909, pages 16-26, 1995.
9. 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.
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 and T. Arts. Verification of Erlang processes by dependency pairs. Appl. Algebra in Engineering, Communication and Computing, 12(1,2):39-72, 2001.
12. J. Giesl, T. Arts, and E. Ohlebusch. Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation, 34(1):21-58, 2002.
13. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Improving dependency pairs. Technical Report AIB-2003-043, RWTH Aachen, Germany, 2003.
14. B. Gramlich. On proving termination by innermost termination. In Proc. 7th RTA, LNCS 1103, pages 97-107, 1996.
15. N. Hirokawa and A. Middeldorp. Automating the dependency pair method. In Proc. 19th CADE, LNAI 2741, 2003.
16. N. Hirokawa and A. Middeldorp. Tsukuba termination tool. In Proc. 14th RTA, LNCS 2706, pages 311-320, 2003.
17. G. Huet and J.-M. Hullot. Proofs by induction in equational theories with constructors. Journal of Computer and System Sciences, 25:239-299, 1982.
18. K. Kusakari, M. Nakamura, and Y. Toyama. Argument filtering transformation. In Proc. 1st PPDP, LNCS 1702, pages 48-62, 1999.
19. 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.
20. A. Middeldorp. Approximating dependency graphs using tree automata techniques. In Proc. IJCAR 2001, LNAI 2083, pages 593-610, 2001.
21. E. Ohlebusch. Hierarchical termination revisited. IPL, 84(4):207-214, 2002.
22. E. Ohlebusch, C. Claves, and C. Marché. TALP: A tool for the termination analysis of logic programs. In Proc. 11th RTA, LNCS 1833, pages 270-273, 2000.
23. 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.
24. J. Steinbach. Simplification orderings: History of results. Fund. I., 24:47-87, 1995.
25. R. Thiemann and J. Giesl. Size-change termination for term rewriting. In Proc. 14th RTA, LNCS 2706, pages 264-278, 2003.
26. Y. Toyama. Counterexamples to the termination for the direct sum of term rewriting systems. Information Processing Letters, 25:141-143, 1987.
27. X. Urbain. Automated incremental termination proofs for hierarchically defined term rewriting systems. In Proc. IJCAR 2001, LNAI 2083, pages 485-498, 2001.