18 search results - page 1 / 4 » A Write-Based Solver for SAT Modulo the Theory of Arrays |
FMCAD
2008
Springer
13 years 6 months ago
2008
Springer
The extensional theory of arrays is one of the most important ones for applications of SAT Modulo Theories (SMT) to hardware and software verification. Here we present a new T-solv...
CAV
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
FROCOS
2007
Springer
13 years 11 months ago
2007
Springer
We offer a transition system representing a high-level but detailed architecture for SMT solvers that combine a propositional SAT engine with solvers for multiple disjoint theorie...
FROCOS
2011
Springer
12 years 4 months ago
2011
Springer
A dominant approach to Satisfiability Modulo Theories (SMT) relies on the integration of a Conflict-Driven-Clause-Learning (CDCL) SAT solver and of a decision procedure able to h...
TACAS
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...