System presentation - Cariboo: An induction based proof tool for termination with strategies

Proceedings of the ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'02)

Volumn , Issue , 2002, Pages 62-73

  Fissore, Olivier ^a   Gnaedig, Isabelle ^a   Kirchner, Hélène ^a  

^a LORIA   (France)

Author keywords

ELAN; Induction; Innermost; Local strategy; Narrowing; Ordering constraint; Rewriting; Rule based language; Termination

Indexed keywords

COMPUTER GRAPHICS; COMPUTER PROGRAMMING; FORMAL LANGUAGES; THEOREM PROVING;

ABSTRACTION MECHANISM;

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 0036992306     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. 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.
2. 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.
3. 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.
4. 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.
5. 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.
6. Evelyne Contejean, Claude Marché, Ana-Paula Tomás, and Xavier Urbain. Solving termination constraints via finite domain polynomial interpretations. Unpublished draft, 2000.
7. 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.
8. Benjamin Monate et Xavier Urbain Evelyne Contejean, Claude Marché. Cime version 2, 2000. Version préliminaire disponible http://cime.lri.fr/.
9. 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.
10. 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/cariboo-extended.ps.
11. 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.
12. 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.
13. Jurgen Giesl. Polo - a system for termination proofs using polynomial orderings. Technical Report IBN 95/24, Technische Hochschule Darmstadt, 1995.
14. I. Gnaedig, H. Kirchner, and O. Fissore. Induction for innermost and outermost ground termination. Technical Report A01-R-178, LORIA, Nancy, France, 2001.
15. J. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, and J.P. Jouannaud. Introducing OBJ3. Technical report, Computer Science Laboratory, SRI International, march 1992.
16. P. Klint. A meta-environment for generating programming environments. ACM Transactions on Software Engineering and Methodology, 2:176-201, 1993.
17. M.R.K. Krishna Rao. Some characteristics of strong normalization. Theoretical Computer Science, 239:141-164, 2000.
18. 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.
19. 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.