Towards automated termination proofs through “freezing”

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

Volumn 1379, Issue , 1998, Pages 271-285

  Xi, Hongwei ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL MECHANICS; LINEAR TRANSFORMATIONS; MATHEMATICAL TRANSFORMATIONS;

AUTOMATED TERMINATION PROOFS; FREEZING TECHNIQUES; LINEAR TERMS; POLYNOMIAL INTERPRETATIONS; RECURSIVE PATH ORDERING; TERM REWRITING SYSTEMS; TERMINATION PROOF; TRANSFORMATION TECHNIQUES;

FREEZING;

EID: 84878543348     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0052376     Document Type: Conference Paper

References (22)

1. T. Arts and J. Giesl. Termination of constructor systems. In Proceedings of the Seventh Conference on Rewriting Techniques and Applications, vol. 1103 of Lecture Notes in Computer Science, pp. 63-77, New Brunswick, USA, 1996.
2. T. Arts and J. Giesl. Automatically Proving Termination Where Simplification Orderings Fail. In Proc. Colloquium on Trees in Algebra and Programming, vol. 1214 of Lecture Notes in Computer Science, pp. 261-272, Lille, France, 1997.
3. L. Bachmair and N. Dershowitz. Communication, transformation and termination. In Proceedings of the Eighth CADE, vol. 230 of Lecture Notes in Computer Science, pp. 52-60, Oxford, July 1986.
4. F. Bellegarde and P. Lescanne. Termination by completion. Applicable Algebra in Engineering, Communication and Computing, vol. 1, pp. 79-96, 1990.
5. N. Dershowitz. Orderings for term rewriting systems. TCS, 17(3), pp. 279-301, 1982.
6. N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, vol. 3, pp.69-116, 1987.
7. N. Dershowitz and C. Hoot. Natural Termination, TCS, 142(2), pp. 179-207, 1995.
8. N. Dershowitz and Jean-Pierre Jouannaud. Rewrite Systems. In I. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B, pp. 243-320.
9. N. Dershowitz and Jean-Pierre Jouannaud. Notations for rewriting. EATCS, vol. 43, pp. 162-172, 1991.
10. M. Ferreira. Dummy Elimination in Equational Rewriting. In Proceedings of the Seventh Conference on Rewriting Techniques and Applications, vol. 1103 of Lecture Notes in Computer Science, pp. 78-92, New Brunswick, USA, 1996.
11. M. Ferreira and H. Zantema. Dummy Elimination: making termination easier. In Proceedings of the 10th International Conference on Fundamentals of Computation Theory, LNCS 965, Dresden, 1995.
12. J. Giesl. Automated termination proofs with measure function. In Proceedings of 19th Annual German Conference on AI, LNAI 981, Bielefeld, 1995.
13. M. Hanus. The integration of functions into logic programming: From theory to practice. In JLOGP, vol. 19-20, pp. 583-628.
14. G. Huét and D. Lankford. On the uniform halting problem for term rewriting systems. Technical Report 283, INRIA, Le Chesnay, France, 1978.
15. D. Knuth and P. Bendix. Simple word problems in universal algebras. Computational Problems in Abstract Algebra, edited by J. Leech, Pergamon Press, pp. 263-297, 1970.
16. R. Kennaway. Complete term rewrite systems for decimal arithmetic and other total recursive functions. Presented at the 2nd International Workshop on termination, La Bresse, 1995
17. D. Lankford. On proving term rewriting systems are noetherian. Tech. Report Memo MTP-3, Louisiana Tech. University, 1979.
18. D. Plaisted. A recursively defined ordering for proving termination of term rewriting systems. Tech. report UIUC DCS-R-78-943, Univ. of Illinois, Urbana, 1978.
19. J. Steinbach. Simplification Orderings: History of Results, Fundamenta Informaticae, vol. 24, pp. 47-87, 1995.
20. J. Steinbach. Automatic termination proofs with transformation orderings. In Proceedings o] the Sixth RTA, vol. 914 of Lecture Notes in Computer Science, pp. 11-25, 1995.
21. H. Zantema. Termination of term rewriting: interpretation and type elimination. Journal of Symbolic Computation, vol. 17, pp. 23-50, 1994.
22. H. Zantema. Termination of Term Rewriting by Semantic Labelling, Fundamenta Informaticae, vol. 24, pp 89-105, 1995.