Smallfoot: Modular Automatic Assertion Checking with Separation Logic

The work

AuthorsJosh Berdine; Cristiano Calcagno; Peter W. O'Hearn
Editors
Typeincollection
Year2006
Citekeyberdine2006smallfoot

Where it appeared

Published inFormal Methods for Components and Objects
PublisherSpringer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Pages115--137

Identifiers

DOI10.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 hereagent via crossref
Added2026-08-26 00:00 UTC
Approved bya person 2026-08-26 14:44 UTC

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.