Chapter

Verification, Model Checking, and Abstract Interpretation

Volume 4349 of the series Lecture Notes in Computer Science pp 234-250

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

  • Sigmund CheremAffiliated withComputer Science Department, Cornell University, Ithaca, NY 14853
  • , Radu RuginaAffiliated withComputer Science Department, Cornell University, Ithaca, NY 14853

* Final gross prices may vary according to local VAT.

Get Access

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.