Satisfiability Procedures for Combination of Theories Sharing Integer Offsets - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2008

Satisfiability Procedures for Combination of Theories Sharing Integer Offsets

(1) , (1) , (1)
1

Abstract

We present a novel technique to combine satisfiability procedures for theories that model some data-structures and that share the integer offsets. This procedure extends the Nelson-Oppen approach to a family of non-disjoint theories that have practical interest in verification. The result is derived by showing that the considered theories satisfy the hypotheses of a general result on non-disjoint combination. In particular, the capability of computing logical consequences over the shared signature is ensured in a non trivial way by devising a suitable complete superposition calculus.
Fichier principal
Vignette du fichier
RR-6697.pdf (407.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00331735 , version 1 (17-10-2008)
inria-00331735 , version 2 (27-04-2009)

Identifiers

  • HAL Id : inria-00331735 , version 2

Cite

Enrica Nicolini, Christophe Ringeissen, Michael Rusinowitch. Satisfiability Procedures for Combination of Theories Sharing Integer Offsets. [Research Report] RR-6697, INRIA. 2008, pp.22. ⟨inria-00331735v2⟩
138 View
163 Download

Share

Gmail Facebook Twitter LinkedIn More