Automating the dependency pair method

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

Volumn 2741, Issue , 2003, Pages 32-46

  Hirokawa, Nao ^a   Middeldorp, Aart ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

THEOREM PROVING; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; NUMERICAL METHODS; RESEARCH;

DEPENDENCY PAIR METHODS; NUMERICAL DATA; TERM REWRITE SYSTEMS; TRADITIONAL TECHNIQUES;

AUTOMATION;

AUTOMATABLE METHODS; NUMERICAL DATA; TERM REWRITE SYSTEMS; TERMINATION;

EID: 7044245493     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45085-6_4     Document Type: Conference Paper

References (17)

1. T. Arts. System description: The dependency pair method. In Proc. 11th RTA, volume 1833 of LNCS, pages 261-264, 2000.
2. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. TCS, 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-09, RWTH Aachen, 2001.
4. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
5. F. Bellegarde and P. Lescanne. Termination by completion. AAECC, 1:79-96, 1990.
6. C. Borralleras, M. Ferreira, and A. Rubio. Complete monotonic semantic path orderings. In Proc. 17th CADE, volume 1831 of LNAI, pages 346-364, 2000.
7. E. Contejean, C. Marché, B. Monate, and X. Urbain. CiME version 2, 2000. Available at http://cime.lri.fr/.
8. N. Dershowitz. 33 Examples of termination. In French Spring School of Theoretical Computer Science, volume 909 of LNCS, pages 16-26, 1995.
9. J. Giesl and T. Arts. Verification of Erlang processes by dependency pairs. AAECC, 12(1, 2):39-72, 2001.
10. J. Giesl, T. Arts, and E. Ohlebusch. Modular termination proofs for rewriting using dependency pairs. JSC, 34(1):21-58, 2002.
11. N. Hirokawa and A. Middeldorp. Tsukuba termination tool. In Proc. 14th RTA, LNCS, 2003. To appear.
12. S. Kamin and J. J. Lévy. Two generalizations of the recursive path ordering. Unpublished manuscript, University of Illinois, 1980.
13. A. Middeldorp. Approximating dependency graphs using tree automata techniques. In Proc. IJCAR, volume 2083 of LNAI, pages 593-610, 2001.
14. A. Middeldorp. Approximations for strategies and termination. In Proc. 2nd WRS, volume 70(6) of ENTCS, 2002.
15. J. Steinbach. Automatic termination proofs with transformation orderings. In Proc. 6th RTA, volume 914 of LNCS, pages 11-25, 1995.
16. J. Steinbach and U. Kühler. Check your ordering-termination proofs and open problems. Technical Report SR-90-25, Universität Kaiserslautern, 1990.
17. Y. Toyama. Counterexamples to the termination for the direct sum of term rewriting systems. Information Processing Letters, 25:141-143, 1987.