A Decidable Logic for Describing Linked Data Structures

Authors:
Michael Benedikt;Thomas W. Reps;Shmuel Sagiv
Affiliations:
-;-;-
Venue:
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Year:
1999

Citing 21
Cited 22

Detecting conflicts between structure accesses

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Dependence analysis for pointer variables

PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Analysis of pointers and structures

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Parallelizing programs with recursive data structures

Parallelizing programs with recursive data structures
Abstractions for recursive pointer data structures: improving the analysis and transformation of imperative programs

PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
Graph types

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A lattice for abstract interpretation of dynamic (LISP-like) structures

Information and Computation
Interprocedural may-alias analysis for pointers: beyond k-limiting

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Compiler-based prefetching for recursive data structures

Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
Automatic verification of pointer programs using monadic second-order logic

Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Shape types

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Putting pointer analysis to work

POPL '98 Proceedings of the 25th 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
A Unified Approach to Path Problems

Journal of the ACM (JACM)
Fast Algorithms for Solving Path Problems

Journal of the ACM (JACM)
A flexible approach to interprocedural data flow analysis and programs with recursive data structures

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

IEEE Transactions on Parallel and Distributed Systems
Analysis of Dynamic Structures for Efficient Parallel Execution

Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing
Connection Analysis: A Practical Interprocedural Heap Analysis for C

LCPC '95 Proceedings of the 8th International Workshop on Languages and Compilers for Parallel Computing
Analysis of recursive types in an imperative language

Analysis of recursive types in an imperative language

Shape Analysis through Predicate Abstraction and Model Checking

VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
On Garbage and Program Logic

FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Computability and Complexity Results for a Spatial Assertion Language for Data Structures

FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Alias Types for Recursive Data Structures

TIC '00 Selected papers from the Third International Workshop on Types in Compilation
Safe Approximation of Data Dependencies in Pointer-Based Structures

LCPC '00 Proceedings of the 13th International Workshop on Languages and Compilers for Parallel Computing-Revised Papers
TestEra: A Novel Framework for Automated Testing of Java Programs

Proceedings of the 16th IEEE international conference on Automated software engineering
Quantitative Separation Logic and Programs with Lists

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
A Logic-Based Framework for Reasoning about Composite Data Structures

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Verifying heap-manipulating programs in an SMT framework

ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Quantitative Separation Logic and Programs with Lists

Journal of Automated Reasoning
Monitoring unmanaged business processes

OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I
A logic of reachable patterns in linked data-structures

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
A tableau-based decision procedure for a fragment of graph theory involving reachability and acyclicity

TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Shape analysis by predicate abstraction

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Predicate abstraction and canonical abstraction for singly-linked lists

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
Simulating reachability using first-order logic with applications to verification of linked data structures

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
A decidable fragment of separation logic

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Verification of multi-linked heaps

Journal of Computer and System Sciences
Automatic verification of parameterized data structures

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Automated verification of recursive programs with pointers

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Accurate invariant checking for programs manipulating lists and arrays with infinite data

ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper aims to provide a better formalism for describing properties of linked data structures (e.g., lists, trees, graphs), as well as the intermediate states that arise when such structures are destructively updated. The paper defines a new logic that is suitable for these purposes (called Lr, for "logic of reachability expressions"). We show that Lr is decidable, and explain how Lr relates to two previously defined structuredescription formalisms ("path matrices" and "static shape graphs") by showing how an arbitrary shape descriptor from each of these formalisms can be translated into an Lr formula.