Satisfiability Procedures for Combination of Theories Sharing Integer Offsets - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Satisfiability Procedures for Combination of Theories Sharing Integer Offsets

Résumé

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 non déposé

Dates et versions

inria-00427870 , version 1 (28-10-2009)

Identifiants

  • HAL Id : inria-00427870 , version 1

Citer

Enrica Nicolini, Christophe Ringeissen, Michael Rusinowitch. Satisfiability Procedures for Combination of Theories Sharing Integer Offsets. 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems - TACAS 2009, Mar 2009, York, United Kingdom. pp.428-442. ⟨inria-00427870⟩
92 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More