A decision procedure is an algorithm that, given a decision problem, terminates with a
correct yes/no answer. In this book, we focus on decision procedures for decidable first …

Resources, Concurrency and Local Reasoning Page 1 To appear in Theoretical Computer
Science Resources, Concurrency and Local Reasoning ∗ Peter W. O’Hearn Queen Mary …

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 …

Separation Logic is the twenty-first-century variant of Hoare Logic that permits verification of
pointer-manipulating programs. This book covers practical and theoretical aspects of …

This paper describes a compositional shape analysis, where each procedure is analyzed
independently of its callers. The analysis uses an abstract domain based on a restricted …

The accurate and efficient treatment of mutable data structures is one of the outstanding
problem areas in automatic program verification and analysis. Shape analysis is a form of …

We describe a sound method for automatically proving Hoare triples for loop-free code in
Separation Logic, for certain preconditions and postconditions (symbolic heaps). The …

LNCS 3920 - A Local Shape Analysis Based on Separation Logic Page 1 A Local Shape
Analysis Based on Separation Logic Dino Distefano1, Peter W. O’Hearn1, and Hongseok …

LNCS 3170 - Resources, Concurrency and Local Reasoning Page 1 Resources, Concurrency
and Local Reasoning Peter W. O’Hearn Queen Mary, University of London Abstract. In this …

A number of tools have been developed for carrying out separation-logic proofs
mechanically using an interactive proof assistant. One of the most advanced such tools is …