Abstract
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data evaluation. We first present the proof principle, using an explicit induction on the termination property, to prove that any input data has at least one finite evaluation. For that, we observe proof trees built from the rewrite system, schematizing the innermost rewriting tree of any ground term, and generated with two mechanisms: abstraction, schematizing normalization of subterms, and narrowing, schematizing rewriting steps. Then, we show how, for any ground term, a normalizing rewriting strategy can be extracted from the proof trees, even if the ground term admits infinite rewriting derivations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arts, T., Giesl, J.: Proving innermost normalization automatically. Technical Report 96/39, Technische Hochschule Darmstadt, Germany (1996)
Arts, T., Giesl, J.: Proving innermost normalisation automatically. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 157–171. Springer, Heidelberg (1997)
Borovanský, P., Kirchner, C., Kirchner, H., Moreau, P.-E., Ringeissen, C.: An overview of ELAN. In: Kirchner, C., Kirchner, H. (eds.) Proceedings of the second International Workshop on Rewriting Logic and Applications, Pont-à-Mousson (France). Electronic Notes in Theoretical Computer Science, vol. 15 (September 1998), Report LORIA 98-R-316, http://www.elsevier.nl/locate/entcs/volume15.html
Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.F.: Maude: Specification and programming in rewriting logic. Theoretical Computer Science 285, 187–243 (2002)
Comon, H.: Disunification: a survey. In: Lassez, J.-L., Plotkin, G. (eds.) Computational Logic. Essays in honor of Alan Robinson, ch. 9, pp. 322–359. The MIT press, Cambridge (1991)
Dershowitz, N.: Orderings for term-rewriting systems. Theoretical Computer Science 17, 279–301 (1982)
Dershowitz, N., Jouannaud, J.-P.: Handbook of Theoretical Computer Science, vol. B, ch. 6, pp. 244–320. Elsevier Science Publishers B. V, North-Holland (1990), Also as: Research report 478, LRI
Fissore, O., Gnaedig, I., Kirchner, H.: Termination of rewriting with local strategies. In: Bonacina, M.P., Gramlich, B. (eds.) Selected papers of the 4th International Workshop on Strategies in Automated Deduction. Electronic Notes in Theoretical Computer Science, vol. 58. Elsevier Science Publishers B. V, North-Holland (2001)
Fissore, O., Gnaedig, I., Kirchner, H.: CARIBOO: An induction based proof tool for termination with strategies. In: Proceedings of the Fourth International Conference on Principles and Practice of Declarative Programming, Pittsburgh (USA), October 2002, pp. 62–73. ACM Press, New York (2002)
Fissore, O., Gnaedig, I., Kirchner, H.: Outermost ground termination. In: Proceedings of the Fourth International Workshop on Rewriting Logic and Its Applications. Electronic Notes in Theoretical Computer Science, vol. 71 Elsevier Science Publishers B. V, North-Holland (2002)
Fissore, O., Gnaedig, I., Kirchner, H.: Proving weak termination also provides the right way to terminate - Extended version. Technical report, LORIA, Nancy (France) (March 2004), Available at http://www.loria.fr/~gnaedig/PAPERS/REPORTS/wt-extended-2004.ps
Futatsugi, K., Nakagawa, A.: An overview of CAFE specification environment – an algebraic approach for creating, verifying, and maintaining formal specifications over networks. In: Proceedings of the 1st IEEE Int. Conference on Formal Engineering Methods (1997)
Gnaedig, I., Kirchner, H., Fissore, O.: Induction for innermost and outermost ground termination. Technical Report A01-R-178, LORIA, Nancy (France) (September 2001)
Goubault-Larrecq, J.: Well-founded recursive relations. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, p. 484. Springer, Heidelberg (2001)
Goubault-Larrecq, J.: A proof of weak termination of typed lambda-sigma-calculi. In: Giménez, E. (ed.) TYPES 1996. LNCS, vol. 1512. Springer, Heidelberg (1998)
Gramlich, B.: Relating innermost, weak, uniform and modular termination of term rewriting systems. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol. 624, pp. 285–296. Springer, Heidelberg (1992)
Gramlich, B.: On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems. Theoretical Computer Science 165(1), 97–131 (1996)
Huet, G., Lévy, J.-J.: Computations in orthogonal rewriting systems, I. In: Lassez, J.-L., Plotkin, G. (eds.) Computational Logic, ch. 11, pp. 395–414. The MIT press, Cambridge (1991)
Klint, P.: A meta-environment for generating programming environments. ACM Transactions on Software Engineering and Methodology 2, 176–201 (1993)
Lucas, S.: Termination of rewriting with strategy annotations. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 669–684. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fissore, O., Gnaedig, I., Kirchner, H. (2005). A Proof of Weak Termination Providing the Right Way to Terminate. In: Liu, Z., Araki, K. (eds) Theoretical Aspects of Computing - ICTAC 2004. ICTAC 2004. Lecture Notes in Computer Science, vol 3407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31862-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-31862-0_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25304-4
Online ISBN: 978-3-540-31862-0
eBook Packages: Computer ScienceComputer Science (R0)