Reducing right-hand sides for termination

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

Volumn 3838 LNCS, Issue , 2005, Pages 173-197

  Zantema, Hans ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; MATHEMATICAL TRANSFORMATIONS; NUMERICAL METHODS; PROBLEM SOLVING;

TERM REWRITE SYSTEMS (TRSS); TRANSFORMATION IMPLEMENTATION; TRANSFORMED SYSTEMS;

AUTOMATIC PROGRAMMING;

EID: 33749539714     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11601548_12     Document Type: Article

References (27)

1. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133-178, 2000.
2. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
3. F. Bellegarde and P. Lescanne. Termination by completion. Applicable Algebra in Engineering, Communication and Computing, 1(2):79-96, 1990.
4. A. Ben-Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9:137-159, 1987.
5. N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17:279-301, 1982.
6. J. Giesl et al. AProVE: Automated program verification environment, http://aprove.informatik.rwth-aachen.de/
7. M. Ferreira. Termination of Term Rewriting - Well-Foundedness, Totality, and Transformations. PhD thesis, University of Utrecht, 1995.
8. M. Ferreira and H. Zantema. Dummy elimination: Making termination easier. In Proceedings of the 10th International Conference on Fundamentals of Computation Theory, volume 965 of Lecture Notes in Computer Science, pages 243-252. Springer, 1995.
9. M. C. F. Ferreira. Dummy elimination in equational rewriting. In H. Ganzinger, editor, Proceedings of the 7th Conference on Rewriting Techniques and Applications, volume 1103 of Lecture Notes in Computer Science, pages 63-77. Springer, 1996.
10. J. Giesl and A. Middeldorp. Eliminating dummy elimination. In Proceedings of the 17th International Conference on Automated Deduction (CADE), volume 1831 of Lecture Notes in Computer Science, pages 309-323. Springer, 2000.
11. J. Giesl, R. Thiemann, and P. Schneider-Kamp. The dependency pair framework: Combining techniques for automated termination proofs. In Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2004), volume 3452 of Lecture Notes in Computer Science, pages 301-331. Springer, 2005.
12. B. Gramlich. Simplifying termination proofs for rewrite systems by preprocessing. In Maurizio Gabrielli and Frank Pfenning, editors, Proceedings of the 2nd International Conference on Principles and Practice of Declarative Programming (PPDP), Montreal, Canada, pages 139-150, Montreal, Canada, September 2000. ACM Press.
13. N. Hirokawa and A. Middeldorp. TTT: Tyrolean termination tool, http://c12-informatik.uibk.ac.at/ttt/.
14. N. Hirokawa and A. Middeldorp. Dependency pairs revisited. In V. van Oostrom, editor, Proceedings of the 15th Conference on Rewriting Techniques and Applications (RTA), volume 3091 of Lecture Notes in Computer Science, pages 249-268. Springer, 2004.
15. A. Koprowski. TPA: Termination proved automatically, http://www.win.tue. nl/tpa
16. A. Middeldorp, H. Ohsaki, and H. Zantema. Transforming termination by self-labelling. In Proceedings of the 13th International Conference on Automated Deduction (CADE), volume 1104 of Lecture Notes in Artificial Intelligence, pages 373-386. Springer, 1996.
17. J. Steinbach. Automatic termination proofs with transformation orderings. In J. Hsiang, editor, Proceedings of the 6th Conference on Rewriting Techniques and Applications, volume 914 of Lecture Notes in Computer Science, pages 11-25. Springer, 1995.
18. Terese. Term Rewriting Systems. Cambridge University Press, 2003.
19. R. Thiemann, H. Zantema, J. Giesl, and P. Schneider-Kamp. Adding constants to string rewriting. Technical report, RWTH Aachen, 2005. To appear, available via http://www-i2.informatik.rwth-aachen.de/AProVE/ConstantsSRS.pdf.
20. TPDB. Termination problem data base, http://www.lri.fr/'marche/tpdb/.
21. H. Zantema. TORPA: Termination of rewriting proved automatically, http://www.win.tue.nl/~hzantema/torpa.html
22. H. Zantema. Termination of term rewriting: Interpretation and type elimination. Journal of Symbolic Computation, 17:23-50, 1994.
23. H. Zantema. Termination of term rewriting by semantic labelling. Fundamenta Informaticae, 24:89-105, 1995.
24. H. Zantema. Termination. In Term Rewriting Systems, by Terese, pages 181-259. Cambridge University Press, 2003.
25. H. Zantema. Termination of string rewriting proved automatically. Technical Report CS-report 03-14, Eindhoven University of Technology, 2003. Available via http://www.win.tue.nl/inf/onderzoek/en_index.html.
26. H. Zantema. TORPA: termination of rewriting proved automatically. In V. van Oostrom, editor, Proceedings of the 15th Conference on Rewriting Techniques and Applications (RTA), volume 3091 of Lecture Notes in Computer Science, pages 95-104. Springer, 2004.
27. H. Zantema. Termination of string rewriting proved automatically. Journal of Automated Reasoning, 2005. Accepted for publication.