This paper describes OpenSMT, an incremental, efficient, and open-source SMT-Solver. OpenSMT has been specifically designed to be easily extended with new theory-solvers, in order to be accessibleâ€¦ (More)

Satisfiability Modulo Theories (SMT) can be seen as an extended form of propositional satisfiability, where propositions are either simple boolean propositions or quantifierfree atomic constraints inâ€¦ (More)

The problem of deciding the satisfiability of a quantifier-fr ee formula with respect to a background theory, also known as Satisfiabi lity Modulo Theories (SMT), is gaining increasing relevance inâ€¦ (More)

Rarely verification problems originate from bit-level descriptions. Yet, most of the verification technologies are based on bit blasting, i.e., reduction to boolean reasoning. In this paper weâ€¦ (More)

Recent improvements in propositional satisfiability techniques (SAT) made it possible to tackle successfully some hard real-world problems (e.g., model-checking, circuit testing, propositionalâ€¦ (More)

Many approaches to deciding the satisfiability of quantifier free formulae with respect to a background theory T â€” also known as Satisfiability Modulo Theory, or SMT T â€” rely on the integrationâ€¦ (More)

We present MathSAT 4, a state-of-the-art SMT solver. MathSAT 4 handles several useful theories: (combinations of) equality and uninterpreted functions, difference logic, linear arithmetic, and theâ€¦ (More)

We present SAFARI, a model checker designed to prove (possibly universally quantified) safety properties of imperative programs with arrays of unknown length. SAFARI is based on an extension of lazyâ€¦ (More)