Simultaneous checking of completeness and ground confluence for algebraic specifications

ACM Transactions on Computational Logic

Volumn 10, Issue 3, 2009, Pages

  Bouhoula, Adel ^a,b  

^a UNIVERSITY OF CARTHAGE   (Tunisia)

^b UNIVERSITY OF CARTHAGE   (Tunisia)

Author keywords

Algebraic specifications; Automated deduction; Completeness; Ground confluence; Parameterization; Term rewriting systems

Indexed keywords

ALGEBRAIC SPECIFICATIONS; AUTOMATED DEDUCTION; COMPLETENESS; GROUND CONFLUENCE; TERM REWRITING SYSTEMS;

ALGEBRA; COMPUTATIONAL MECHANICS; COMPUTER SOFTWARE;

SPECIFICATIONS;

EID: 67249165776     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1507244.1507250     Document Type: Article

References (42)

1. BECKER, K. 1993. Proving ground confluence and inductive validity in constructor based equa- tional specifications. In Proceedings of the 4th International Joint Conference on Theory and Practice of Software Development.M.-C. Gaudel and J.-P. Jouannaud, Eds. Lecture Notes in Computer Science, vol. 668. Springer, 46-60.
2. BECKER, K. 1996. How to prove ground confluence. SEKI-rep. SR-96-02, Universitat Kaiser- slautern.
3. BOUHOULA, A. 1996. Using induction and rewriting to verify and complete parameterized specifications. Theor. Comput. Sci. 170,1-2, 245-276.
4. BOUHOULA, A. 1997. Automated theorem proving by test set induction. J. Symbol. Comput. 23,1, 47-77.
5. BOUHOULA, A. 2000. Simultaneous checking of completeness and ground confluence. In Proceedings of the 15th IEEE International Conference on Automated Software Engineering.IEEE Computer Society Press, 143-151.
6. BOUHOULA,A. AND JACQUEMARD, F. 2007. Verifying regular trace properties of security protocols with explicit destructors and implicit induction. In Proceedings of the Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis (FCS-ARSPA-07),27-44.
7. BOUHOULA,A. AND JOUANNAUD, J.-P. 2001. Automata-Driven automated induction. Inf. Comput. 169,1, 1-22.
8. BOUHOULA, A., JOUANNAUD, J.-P., AND MESEGUER, J. 2000. Specification and proof in membership equational logic. Theor. Comput. Sci. 170,1-2, 35-132.
9. BOUHOULA, A., KOUNALIS, E., AND RUSINOWITCH, M. 1995. Automated mathematical induction. J. Logic Comput. 5,5, 631-668.
10. BOUHOULA,A. AND RUSINOWITCH, M. 1995. Implicit induction in conditional theories. J. Autom. Reasoning 14,2, 189-235.
11. COMON, H. 1986. Sufficient completeness, term rewriting system and anti-unification. In Proceedings of the 8th International Conference on Automated Deduction,J. Siekmann, Ed. Lecture Notes in Computer Science, vol. 230. Springer, 128-140.
12. COMON, H. 1989. Inductive proofs by specifications transformations. In Proceedings of the 3rd Conference on Rewriting Techniques and Applications, N. Dershowitz, Ed. Lecture Notes in Computer Science, vol. 355. Springer, 76-91.
13. DERSHOWITZ, N. 1983. Well-Founded orderings. Tech. rep. ATR-83-8478-3, Office of Information Sciences Research, The Aerospace Corporation, El Segundo, California. May.
14. DERSHOWITZ, N. 1987. Corrigendum to termination of rewriting. J Symbol. Comput. 4,3,409-410.
15. DERSHOWITZ,N. AND JOUANNAUD, J.-P. 1990. Handbook of Theoretical Computer Science.Vol. B. Elsevier Science B. V., North-Holland, Chapter 6: Rewrite Systems, 244-320.
16. DERSHOWITZ,N. AND OKADA, M. 1990. A rationale for conditional equational programming. Theor. Comput. Sci. 75,111-138.
17. DERSHOWITZ, N., OKADA, M., AND SIVAKUMAR, G. 1987. Confluence of conditional rewrite systems. In Proceedings of the 1st International Workshop on Conditional Term Rewriting Systems,J.-P. Jouannaud and S. Kaplan, Eds. Lecture Notes in Computer Science, vol. 308. Springer, 31-44.
18. EHRIG,H. AND MAHR, B. 1985. Fundamentals of Algebraic Specification 1. Equations and Initial Semantics.EATCS Monographs on Theoretical Computer Science, vol. 6. Springer.
19. FRIBOURG, L. 1989. A strong restriction of the inductive completion procedure. J. Symbol. Comput. 8,3, 253-276.
20. FUTATSUGI, K., GOGUEN, J. A., JOUANNAUD, J.-P., AND MESEGUER, J. 1985. Principles of OBJ-2. In Proceedings of the 12th ACM Symposium on Principles of Programming Languages,B. Reid, Ed. ACM, 52-66.
21. GANZINGER, H. 1987. Ground term confluence in parametric conditional equational specifications. In Proceedings of the Annual Symposium on Theoretical Aspects of Computer Science (STACS'87),F. J. Brandenburg et al. Eds. Lecture Notes in Computer Science, vol. 247. Springer, 286-298.
22. GÖBEL, R. 1987. Ground confluence. In Proceedings of the 2nd Conference on Rewriting Techniques and Applications, P. Lescanne, Ed. Lecture Notes in Computer Science, vol. 256. Springer, 156-167.
23. GOGUEN,J.A. AND MESEGUER, J. 1988. Order-Sorted algebra I: Partial and overloaded operations, errors and inheritance. Tech. rep., SRI International, Computer Science Lab. Given as lecture at a Seminar on Types, Carnegie-Mellon University, June 1983.
24. GRAMLICH,B. AND WIRTH, C.-P. 1996. Confluence of terminating conditional rewrite systems revisited. In Proceedings of the 7th Conference on Rewriting Techniques and Applications,H. Ganzinger, Ed. Lecture Notes in Computer Science, vol. 1103. Springer), 245-259.
25. GUTTAG,J.V. AND HORNING, J. J. 1978. The algebraic specification of abstract data types. Acta Inf. 10,27-52.
26. HUET,G. AND HULLOT, J.-M. 1982. Proofs by induction in equational theories with constructors. J. Comput. Syst. Sci. 25,2, 239-266.
27. Preliminary version in Proceedings of the 21st Symposium on Foundations of Computer Science,IEEE, 1980.
28. JOUANNAUD, J.-P. AND KOUNALIS, E. 1989. Automatic proofs by induction in theories without constructors. Inf. Comput. 82,1-33.
29. KAPLAN, S. 1987. Simplifying conditional term rewriting systems: Unification, termination and confluence. J Symbol. Comput. 4,3, 295-334.
30. KAPUR, D. 1994. An automated tool for analyzing completeness of equational specifications. In Proceedings of the International Symposium on Software Testing and Analysis (ISSTA), Special Issue of Software Engineering Notes, J. Siekmann, Ed. ACM Press, 28-43.
31. KAPUR, D., NARENDAN,P., AND OTTO, F. 1990. On ground confluence of term rewriting systems. Inf. Comput. 86,1, 14-31.
32. KAPUR,D. AND NARENDRAN, P. 1992. Double-Exponential complexity of computing a complete set of AC-unifiers. In Proceedings of the 9th IEEE Symposium on Logic in Computer Science.IEEE.
33. KAPUR, D., NARENDRAN, P., ROSENKRANTZ, D.-J., AND ZHANG, H. 1991. Sufficient-Completeness, ground-reducibility and their complexity. Acta Inf. 28,4, 311-350.
34. KOUNALIS, E. 1985. Completeness in data type specifications. In Proceedings EUROCAL Conference,B. Buchberger, Ed. Lecture Notes in Computer Science, vol. 204. Springer, 348-362.
35. KOUNALIS,E. AND RUSINOWITCH, M. 1991. Studies on the ground convergence property of conditional theories. In Proceedings of the AMAST Workshop in Computing.Springer.
36. KÜCHLIN, W. 1985. A confluence criterion based on the generalised Knuth- Bendix algorithm. In Proceedings of the EUROCAL Conference,B. Buchberger, Ed. Lecture Notes in Computer Science, vol. 204. Springer, 390-399.
37. LAZREK, A., LESCANNE,P., AND THIEL, J.-J. 1990. Tools for proving inductive equalities, relative completeness and ω-completeness. Inf. Comput. 84,1, 47-70.
38. PADAWITZ, P. 1988. The equational theory of parameterized specifications. Inf. Comput. 76,121-137.
39. PLAISTED, D. A. 1985. Semantic confluence tests and completion methods. Inf. Control 65,2-3, 182-215.
40. SCHMIDT-SCHAUSS, M. 1989. Computational Aspects of an Order-Sorted Logic with Term Declarations.Lecture Notes in Computer Science, vol. 395. Springer.
41. SMOLKA, G., NUTT, W., GOGUEN,J. A., AND MESEGUER, J. 1987. Order sorted equational computation. In Proceedings ofthe Colloquium on Resolution ofEquations in Algebraic Structures. THIEL, J.-J. 1984. Stop losing sleep over incomplete data type specifications. In Proceedings of the 11th ACM Symposium on Principles of Programming Languages. ACM, 76-82.
42. WIRSING, M. 1990. Algebraic specification. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics,J. van Leeuwen et al., Eds. Elsevier and MIT Press, Chapter 13, 675-788.