• Publications
  • Influence
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
TLDR
We describe Smallfoot, a tool for checking certain lightweight separation logic specifications. Expand
Symbolic Execution with Separation Logic
TLDR
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). Expand
Shape Analysis for Composite Data Structures
TLDR
We propose a shape analysis that adapts to some of the complex composite data structures found in industrial systems-level programs. Expand
Scalable Shape Analysis for Systems Code
TLDR
We report on a new join operation ${\sqcup\dagger}$ for the separation domain which aggressively abstracts information for scalability yet does not lead to false error reports. Expand
A Decidable Fragment of Separation Logic
TLDR
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. Expand
SLAyer: Memory Safety for Systems-Level Code
TLDR
This paper describes SLAyer, a program analysis tool designed to automatically prove the absence of memory safety of industrial systems code. Expand
Thread Quantification for Concurrent Shape Analysis
TLDR
We present new algorithms, based on abstract interpretation, for automatically verifying properties of programs with an unbounded number of threads manipulating an unb bounded shared heap. Expand
Local Reasoning for Storable Locks and Threads
TLDR
We present a resource oriented program logic that is able to reason about concurrent heap-manipulating programs with unbounded numbers of dynamically-allocated locks and threads. Expand
Structuring the verification of heap-manipulating programs
TLDR
We propose a new proof technique for verification of higher-order imperative programs that is general, extendable, and supports very short proofs, even without significant use of automation by tactics. Expand
Interprocedural Shape Analysis with Separated Heap Abstractions
TLDR
We describe an interprocedural shape analysis that makes use of spatial locality (i.e. the fact that most procedures modify only a small subset of the heap) in its representation of abstract states. Expand
...
1
2
3
4
5
...