Sledgehammer is a component of Isabelle/HOL that employs resolution-based first-order
automatic theorem provers (ATPs) to discharge goals arising in interactive proofs. It …

This paper presents a new method for generating inductive loop invariants that are
expressible as boolean combinations of linear integer constraints. The key idea underlying …

Computer vision systems today fail frequently. They also fail abruptly without warning or
explanation. Alleviating the former has been the primary focus of the community. In this work …

Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in
higher-order logic by calling the automated provers for first-order logic E, SPASS and …

Abstract k-induction is a promising technique to extend bounded model checking from
falsification to verification. In software verification, k-induction works only if auxiliary …

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

We present combined-case k-induction, a novel technique for verifying software programs.
This technique draws on the strengths of the classical inductive-invariant method and a …

The safety of infinite state systems can be checked by a backward reachability procedure.
For certain classes of systems, it is possible to prove the termination of the procedure and …

The importance and impact of the Boolean satisfiability (SAT) problem in many practical
settings is well-known. Besides SAT, a number of computational problems related with …

Many invariant inference techniques reason simultaneously about states and predicates,
and it is well-known that these two kinds of reasoning are in some sense dual to each other …