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

Abstract. This paper presents a novel shape analysis algorithm with local reasoning that is designed to analyze heap structures with structural invariants, such y-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 doublylinked list manipulations.

• Type: Conference
• Year: 2007
• Where: VMCAI
• Authors: Sigmund Cherem, Radu Rugina
• Keywords: Shape Analysis Algorithm, Single Heap Cell, Software Engineering, Structural Invariants, VMCAI 2007