Sciweavers

295 search results - page 1 / 59
» SAT, SMT and Applications
Sort
View
FMCAD
2008
Springer
13 years 6 months ago
A Write-Based Solver for SAT Modulo the Theory of Arrays
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...
Miquel Bofill, Robert Nieuwenhuis, Albert Oliveras...
LPNMR
2009
Springer
13 years 11 months ago
SAT, SMT and Applications
Armin Biere
CAV
2007
Springer
212views Hardware» more  CAV 2007»
13 years 8 months ago
A Tutorial on Satisfiability Modulo Theories
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...
Leonardo Mendonça de Moura, Bruno Dutertre,...
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
13 years 2 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
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 ...
Alessandro Cimatti, Anders Franzén, Alberto...
CAV
2009
Springer
123views Hardware» more  CAV 2009»
13 years 8 months ago
On Using Floating-Point Computations to Help an Exact Linear Arithmetic Decision Procedure
We consider the decision problem for quantifier-free formulas whose atoms are linear inequalities interpreted over the reals or rationals. This problem may be decided using satisf...
David Monniaux