Olivier Fissore
ABSTRACT
We describe Cariboo, the implementation of an inductive process recently proposed to prove termination of rewriting under strategies on ground term algebras. The method is based on an abstraction mechanism, introducing variables that represent ground terms in normal form, and on narrowing, schematizing reductions on ground terms. It applies in particular to non-terminating systems which are terminating with innermost or local strategies. The narrowing process, well known to easily diverge, is controlled by using appropriate abstraction constraints. The abstraction mechanism lies on satisfiability of ordering constraints. Thanks to the power of induction, these ordering constraints are often simple and automatically solved by our system. Otherwise, they can be treated by the user or any external automatic solver. On many examples, Cariboo even enables to succeed without considering any constraint at all ; the process is then completely automatic. Cariboo offers a graphical view of the proof process. It is implemented in ELAN, a rule based programming environment, and so can be used for proving termination of ELAN programs.
- T. Arts and J. Giesl. Proving innermost normalisation automatically. In Proceedings 8th Conference on Rewriting Techniques and Applications, Sitges (Spain), volume 1232 of Lecture Notes in Computer Science, pages 157--171. Springer-Verlag, 1997.]] Google Scholar
Digital Library
- T. Arts and J. Giesl. A collection of examples for termination of term rewriting using dependency pairs. Technical Report AIB-2001-09, RWTH Aachen, Germany, September 2001.]]Google Scholar
- P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, and Ch. Ringeissen. An Overview of ELAN. In C. Kirchner and H. Kirchner, editors, Proc. Second Intl. Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, Pont-à-Mousson (France), September 1998. Elsevier.]]Google Scholar
- Peter Borovanský, Claude Kirchner, Hélène Kirchner, Pierre-Etienne Moreau, and Christophe Ringeissen. An overview of ELAN. In Claude Kirchner and Hélène Kirchner, editors, Proceedings of the second International Workshop on Rewriting Logic and Applications, volume 15, http://www.elsevier.nl/locate/entcs/volume15.html, Pont-à-Mousson (France), September 1998. Electronic Notes in Theoretical Computer Science. Report LORIA 98-R-316.]]Google Scholar
- M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. In J. Meseguer, editor, Proceedings of the 1st International Workshop on Rewriting Logic and its Applications, volume 5 of Electronic Notes in Theoretical Computer Science, Asilomar, Pacific Grove, CA, USA, September 1996. North Holland.]]Google Scholar
- Evelyne Contejean, Claude Marché, Ana-Paula Tomás, and Xavier Urbain. Solving termination constraints via finite domain polynomial interpretations. Unpublished draft, 2000.]]Google Scholar
- S. Eker. Term rewriting with operator evaluation strategies. In C Kirchner and H. Kirchner, editors, Proceedings of the 2nd International Workshop on Rewriting Logic and its Applications, Pont-à-Mousson, France, September 1998.]]Google Scholar
- Benjamin Monate et Xavier Urbain Evelyne Contejean, Claude Marché. Cime version 2, 2000. Version préliminaire disponible à http://cime.lri.fr/.]]Google Scholar
- O. Fissore, I. Gnaedig, and H. Kirchner. Termination of rewriting with local strategies. In M. P. Bonacina and B. Gramlich, editors, Selected papers of the 4th International Workshop on Strategies in Automated Deduction, volume 58 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2001. Also available as Technical Report A01-R-177, LORIA, Nancy, France.]]Google Scholar
- O. Fissore, I. Gnaedig, and H. Kirchner. CARIBOO : An induction based proof tool for termination with strategies - Extended version. Technical Report A02-R-077, LORIA, Nancy, France, 2002. Available at http://www.loria.fr/~gnaedig/INDO/CARIBOO/cari-boo-extended.ps.]]Google Scholar
- K. Futatsugi and A. Nakagawa. 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.]] Google ScholarDigital Library
- J. Giesl and Middeldorp A. Transforming Context-Sensitive Rewrite Systems. In Proceedings of the 10th International Conference on Rewriting Techniques and Applications, volume 1631 of Lecture Notes in Computer Science, pages 271--285, Trento, Italy, 1999. Springer-Verlag.]] Google ScholarDigital Library
- Jurgen Giesl. Polo -- a system for termination proofs using polynomial orderings. Technical Report IBN 95/24, Technische Hochschule Darmstadt, 1995.]]Google Scholar
- I. Gnaedig, H. Kirchner, and O. Fissore. Induction for innermost and outermost ground termination. Technical Report A01-R-178, LORIA, Nancy, France, 2001.]]Google Scholar
- J. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, and J.P. Jouannaud. Introducing OBJ3. Technical report, Computer Science Laboratory, SRI International, march 1992.]]Google Scholar
- P. Klint. A meta-environment for generating programming environments. ACM Transactions on Software Engineering and Methodology, 2:176--201, 1993.]] Google ScholarDigital Library
- M.R.K. Krishna Rao. Some characteristics of strong normalization. Theoretical Computer Science, 239:141--164, 2000.]] Google ScholarDigital Library
- S. Lucas. Termination of rewriting with strategy annotations. In A. Voronkov and R. Nieuwenhuis, editors, Proc. of 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR'01, volume 2250 of Lecture Notes in Artificial Intelligence, pages 669--684, La Habana, Cuba, December 2001. Springer-Verlag, Berlin.]] Google ScholarDigital Library
- H. Zantema. Termination of context-sensitive rewriting. In Proceedings of the 8th International Conference on Rewriting Techniques and Applications, volume 1232 of Lecture Notes in Computer Science, pages 172--186. Springer-Verlag, 1997.]] Google ScholarDigital Library
Index Terms
- System Presentation -- CARIBOO: An induction based proof tool for termination with strategies
Recommendations
Termination of rewriting under strategies
A termination proof method for rewriting under strategies, based on an explicit induction on the termination property, is presented and instantiated for the innermost, outermost, and local strategies. Rewriting trees are simulated by proof trees ...
Induction for positive almost sure termination
PPDP '07: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programmingIn this paper, we propose an inductive approach to prove positive almost sure termination of probabilistic rewriting under the innermost strategy. We extend to the probabilistic case a technique we proposed for termination of usual rewriting under ...
Termination of narrowing revisited
This paper describes several classes of term rewriting systems (TRS's), where narrowing has a finite search space and is still (strongly) complete as a mechanism for solving reachability goals. These classes do not assume confluence of the TRS. We also ...
Comments