TreeKs: A Functor to Make Numerical Abstract Domains Scalable

Authors:
Mehdi Bouaziz
Affiliations:
DI - ícole Normale Supérieure, 45 rue dUlm, 75230 Paris Cedex 05 - France
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2012

Citing 13
Cited 0

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
A New Numerical Abstract Domain Based on Difference-Bound Matrices

PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
A static analyzer for large safety-critical software

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
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
The octagon abstract domain

Higher-Order and Symbolic Computation
The octahedron abstract domain

Science of Computer Programming
Pentagons: a weakly relational abstract domain for the efficient validation of array accesses

Proceedings of the 2008 ACM symposium on Applied computing
Logahedra: A New Weakly Relational Domain

ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Why does Astrée scale up?

Formal Methods in System Design
Two variables per linear inequality as an abstract domain

LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Relational Abstract Domain of Weighted Hexagons

Electronic Notes in Theoretical Computer Science (ENTCS)
Scalable analysis of linear systems using mathematical programming

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Relational numerical abstract domains do not scale up. To ensure a linear cost of abstract domains, abstract interpretation-based tools analyzing large programs generally split the set of variables into independent smaller sets, sometimes sharing some non-relational information. We present a way to gain precision by keeping fully expressive relations between the subsets of variables, whilst retaining a linear complexity ensuring scalability.