TORPA: Termination of rewriting proved automatically

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

Volumn 3091, Issue , 2004, Pages 95-104

  Zantema, Hans ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

DEPENDENCY PAIR METHODS; FORWARD CLOSURES; POLYNOMIAL INTERPRETATIONS; RECURSIVE PATH ORDERING; RIGHT-HAND SIDES; STRING REWRITING;

SEMANTICS;

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

References (14)

1. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133-178, 2000.
2. A. Ben-Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9:137159, 1987.
3. C. Boralleras and A. Rubio. Termptation: termination proof techniques automation. Available at www.lsi.upc.es/~albert/.
4. E. Contejean, C. Marché, B. Monate, and X. Urbain. The CiME rewrite tool. Available at http://cime.lri.fr/.
5. N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17:279-301, 1982.
6. J. Giesl et al. Automated program verification environment (AProVE). Available at http://www-12.informatik.rwth-aachen.de/AProVE/.
7. A. Geser, D. Hofbauer, and J. Waldmann. Match-bounded string rewriting. Technical Report 2003-09, National Institute of Aerospace, Hampton, VA, 2003. Submitted for publication in a journal.
8. J. Giesl and H. Zantema. Liveness in rewriting. In R. Nieuwenhuis, editor, Proceedings of the 14th Conference on Rewriting Techniques and Applications (RTA), volume 2706 of Lecture Notes in Computer Science, pages 321-336. Springer, 2003.
9. N. Hirokawa and A. Middeldorp. Tsukuba termination tool. In R. Nieuwenhuis, editor, Proceedings of the 14th Conference on Rewriting Techniques and Applications (RTA), volume 2706 of Lecture Notes in Computer Science, pages 311-320, 2003.
10. D.S. Lankford. On proving term rewriting systems are noetherian. Technical report MTP 3, Louisiana Technical University, 1979.
11. H. Zantema. Termination of term rewriting: Interpretation and type elimination. Journal of Symbolic Computation, 17:23-50, 1994.
12. H. Zantema. Termination of term rewriting by semantic labelling. Fundamenta Informaticae, 24:89-105, 1995.
13. H. Zantema. Termination. In Term Rewriting Systems, by Terese, pages 181-259. Cambridge University Press, 2003.
14. H. Zantema. Termination of string rewriting proved automatically. Technical Report CS-report 03-14, Eindhoven University of Technology, 2003. Submitted, available via http://www.win.tue.nl/inf/onderzoek/en_index.html.