Constructing specialized shape analyses for uniform change

Authors:
Tal Lev-Ami;Mooly Sagiv;Neil Immerman;Thomas Reps
Affiliations:
School of Computer Science, Tel Aviv University;School of Computer Science, Tel Aviv University;Department of Computer Science, UMass, Amherst;Computer Science Department, University of Wisconsin, Madison
Venue:
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Year:
2007

Citing 20
Cited 0

Parallelizing programs with recursive data structures

Parallelizing programs with recursive data structures
Incremental and decremental evaluation of transitive closure by first-order queries

Information and Computation
Purely functional data structures

Purely functional data structures
The pointer assertion logic engine

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Automatically validating temporal safety properties of interfaces

SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Parametric shape analysis via 3-valued logic

ACM Transactions on Programming Languages and Systems (TOPLAS)
Verifying reachability invariants of linked structures

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Efficient applicative data types

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Dynamic computational complexity

Dynamic computational complexity
Verifying properties of well-founded linked lists

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Refinement-based program verification via three-valued-logic analysis

Refinement-based program verification via three-valued-logic analysis
Finite differencing of logical formulas for static analysis

ESOP'03 Proceedings of the 12th European conference on Programming
Software verification with BLAST

SPIN'03 Proceedings of the 10th international conference on Model checking software
Predicate abstraction and canonical abstraction for singly-linked lists

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Abstraction for shape analysis with fast and precise transformers

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Abstraction refinement via inductive learning

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is concerned with one of the basic problems in abstract interpretation, namely, for a given abstraction and a given set of concrete transformers (that express the concrete semantics of a program), how does one create the associated abstract transformers? We develop a new methodology for addressing this problem, based on a syntactically restricted language for expressing concrete transformers. We use this methodology to produce best abstract transformers for abstractions of many important data structures.