Propositional bounded model checking has been applied successfully to verify embedded
software, but remains limited by increasing propositional formula sizes and the loss of high …

Abstract Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a
first-order formula with respect to some decidable first-order theory T (SMT (T)). These …

C bounded model checking (cbmc) has proved to be a successful approach to automatic
software analysis. The key idea is to (i) build a propositional formula whose models …

SMT solvers are widely used as core engines in many applications. Therefore, robustness
and correctness are essential criteria. Current testing techniques used by developers of SMT …

Abstract C Bounded Model Checking (CBMC) has proven to be a successful approach to
automatic software analysis. The key idea is to (i) build a propositional formula whose …

We present a detailed description of a theory solver for Linear Integer Arithmetic (LA (Z)) in a
lazy SMT context. Rather than focusing on a single technique that guarantees theoretical …

Rarely verification problems originate from bit-level descriptions. Yet, most of the verification
technologies are based on bit blasting, ie, reduction to boolean reasoning. In this paper we …

The dominant state-of-the-art approach for solving bit-vector formulas in Satisfiability Modulo
Theories (SMT) is bit-blasting, an eager reduction to propositional logic. Bit-blasting is …

We present an interpolation procedure for the theory of fixed-size bit-vectors, which allows to
apply effective interpolation-based techniques for software verification without giving up the …

The state of the art for bit-precise reasoning in the context of Satisfiability Modulo Theories
(SMT) is a SAT-based technique called bit-blasting where the input formula is first simplified …