Non-disjunctive numerical domain for array predicate abstraction

Authors:
Xavier Allamigeon
Affiliations:
EADS Innovation Works, SE/CS, Suresnes, France and CEA, LIST MeASI, Gif-sur-Yvette, France
Venue:
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Year:
2008

Citing 17
Cited 2

Abstract interpretation and application to logic programs

Journal of Logic Programming
Parametric shape analysis via 3-valued logic

Proceedings of the 26th 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
Predicate abstraction for software verification

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic discovery of linear restraints among variables of a program

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Automatic Verification by Abstract Interpretation

VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
The Octagon Abstract Domain

WCRE '01 Proceedings of the Eighth Working Conference on Reverse Engineering (WCRE'01)
Precise and efficient static array bound checking for large embedded C programs

Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
A framework for numeric analysis of array operations

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Path invariants

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Lifting abstract interpreters to quantified logical domains

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Shape analysis for composite data structures

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Array abstractions from proofs

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Static analysis of string manipulations in critical embedded c programs

SAS'06 Proceedings of the 13th international conference on Static Analysis
Trace partitioning in abstract interpretation based static analyzers

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
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

Inferring Min and Max Invariants Using Max-Plus Polyhedra

SAS '08 Proceedings of the 15th international symposium on Static Analysis
Fluid updates: beyond strong vs. weak updates

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a numerical abstract domain to infer invariants on (a possibly unbounded number of) consecutive array elements using array predicates. It is able to represent and compute affine equality relations over the predicate parameters and the program variables, without using disjunctions or heuristics. It is the cornerstone of a sound static analysis of one- and two-dimensional array manipulation algorithms. The implementation shows very good performance on representative benchmarks. Our approach is sufficiently robust to handle programs traversing arrays and matrices in various ways.