Skip to Main content Skip to Navigation
Conference papers

Automatic Decidability: A Schematic Calculus for Theories with Counting Operators

Elena Tushkanova 1 Christophe Ringeissen 1 Alain Giorgetti 1 Olga Kouchnarenko 1
1 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : Many verification problems can be reduced to a satisfiability problem modulo theories. For building satisfiability procedures the rewriting-based approach uses a general calculus for equational reasoning named paramodulation. Schematic paramodulation, in turn, provides means to reason on the derivations computed by paramodulation. Until now, schematic paramodulation was only studied for standard paramodulation. We present a schematic paramodulation calculus modulo a fragment of arithmetics, namely the theory of Integer Offsets. This new schematic calculus is used to prove the decidability of the satisfiability problem for some theories equipped with counting operators. We illustrate our theoretical contribution on theories representing extensions of classical data structures, e.g., lists and records. An implementation within the rewriting-based Maude system constitutes a practical contribution. It enables automatic decidability proofs for theories of practical use.
Document type :
Conference papers
Complete list of metadatas
Contributor : Christophe Ringeissen <>
Submitted on : Wednesday, October 30, 2013 - 2:32:25 PM
Last modification on : Wednesday, September 16, 2020 - 10:43:30 AM



Elena Tushkanova, Christophe Ringeissen, Alain Giorgetti, Olga Kouchnarenko. Automatic Decidability: A Schematic Calculus for Theories with Counting Operators. RTA - 24th International Conference on Rewriting Techniques and Applications - 2013, Jun 2013, Eindhoven, Netherlands. pp.303-318, ⟨10.4230/LIPIcs.RTA.2013.303⟩. ⟨hal-00878657⟩



Record views