Theory decision by decomposition - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Symbolic Computation Année : 2010

Theory decision by decomposition

Résumé

The topic of this article is decision procedures for satisfiability modulo theories (SMT) of arbitrary quantifier-free formulae. We propose an approach that decomposes the formula in such a way that its definitional part, including the theory, can be compiled by a rewrite-based first-order theorem prover, and the residual problem can be decided by an SMT-solver, based on the Davis-Putnam-Logemann-Loveland procedure. The resulting decision by stages mechanism may unite the complementary strengths of first-order provers and SMT-solvers. We demonstrate its practicality by giving decision procedures for the theories of records, integer offsets and arrays, with or without extensionality, and for combinations including such theories

Dates et versions

hal-00940845 , version 1 (03-02-2014)

Identifiants

Citer

Maria Paola Bonacina, Mnacho Echenim. Theory decision by decomposition. Journal of Symbolic Computation, 2010, 45 (2), pp.229-260. ⟨10.1016/j.jsc.2008.10.008⟩. ⟨hal-00940845⟩
46 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More