Deriving numerical abstract domains via principal component analysis

Authors:
Gianluca Amato;Maurizio Parton;Francesca Scozzari
Affiliations:
Università di Chieti-Pescara, Dipartimento di Scienze;Università di Chieti-Pescara, Dipartimento di Scienze;Università di Chieti-Pescara, Dipartimento di Scienze
Venue:
SAS'10 Proceedings of the 17th international conference on Static analysis
Year:
2010

Citing 17
Cited 5

Abstract interpretation and application to logic programs

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

PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
Synthesis of Linear Ranking Functions

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Cleanness Checking of String Manipulations in C Programs via Integer Analysis

SAS '01 Proceedings of the 8th International Symposium on Static Analysis
A static analyzer for large safety-critical software

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Precise interprocedural analysis using random interpretation

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The octagon abstract domain

Higher-Order and Symbolic Computation
A flow-sensitive analysis of privacy properties

CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
Relational inductive shape analysis

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems

Science of Computer Programming
A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Apron: A Library of Numerical Abstract Domains for Static Analysis

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Scalable analysis of linear systems using mathematical programming

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
The arithmetic-geometric progression abstract domain

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

SAS'07 Proceedings of the 14th international conference on Static Analysis
Program analysis using symbolic ranges

SAS'07 Proceedings of the 14th international conference on Static Analysis

A tool which mines partial execution traces to improve static analysis

RV'10 Proceedings of the First international conference on Runtime verification
Random: r-based analyzer for numerical domains

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Discovering invariants via simple component analysis

Journal of Symbolic Computation
The Abstract Domain of Parallelotopes

Electronic Notes in Theoretical Computer Science (ENTCS)
Numerical static analysis with Soot

Proceedings of the 2nd ACM SIGPLAN International Workshop on State Of the Art in Java Program analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new technique for developing ad-hoc numerical abstract domains by means of statistical analysis. We apply Principal Component Analysis to partial execution traces of programs, to find out a "best basis" in the vector space of program variables. This basis may be used to specialize numerical abstract domains, in order to enhance the precision of the analysis. As an example, we apply our technique to interval analysis of simple imperative programs.