Numerical static analysis with Soot

Authors:
Gianluca Amato;Simone Di Nardo Di Maio;Francesca Scozzari
Affiliations:
Università di Chieti-Pescara - Italy;Università di Chieti-Pescara - Italy;Università di Chieti-Pescara - Italy
Venue:
Proceedings of the 2nd ACM SIGPLAN International Workshop on State Of the Art in Java Program analysis
Year:
2013

Citing 18
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
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th 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 Comprehensive Approach to Array Bounds Check Elimination for Java

CC '02 Proceedings of the 11th International Conference on Compiler Construction
Soot - a Java bytecode optimization framework

CASCON '99 Proceedings of the 1999 conference of the Centre for Advanced Studies on Collaborative research
The octagon abstract domain

Higher-Order and Symbolic Computation
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
FAST: acceleration from theory to practice

International Journal on Software Tools for Technology Transfer (STTT)
Apron: A Library of Numerical Abstract Domains for Static Analysis

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
On the algebraic structure of declarative programming languages

Theoretical Computer Science
On the relative completeness of bytecode analysis versus source code analysis

CC'08/ETAPS'08 Proceedings of the Joint European Conferences on Theory and Practice of Software 17th international conference on Compiler construction
Deriving numerical abstract domains via principal component analysis

SAS'10 Proceedings of the 17th 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
Observational Completeness on Abstract Interpretation

Fundamenta Informaticae - Logic, Language, Information and Computation
The Abstract Domain of Parallelotopes

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Numerical static analysis computes an approximation of all the possible values that a numeric variable may assume, in any execution of the program. Many numerical static analyses have been proposed exploiting the theory of abstract interpretation, which is a general framework for designing provably correct program analysis. The two main problems in analyzing numerical properties are: choosing the right level of abstraction (the abstract domain) and developing an efficient iteration strategy which computes the analysis result guaranteeing termination and soundness. In this paper, we report on our prototype implementation of a Java bytecode static analyzer for numerical properties. It has been developed exploiting Soot bytecode abstractions, existing libraries for numerical abstract domains, and the iteration strategies commonly used in the abstract interpretation community. We show pros and cons of using Soot, and discuss the main differences between our analyzer and the Soot static analysis framework.