17 search results - page 1 / 4 » Reasoning about comprehensions with first-order SMT solvers |
9
Voted
SAC
2009
ACM
14 years 5 months ago
2009
ACM
TACAS
2010
Springer
13 years 8 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 ...
ATVA
2007
Springer
14 years 5 months ago
2007
Springer
Automated software verification has made great progress recently, and a key enabler of this progress has been the advances in efficient, automated decision procedures suitable fo...
LPAR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We present a novel way for reasoning about (possibly ir)rational quantifier-free non-linear arithmetic by a reduction to SAT/SMT. The approach is incomplete and dedicated...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
The transition from single-core to multi-core processors has made multi-threaded software an important subject in computer aided verification. Here, we describe and evaluate an ex...