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 …

When using a proof assistant to reason in an embedded logic--like separation logic--one
cannot benefit from the proof contexts and basic tactics of the proof assistant. This results in …

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 …

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 …

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 …

In the quest for tractable methods for reasoning about concurrent algorithms both
rely/guarantee logic and separation logic have made great advances. They both seek to …

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 …

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 …

Symbolic execution is a well-known program analysis technique which represents program
inputs with symbolic values instead of concrete, initialized, data and executes the program …