Shape Analysis of Single-Parent Heaps

  • Ittai Balaban
  • Amir Pnueli
  • Lenore D. Zuck
Conference paper

DOI: 10.1007/978-3-540-69738-1_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4349)
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

Abstract

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 [3]. The technique has been successfully applied on examples with trees of fixed arity (balancing of and insertion into a binary sort tree).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Ittai Balaban
    • 1
  • Amir Pnueli
    • 1
    • 2
  • Lenore D. Zuck
    • 3
  1. 1.New York University, New York 
  2. 2.Weizmann Institute of Science 
  3. 3.University of Illinois at Chicago 

Personalised recommendations