Modular heap analysis techniques analyze a program by computing summaries for every procedure in the program that describes its effects on an input heap, using pre-computed summaries for the called procedures. In A Framework For Efficient Modular Heap Analysis, the focus is on a family of modular heap analyses that summarize a procedure's heap effects using a context-independent, shape-graph-like summary that is agnostic to the aliasing in the input heap. These analyses are very efficient but their complexity and the absence of a theoretical formalization and correctness proofs makes it hard to produce correct extensions and modifications of these algorithms - whether to improve precision or scalability or to compute more information.

This book presents a modular heap analysis framework that generalizes these four analyses. It formalizes this framework as an abstract interpretation and establishes the correctness and termination guarantees. It formalizes the four analyses as instances of the framework. The formalization explains the basic principle behind such modular analyses and simplifies the task of producing extensions and variations of such analyses. It is written with exceptional clarity and is a delightful read for program analysis experts and novices alike.