Simultaneous checking of completeness and ground confluence

Proceedings ASE 2000: 15th IEEE International Conference on Automated Software Engineering

Volumn , Issue , 2000, Pages 143-151

  Bouhoula, A ^a,b  

^a LORIA   (France)

^b UNIVERSITY OF CARTHAGE   (Tunisia)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT DATA TYPES; SOFTWARE ENGINEERING; SPECIFICATIONS;

ALGEBRAIC SPECIFICATIONS; PARAMETERIZED; SOFTWARE SYSTEMS;

ALGEBRA;

EID: 0141693361     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASE.2000.873659     Document Type: Conference Paper

References (23)

1. K. Becker. Proving ground confluence and inductive validity in constructor based equational specifications. In Proc. TAPSOFT '93, volume 668 of Lecture Notes in Computer Science, pages 46-60. Springer-Verlag, 1993.
2. K. Becker. How to Prove Ground Confluence. SEKI-report SR-96-02, Universität Kaiserslautern, 1996.
3. A. Bouhoula. Using induction and rewriting to verify and complete parameterized specifications. Theoretical Computer Science, 170(1-2):245-276, 1996.
4. A. Bouhoula. Automated theorem proving by test set induction. Journal of Symbolic Computation, 23(1):47-77, 1997.
5. A. Bouhoula and J.-P. Jouannaud. Automata-driven automated induction. In Proc. 12th IEEE Symp. Logic in Computer Science, Warsaw (Poland), pages 14-25. IEEE Comp. Soc. Press, 1997.
6. A. Bouhoula, J.-P. Jouannaud, and J. Meseguer. Specification and proof in membership equational logic. Theoretical Computer Science, 236(1-2):35-132, 2000.
7. A. Bouhoula and M. Rusinowitch. Implicit induction in conditional theories. Journal of Automated Reasoning, 14(2):189-235, 1995.
8. H. Comon. Inductive proofs by specifications transformations. In Proc. 3rd Conference on Rewriting Techniques and Applications, Chapel Hill (N.C., USA), volume 355 of Lecture Notes in Computer Science, pages 76-91. Springer-Verlag, 1989.
9. N. Dershowitz. Corrigendum to termination of rewriting. Journal of Symbolic Computation, 4:409-410, 1987.
10. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In the Handbook of Theoretical Computer Science, volume B, chapter 6, pages 244-320. Elsevier Science Publishers B. V. (North-Holland) and The MIT press, 1990.
11. N. Dershowitz, M. Okada, and G. Sivakumar. Confluence of conditional rewrite systems. In Proc. 1st International Workshop on Conditional Term Rewriting Systems, Orsay (France), volume 308 of Lecture Notes in Computer Science, pages 31-44. Springer-Verlag, 1987.
12. L. Fribourg. A strong restriction of the inductive completion procedure. Journal of Symbolic Compulation, 8(3):253-276, 1989.
13. H. Ganzinger. Ground term confluence in parametric conditional equational specifications. In Proc. STACS 87, volume 247 of Lecture Notes in Computer Science, pages 286-298. Springer-Verlag, 1987.
14. R. Göbel. Ground confluence. In Proc. 2nd Conference on Rewriting Techniques and Applications, Bordeaux (France), volume 256 of Lecture Notes in Computer Science, pages 156-167. Springer-Verlag, 1987.
15. G. Huet and J.-M. Hullot. Proofs by induction in equational theories with constructors. Journal of Computer and System Sciences, 25(2):239-266, 1982.
16. J.-P. Jouannaud and E. Kounalis. Automatic proofs by induction in theories without constmctors. Information and Computation, 82:1-33, 1989.
17. S. Kaplan. Simplifying conditional term rewriting systems: Unification, termination and confluence. Journal of Symbolic Computation, 4(3):295-334, 1987.
18. D. Kapur, P. Narendan, and F. Otto. On ground confluence of term rewriting systems. Information and Computation, 86(1):14-31, 1990.
19. D. Kapur and P. Narendran. Double-exponential complexity of computing a complete set of AC-unifiers. In Proc. 7th IEEE Symp. Logic in Computer Science, Santa Cruz (California), pages 11-21, IEEE Comp. Soc. Press, 1992.
20. E. Kounalis and M. Rusinowitch. Studies on the ground convergence property of conditional theories. In Proc. AMAST, Iowa-City, pages 363-376, Workshop in Computing. Springer-Verlag, 1992.
21. P. Padawitz. The equational theory of parameterized specifications. Information and Computation, 76:121-137, 1988.
22. D. A. Plaisted. Semantic confluence tests and completion methods. Information and Control, 65(2/3):182-215, 1985.
23. M. Wirsing. Algebraic specification. In the Handbook of Theoretical Computer Science, volume B, chapter 13, pages 675-788. Elsevier Science Publishers B. V. (North-Holland) and The MIT press, 1990.