Isabelle Gnaedig
ABSTRACT
In the context of the study of rule-based programming, we focus in this paper on the property of C-reducibility, expressing that every term reduces to a constructor term on at least one of its rewriting derivations. This property implies completeness of function definitions, and enables to stop evaluations of a program on a constructor form, even if the program is not terminating. We propose an inductive procedure proving C-reducibility of rewriting. The rewriting relation on ground terms is simulated through an abstraction mechanism and narrowing. The induction hypothesis allows assuming that terms smaller than the starting terms rewrite into a constructor term. The existence of the induction ordering is checked during the proof process, by ensuring satisfiability of ordering constraints. The proof is constructive, in the sense that the branch leading to a constructor term can be computed from the proof trees establishing C-reducibility for every term
- P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, and C. Ringeissen. An Overview of ELAN. In C. Kirchner and H. Kirchner, editors, Proceedings of the 2nd International Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, Pont-à-Mousson (France), Sept. 1998. Elsevier Science Publishers B. V. (North-Holland).Google Scholar
- A. Bouhoula. Using induction and rewriting to verify and complete parameterized specifications. Theoretical Computer Science, 170 (1-2):245--276, 1996. Google ScholarDigital Library
- A. Bouhoula and F. Jaquemard. Automatic verification of. sufficient completeness for. specifications of complex data structures. Technical Report RR-LSV-05-17, INRIA, 2005.Google Scholar
- A.-C. Caron, J.-L. Coquide, and M. Dauchet. Encompassment properties and automata with constraints. In C. Kirchner, editor, Proceedings 5th Conference on Rewriting Techniques and Applications, Montreal (Canada), volume 690 of Lecture Notes in Computer Science, pages 328--342. Springer-Verlag, 1993. Google ScholarDigital Library
- 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
- H. Comon. Sufficient completeness, term rewriting system and anti-unification. In J. Siekmann, editor, Proceedings 8th International Conference on Automated Deduction, Oxford (UK), volume 230 of Lecture Notes in Computer Science, pages 128--140. Springer-Verlag, 1986. Google ScholarDigital Library
- H. Comon. Inductionless induction. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, chapter 14, pages 913--962. Elsevier Science, 2001.Google ScholarCross Ref
- H. Comon and F. Jacquemard. Ground reducibility is EXPTIME-complete. In Proc. 12th IEEE Symp. Logic in Computer Science, pages 26--34. IEEE Comp. Soc. Press, 1997. Google ScholarDigital Library
- E. Contejean, C. Marché, B. Monate, and X. Urbain. CiME version 2, 2000. http://cime.lri.fr/.Google Scholar
- N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17:279--301, 1982.Google ScholarCross Ref
- N. Dershowitz and J.-P. Jouannaud. Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems, pages 244--320. Elsevier Science Publishers B. V. (North-Holland), 1990. Also as: Research report 478, LRI.Google ScholarDigital Library
- M. C. et al. Maude: specification and programming in rewriting logic. Theoretical Computer Science, 285:187--243, August 2002. Google ScholarDigital Library
- 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 B. V. (North-Holland), 2001.Google Scholar
- O. Fissore, I. Gnaedig, and H. Kirchner. Outermost ground termination. In Proceedings of the 4th International Workshop on Rewriting Logic and Its Applications, volume 71 of Electronic Notes in Theoretical Computer Science, Pisa, Italy, September 2002. Elsevier Science Publishers B. V. (North-Holland).Google Scholar
- O. Fissore, I. Gnaedig, and H. Kirchner. A proof of weak termination providing the right way to terminate. In 1st International Colloquium on THEORETICAL ASPECTS OF COMPUTING, volume 3407 of Lecture Notes in Computer Science, pages 356--371, Guiyang, China, September 2004. Springer-Verlag. Google ScholarDigital Library
- O. Fissore, I. Gnaedig, and H. Kirchner. 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.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, R. Thiemann, P. Schneider-Kamp, and S. Falke. Improving dependency pairs. In Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR '03), volume 2850 of Lecture Notes in Artificial Intelligence, pages 165--179, Almaty, Kazakhstan, 2003. Springer-Verlag.Google ScholarCross Ref
- I. Gnaedig and H. Kirchner. Computing Constructor Forms with Non Terminating Rewrite Programs - Extended version. Technical report, LORIA, Nancy (France), 2006. Available at http://www.loria.fr/~gnaedig/PAPERS/REPORTS/comp-extended-2006.pdf.Google Scholar
- I. Gnaedig, H. Kirchner, and O. Fissore. Induction for innermost and outermost ground termination. Technical Report A01-R-178, LORIA, Nancy (France), September 2001.Google Scholar
- G. Huet and J.-M. Hullot. Proofs by induction in equational theories with constructors. Journal of Computer and System Sciences, 25(2):239--266, Oct. 1982. Preliminary version in Proceedings 21st Symposium on Foundations of Computer Science, IEEE, 1980.Google ScholarCross Ref
- J.-P. Jouannaud and E. Kounalis. Automatic proofs by induction in theories without constructors. Information and Computation, 82:1--33, 1989. Google ScholarDigital Library
- D. Kapur, P. Narendran, and H. Zhang. Proof by induction using test sets. In Proceedings 8th International Conference on Automated Deduction, Oxford (UK), volume 230 of Lecture Notes in Computer Science, pages 99--117. Springer-Verlag, 1986. Google ScholarDigital Library
- D. Kapur, P. Narendran, and H. Zhang. On sufficient completeness and related properties of term rewriting systems. Acta Informatica, 24:395--415, 1987.Google ScholarDigital Library
- P. Klint. A meta-environment for generating programming environments. ACM Transactions on Software Engineering and Methodology, 2:176--201, 1993. Google ScholarDigital Library
- E. Kounalis. Completeness in data type specifications. In B. Buchberger, editor, Proceedings EUROCAL Conference, Linz (Austria), volume 204 of Lecture Notes in Computer Science, pages 348--362. Springer-Verlag, 1985. Google ScholarDigital Library
- E. Kounalis. Testing for the ground (co-)reducibility property in term-rewriting systems. Theoretical Computer Science, 106:87--117, 1992. Google ScholarDigital Library
- A. Lazrek, P. Lescanne, and J.-J. Thiel. Tools for proving inductive equalities, relative completeness and Ω-completeness. Information and Computation, 84(1):47--70, Jan. 1990. Google ScholarDigital Library
- P.-E. Moreau, C. Ringeissen, and M. Vittek. A Pattern Matching Compiler for Multiple Target Languages. In G. Hedin, editor, 12th Conference on Compiler Construction, Warsaw (Poland), volume 2622 of LNCS, pages 61--76. Springer-Verlag, May 2003. Google ScholarDigital Library
- T. Nipkow and G. Weikum. A decidability result about sufficient completeness of axiomatically specified abstract data types. In 6th GI Conference, volume 145 of Lecture Notes in Computer Science, pages 257--268. Springer-Verlag, 1983. Google ScholarDigital Library
- D. Plaisted. Semantic confluence tests and completion methods. Information and Control, 65:182--215, 1985.Google ScholarCross Ref
Index Terms
- Computing constructor forms with non terminating rewrite programs
Recommendations
Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program Transformation
PPDP '19: Proceedings of the 21st International Symposium on Principles and Practice of Declarative ProgrammingWe present a framework for proving inductive theorems of first-order equational theories, using techniques of implicit induction developed in the field of term rewriting. In this framework, we make use of automated confluence provers, which have ...
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 ...
Sufficient completeness verification for conditional and constrained TRS
We present a procedure for checking sufficient completeness of conditional and constrained term rewriting systems containing axioms for constructors which may be constrained (by e.g. equalities, disequalities, ordering, membership, ). Such axioms allow ...
Comments