Separation logic Page 1 86 COMMUNICATIONS OF THE ACM | FEBRUARY 2019 | VOL. 62 |
NO. 2 review articles A FUNDAMENTAL TECHNIQUE in reasoning about programs is the use …

In joint work with Peter O'Hearn and others, based on early ideas of Burstall, we have
developed an extension of Hoare logic that permits reasoning about low-level imperative …

A lightweight logical approach to race-free sharing of heap storage between concurrent
threads is described, based on the notion of permission to access. Transfer of permission …

Separation logic is a program logic for reasoning about programs that manipulate pointer
data structures. We describe Smallfoot, a tool for checking certain lightweight separation …

Separation logic is an extension of Hoare's logic which supports a local way of reasoning
about programs that mutate memory. We present a study of the semantic structures lying …

Static analysis tools have demonstrated effectiveness at finding bugs in real world code.
Such tools are increasingly widely adopted to improve software quality in practice …

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 …

There has been a large body of work on local reasoning for proving the absence of bugs, but
none for proving their presence. We present a new formal framework for local reasoning …

We investigate proof rules for information hiding, using the recent formalism of separation
logic. In essence, we use the separating conjunction to partition the internal resources of a …

We present a formal model of memory that both captures the low-level features of C's
pointers and memory, and that forms the basis for an expressive implementation of …