Stratified Static Analysis Based on Variable Dependencies

Authors:
David Monniaux;Julien Le Guen
Affiliations:
CNRS / VERIMAG, Grenoble, France22VERIMAG is a joint laboratory of CNRS and Université Joseph Fourier.;VERIMAG & STMicroelectronics, Grenoble, France2
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2012

Citing 21
Cited 1

Verification of Real-Time Systems using Linear Relation Analysis

Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
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
Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation

PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Design and implementation of a special-purpose static program analyzer for safety-critical real-time embedded software

The essence of computation
Precise widening operators for convex polyhedra

Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Mathematical analysis of programs

Mathematical analysis of programs
Some ways to reduce the space dimension in polyhedra computations

Formal Methods in System Design
Slicing as a program transformation

ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Apron: A Library of Numerical Abstract Domains for Static Analysis

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
A minimalistic look at widening operators

Higher-Order and Symbolic Computation
Static analysis by policy iteration on relational domains

ESOP'07 Proceedings of the 16th European conference on Programming
Precise fixpoint computation through strategy iteration

ESOP'07 Proceedings of the 16th European conference on Programming
Using counterexamples for improving the precision of reachability computation with polyhedra

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Widening and narrowing operators for abstract interpretation

Computer Languages, Systems and Structures
Simple and precise widenings for H-polyhedra

APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Symbolic methods to enhance the precision of numerical abstract domains

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Understanding the origin of alarms in ASTRÉE

SAS'05 Proceedings of the 12th international conference on Static Analysis
Exploiting sparsity in polyhedral analysis

SAS'05 Proceedings of the 12th international conference on Static Analysis
Widening polyhedra with landmarks

APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Program Slicing

IEEE Transactions on Software Engineering

Bias-variance tradeoffs in program analysis

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

In static analysis by abstract interpretation, one often uses widening operators in order to enforce convergence within finite time to an inductive invariant. Certain widening operators, including the classical one over finite polyhedra, exhibit an unintuitive behavior: analyzing the program over a subset of its variables may lead a more precise result than analyzing the original program! In this article, we present simple workarounds for such behavior.