Software model checking Page 1 21 Software Model Checking RANJIT JHALA University of
California, San Diego and RUPAK MAJUMDAR University of California, Los Angeles We survey …

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 …

A new form of SAT-based symbolic model checking is described. Instead of unrolling the
transition relation, it incrementally generates clauses that are inductive relative to (and …

One of the most important industrial applications of SAT is currently Bounded Model
Checking (BMC). This technique is typically used for formal hardware verification in the …

We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL).
We present several efficient encodings that have size linear in the bound. Furthermore, we …

Scaling verification to large circuits requires some form of abstraction relative to the asserted
property. We describe a safety analysis of finite-state systems that generalizes from …

Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a first-
order formula with respect to some theory or combination of theories; Verification Modulo …

It is well-known that counterexamples produced by model checkers can provide a basis for
automated generation of test cases. However when this approach is used to meet a …

We present a general approach for verifying safety properties of Lustre programs
automatically. Key aspects of the approach are the choice of an expressive first-order logic …

IC3 and k-induction are commonly used in automated analysis of infinite-state systems. We
present a reformulation of IC3 that separates reachability checking from induction reasoning …