Canonized Rewriting and Ground AC Completion Modulo Shostak Theories : Design and Implementation

Sylvain Conchon 1, 2 Evelyne Contejean 2 Mohamed Iguernelala 2
1 PROVAL - Proof of Programs
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : AC-completion efficiently handles equality modulo associative and commutative function symbols. When the input is ground, the procedure terminates and provides a decision algorithm for the word problem. In this paper, we present a modular extension of ground AC-completion for deciding formulas in the combination of the theory of equality with user-defined AC symbols, uninterpreted symbols and an arbitrary signature disjoint Shostak theory X. Our algorithm, called AC(X), is obtained by augmenting in a modular way ground AC-completion with the canonizer and solver present for the theory X. This integration rests on canonized rewriting, a new relation reminiscent to normalized rewriting, which integrates canonizers in rewriting steps. AC(X) is proved sound, complete and terminating, and is implemented to extend the core of the Alt-Ergo theorem prover.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.inria.fr/hal-00798082
Contributor : Evelyne Contejean <>
Submitted on : Friday, March 8, 2013 - 7:13:28 AM
Last modification on : Thursday, April 5, 2018 - 12:30:09 PM

Links full text

Identifiers

Collections

Citation

Sylvain Conchon, Evelyne Contejean, Mohamed Iguernelala. Canonized Rewriting and Ground AC Completion Modulo Shostak Theories : Design and Implementation. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2012, 8 (3:16), pp.1-29. ⟨http://www.lmcs-online.org/ojs/viewarticle.php?id=1037&layout=abstract&iid=40⟩. ⟨10.2168/LMCS-8(3:16)2012⟩. ⟨hal-00798082⟩

Share

Metrics

Record views

201