Maintaining doubly-linked list invariants in shape analysis with local reasoning

Authors:
Sigmund Cherem;Radu Rugina
Affiliations:
Computer Science Department, Cornell University, Ithaca, NY;Computer Science Department, Cornell University, Ithaca, NY
Venue:
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Year:
2007

Citing 28
Cited 5

Analysis of pointers and structures

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
A general data dependence test for dynamic, pointer-based data structures

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Interprocedural may-alias analysis for pointers: beyond k-limiting

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Solving shape-analysis problems in languages with destructive updating

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Solving shape-analysis problems in languages with destructive updating

ACM Transactions on Programming Languages and Systems (TOPLAS)
Parametric shape analysis via 3-valued logic

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Putting static analysis to work for verification: A case study

Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
BI as an assertion language for mutable data structures

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic predicate abstraction of C programs

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
The pointer assertion logic engine

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Parametric shape analysis via 3-valued logic

ACM Transactions on Programming Languages and Systems (TOPLAS)
Flow analysis and optimization of LISP-like structures

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Parallelizing Programs with Recursive Data Structures

IEEE Transactions on Parallel and Distributed Systems
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Shape Analysis through Predicate Abstraction and Model Checking

VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
TVLA: A System for Implementing Static Analyses

SAS '00 Proceedings of the 7th International Symposium on Static Analysis
Detecting Parallelism in C Programs with Recursive Darta Structures

CC '98 Proceedings of the 7th International Conference on Compiler Construction
Region-based shape analysis with tracked locations

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verifying properties of well-founded linked lists

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compile-time deallocation of individual objects

Proceedings of the 5th international symposium on Memory management
Static analysis of accessed regions in recursive data structures

SAS'03 Proceedings of the 10th international conference on Static analysis
Interprocedural shape analysis with separated heap abstractions

SAS'06 Proceedings of the 13th international conference on Static Analysis
Shape analysis by predicate abstraction

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
A logic and decision procedure for predicate abstraction of heap-manipulating programs

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Data structure specifications via local equality axioms

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Interprocedural shape analysis for cutpoint-free programs

SAS'05 Proceedings of the 12th international conference on Static Analysis
A local shape analysis based on separation logic

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Relational inductive shape analysis

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Masked types for sound object initialization

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Precise shape analysis using field sensitivity

Proceedings of the 27th Annual ACM Symposium on Applied Computing
Shape analysis with structural invariant checkers

SAS'07 Proceedings of the 14th international conference on Static Analysis
Precise shape analysis using field sensitivity

Innovations in Systems and Software Engineering

Quantified Score

Hi-index	0.00

Visualization

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.