In this paper, we present SeaHorn, a software verification framework. The key distinguishing
feature of SeaHorn is its modular design that separates the concerns of the syntax of the …

Abstraction, counterexample-guided refinement, and interpolation are techniques that are
essential to the success of predicate-based program analysis. These techniques have not …

In this paper, we present Theta, a configurable model checking framework. The goal of the
framework is to support the design, execution and evaluation of abstraction refinement …

We formalize the problem of program verification as a learning problem, showing that
invariants in program verification can be regarded as geometric concepts in machine …

One of the main challenges in software verification is efficient and precise compositional
analysis of programs with procedures and loops. Interpolation methods remains one of the …

We describe a compositional approach to Craig interpolation based on the heuristic that
simpler proofs of special cases are more likely to generalize. The method produces simple …

Software model checkers based on under-approximations and SMT solvers are very
successful at verifying safety (ie, reachability) properties. They combine two key ideas–(a) …

Many problems in program analysis, verification, and synthesis require inferring
specifications of unknown procedures. Motivated by a broad range of applications, we …

Abstract Recurrent Neural Networks (RNNs) are one of the most successful neural network
architectures that deal with temporal sequences, eg, speech and text recognition. Recently …

Abstract Current SAT-based Model Checking is based on two major approaches:
Interpolation-based (Imc)(global, with unrollings) and Property Directed Reachability/IC3 …