HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

A New Procedure for Simultaneously Checking Completeness and Ground Confluence

Adel Bouhoula 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Algebraic specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundamental notions for building algebraic specifications in a correct and modular way. Related works for checking ground confluence are based on the completion techniques or on the test that all critical pairs between axioms are valid w.r.t. a sufficient criterion for ground confluence. It is generally accepted that such techniques may be very inefficient even for very small specifications. Indeed, the completion procedure often diverges and there often exist many critical pairs of the axioms. In this paper, we present a new procedure for simultaneously checking completeness and ground confluence for specifications with free/non-free constructors and parameterized specifications. If the specification is not complete or not ground confluent, then our procedure will output the set of patterns on whose ground instances a function is not defined and it can easily identify the rules that break ground confluence. Our procedure is the first one which is complete and it always terminates under the assumption of an oracle for deciding (joinable-) inductive properties. In contrast to previous works, our method does not rely on completion techniques and does not require the computation of critical pairs of the axioms. The method has been implemented in the prover SPIKE. This system allowed us to prove the completeness and the ground confluence of many specifications in a completely automatic way where related techniques diverge or generate very complex proofs.
Document type :
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 8:40:38 AM
Last modification on : Friday, February 4, 2022 - 3:30:54 AM


  • HAL Id : inria-00098945, version 1



Adel Bouhoula. A New Procedure for Simultaneously Checking Completeness and Ground Confluence. [Intern report] 99-R-420 || bouhoula99e, 1999. ⟨inria-00098945⟩



Record views