Shape Analysis of Single-Parent Heaps
- Cite this paper as:
- Balaban I., Pnueli A., Zuck L.D. (2007) Shape Analysis of Single-Parent Heaps. In: Cook B., Podelski A. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2007. Lecture Notes in Computer Science, vol 4349. Springer, Berlin, Heidelberg
We define the class of single-parent heap systems, which rely on a singly-linked heap in order to model destructive updates on tree structures. This encoding has the advantage of relying on a relatively simple theory of linked lists in order to support abstraction computation. To facilitate the application of this encoding, we provide a program transformation that, given a program operating on a multi-linked heap without sharing, transforms it into one over a single-parent heap. It is then possible to apply shape analysis by predicate and ranking abstraction as in . The technique has been successfully applied on examples with trees of fixed arity (balancing of and insertion into a binary sort tree).
Unable to display preview. Download preview PDF.