The quality and the correctness of software are often the greatest concern in electronic
systems. Formal verification tools can provide a guarantee that a design is free of specific …

Abstract Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …

Software bugs are a well-known source of security vulnerabilities. One technique for finding
bugs, symbolic execution, considers all possible inputs to a program but suffers from …

A decision procedure is an algorithm that, given a decision problem, terminates with a
correct yes/no answer. In this book, we focus on decision procedures for decidable first …

STP is a decision procedure for the satisfiability of quantifier-free formulas in the theory of bit-
vectors and arrays that has been optimized for large problems encountered in software …

This article provides a detailed description of the automatic theorem prover Simplify, which is
the proof engine of the Extended Static Checkers ESC/Java and ESC/Modula-3. Simplify …

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 …

Synthesis of reversible logic has become a very important research area in recent years.
Applications can be found in the domain of low-power design, optical computing, and …

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 …

We present a new decision procedure for finite-precision bit-vector arithmetic with arbitrary
bit-vector operations. Our procedure alternates between generating under-and over …