Instantiation of SMT problems modulo Integers - CAPP Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2010

Instantiation of SMT problems modulo Integers

Résumé

Many decision procedures for SMT problems rely more or less implicitly on an instantiation of the axioms of the theories under consideration, and differ by making use of the additional properties of each theory, in order to increase efficiency. We present a new technique for devising complete instantiation schemes on SMT problems over a combination of linear arithmetic with another theory T. The method consists in first instantiating the arithmetic part of the formula, and then getting rid of the remaining variables in the problem by using an instantiation strategy which is complete for T. We provide examples evidencing that not only is this technique generic (in the sense that it applies to a wide range of theories) but it is also efficient, even compared to state-of-the-art instantiation schemes for specific theories.

Dates et versions

hal-00940677 , version 1 (02-02-2014)

Identifiants

Citer

Mnacho Echenim, Nicolas Peltier. Instantiation of SMT problems modulo Integers. 2010. ⟨hal-00940677⟩
185 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More