Automatic Decidability: A Schematic Calculus for Theories with Counting Operators - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Automatic Decidability: A Schematic Calculus for Theories with Counting Operators

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.
No file

Dates and versions

hal-00878657 , version 1 (30-10-2013)

Identifiers

Cite

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⟩
209 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More