We introduce relaxed separation logic (RSL), the first program logic for reasoning about
concurrent programs running under the C11 relaxed memory model. From a user's …

Separation logic (SL) has gained widespread popularity because of its ability to succinctly
express complex invariants of a program's heap configurations. Several specialized provers …

Separation Logic is a widely used formalism for describing dynamically allocated linked data
structures, such as lists, trees, etc. The decidability status of various fragments of the logic …

We present GRASShopper, a tool for compositional verification of heap-manipulating
programs against user-provided specifications. What makes our tool unique is its decidable …

Separation logic (SL) is a widely used formalism for verifying heap manipulating programs.
Existing SL solvers focus on decidable fragments for list-like structures. More complex data …

We present a new modular shape analysis that can synthesize heap memory specification
on a per method basis. We rely on a second-order biabduction mechanism that can give …

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

We propose a new approach to shape analysis of programs with linked lists that use low-
level memory operations. Such operations include pointer arithmetic, safe usage of invalid …

Symbiotic 10 brings four substantial improvements. First, we extended our clone of Klee
called JetKlee with lazy memory initialization. With this extension, JetKlee can symbolically …

We consider verification of programs manipulating dynamic linked data structures such as
various forms of singly and doubly-linked lists or trees. We consider important properties for …