Given the central role that C continues to play in systems software, and the difficulty of
writing safe and correct C code, it remains a grand challenge to develop effective formal …

Fine-grained concurrent programs are difficult to get right, yet play an important role in
modern-day computers. We want to prove strong specifications of such programs, with …

Recent years have seen great advances towards verifying large-scale systems code.
However, these verifications are usually based on hand-written assembly or machine-code …

This paper describes a deductive approach to synthesizing imperative programs with
pointers from declarative specifications expressed in Separation Logic. Our synthesis …

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 …

Separation Logic (SL) with inductive definitions is a natural formalism for specifying complex
recursive data structures, used in compositional verification of programs manipulating such …

The symbolic-heap fragment of separation logic has been actively developed and
advocated for verifying the memory-safety property of computer programs. At present, one of …

We present a new flow framework for separation logic reasoning about programs that
manipulate general graphs. The framework overcomes problems in earlier developments: it …

This paper presents a complete decision procedure for the entire quantifier-free fragment of
Separation Logic (SL) interpreted over heaplets with data elements ranging over a …

We develop a doubly exponential decision procedure for the satisfiability problem of
guarded separation logic—a novel fragment of separation logic featuring user-supplied …