Smallfoot: Modular Automatic Assertion Checking with Separation Logic
The work
| Authors | Josh Berdine; Cristiano Calcagno; Peter W. O'Hearn |
|---|---|
| Editors | |
| Type | incollection |
| Year | 2006 |
| Citekey | berdine2006smallfoot |
Where it appeared
| Published in | Formal Methods for Components and Objects |
|---|---|
| Publisher | Springer Berlin Heidelberg |
| Series | Lecture Notes in Computer Science |
| Pages | 115--137 |
Identifiers
| DOI | 10.1007/11804192_6 |
|---|
Access
| Landing page | https://doi.org/10.1007/11804192_6 |
|---|
Abstract
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 logic specifications. The assertions describe the shapes of data structures rather than their detailed contents, and this allows reasoning to be fully automatic. The presentation in the paper is tutorial in style. We illustrate what the tool can do via examples which are oriented toward novel aspects of separation logic, namely: avoidance of frame axioms (which say what a procedure does not change); embracement of "dirty" features such as memory disposal and address arithmetic; information hiding in the presence of pointers; and modular reasoning about concurrent programs.
How it got here
| How it got here | agent via crossref |
|---|---|
| Added | 2026-08-26 00:00 UTC |
| Approved by | a person 2026-08-26 14:44 UTC |
Filed under
Cite it as
@incollection{berdine2006smallfoot,
title = {Smallfoot: Modular Automatic Assertion Checking with Separation Logic},
author = {Josh Berdine and Cristiano Calcagno and Peter W. O'Hearn},
year = {2006},
booktitle = {Formal Methods for Components and Objects},
publisher = {Springer Berlin Heidelberg},
series = {Lecture Notes in Computer Science},
pages = {115--137},
doi = {10.1007/11804192_6},
}
This record lives at https://refs.drheap.org/berdine2006smallfoot/ and will keep doing so.