Size-change termination for term rewriting

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

Volumn 2706, Issue , 2003, Pages 264-278

  Thiemann, René ^a   Giesl, Jürgen ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

AUTOMATED TERMINATION PROOFS; DEPENDENCY PAIRS; FUNCTIONAL PROGRAMS; RECURSIVE PATH ORDERING; SIZE-CHANGE PRINCIPLE; TERM REWRITE SYSTEMS; TERM REWRITING; TERMINATION ANALYSIS;

ARTIFICIAL INTELLIGENCE;

EID: 84947778039     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44881-0_19     Document Type: Conference Paper

References (15)

1. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133–178, 2000.
2. 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.
3. F. Baader and T. Nipkow. Term Rewriting and All That. Cambr. Univ. Pr., 1998.
4. C. Borralleras, M. Ferreira, and A. Rubio. Complete monotonic semantic path orderings. In Proc. 17th CADE, LNAI 1831, pages 346–364, 2000.
5. N. Dershowitz. Termination of rewriting. J. Symbolic Comp., 3:69–116, 1987.
6. O. Fissore, I. Gnaedig, and H. Kirchner. Induction for termination with local strategies. In Proc. 4th Int. Workshop Strategies in Aut. Ded., ENTCS 58, 2001.
7. 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.
8. J. Giesl, T. Arts, and E. Ohlebusch. Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation, 34(1):21–58, 2002.
9. S. Kamin and J. J. Lévy. Two generalizations of the recursive path ordering. Unpublished Manuscript, University of Illinois, IL, USA, 1980.
10. D. Knuth and P. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Comp. Problems in Abstr. Algebra, pages 263–297. Pergamon, 1970.
11. K. Kusakari, M. Nakamura, and Y. Toyama. Argument filtering transformation. In Proc. 1st PPDP, LNCS 1702, pages 48–62, 1999.
12. D. Lankford. On proving term rewriting systems are Noetherian. Technical Report MTP-3, Louisiana Technical University, Ruston, LA, USA, 1979.
13. 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.
14. R. Thiemann and J. Giesl: Size-change termination for term rewriting. Report AIB-2003-02, RWTH Aachen, 2003. http://aib.informatik.rwth-aachen.de.
15. Y. Toyama. Counterexamples to the termination for the direct sum of term rewriting systems. Information Processing Letters, 25:141–143, 1987.