Symbolic model checking is an important tool for finding bugs (or proving the absence of
bugs) in modern system designs. Because of this, improving the ease of use, scalability, and …

Property-directed reachability (PDR) is a SAT/SMT-based reachability algorithm that
incrementally constructs inductive invariants. After it was successfully applied to hardware …

After many years of successful development of new approaches for software verification,
there is a need to consolidate the knowledge about the different abstract domains and …

We present AVR, a push-button model checker for verifying state transition systems directly
at the source-code level. AVR uses information embedded in the word-level syntax of the …

We present Universal Property Directed Reachability (PDR∀), a property-directed semi-
algorithm for automatic inference of invariants in a universal fragment of first-order logic …

Techniques for software verification are typically realized as cohesive units of software with
tightly coupled components. This makes it difficult to re-use components, and the potential …

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 …

Abstract smt-based model checkers, especially ic3-style ones, are currently the most
effective techniques for verification of infinite state systems. They infer global inductive …

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 …

We address the problem of verifying invariant properties on infinite-state systems. We
present a novel approach, IC3ia, for generalizing the IC3 invariant checking algorithm from …