Maintaining Doubly-Linked List Invariants in Shape Analysis with Local Reasoning

  • Sigmund Cherem
  • Radu Rugina
Conference paper

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

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4349)
Cite this paper as:
Cherem S., Rugina R. (2007) Maintaining Doubly-Linked List Invariants in Shape Analysis with Local Reasoning. 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

This paper presents a novel shape analysis algorithm with local reasoning that is designed to analyze heap structures with structural invariants, such as doubly-linked lists. The algorithm abstracts and analyzes one single heap cell at a time. In order to maintain the structural invariants, the analysis uses a local heap abstraction that models the sub-heap consisting of one cell and its immediate neighbors. The proposed algorithm can successfully analyze standard doubly-linked list manipulations.

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

  • Sigmund Cherem
    • 1
  • Radu Rugina
    • 1
  1. 1.Computer Science Department, Cornell University, Ithaca, NY 14853 

Personalised recommendations