Designing and implementing distributed systems correctly is a very challenging task.
Recently, formal verification has been successfully used to prove the correctness of …

We describe a general framework c2i for generating an invariant inference procedure from
an invariant checking procedure. Given a checker and a language of possible invariants, c2i …

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 …

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 …

Building a summary for library code is a common approach to speeding up the analysis of
client code. In presence of callbacks, some reachability relationships between library nodes …

This paper presents a novel automated procedure for discovering expressive shape
specifications for sophisticated functional data structures. Our approach extracts potential …

The comprehensive functionality and nontrivial design of realistic general-purpose container
libraries pose challenges to formal verification that go beyond those of individual benchmark …

The comprehensive functionality and nontrivial design of realistic general-purpose container
libraries pose challenges to formal verification that go beyond those of individual benchmark …

We present a data-driven verification framework to automatically prove memory safety of
heap-manipulating programs. Our core contribution is a novel statistical machine learning …

We consider the problem of checking whether a proposed invariant ϕ expressed in first-
order logic with quantifier alternation is inductive, ie preserved by a piece of code. While the …