Abstract Fixpoint Computations with Numerical Acceleration Methods

Authors:
Olivier Bouissou;Yassamine Seladji;Alexandre Chapoutot
Affiliations:
CEA, LIST, Laboratory for the Modeling and Analysis of Interacting Systems, 91191 Gif-sur-Yvette, France;CEA, LIST, Laboratory for the Modeling and Analysis of Interacting Systems, 91191 Gif-sur-Yvette, France;Université Pierre et Marie Curie, LIP6 - Paris, France
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2010

Citing 14
Cited 1

Verification of Real-Time Systems using Linear Relation Analysis

Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
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
Asserting the Precision of Floating-Point Computations: A Simple Abstract Interpreter

ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
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
A static analyzer for large safety-critical software

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Design and implementation of a special-purpose static program analyzer for safety-critical real-time embedded software

The essence of computation
Generating all polynomial invariants in simple loops

Journal of Symbolic Computation
FAST: acceleration from theory to practice

International Journal on Software Tools for Technology Transfer (STTT)
Combining widening and acceleration in linear relation analysis

SAS'06 Proceedings of the 13th international conference on Static Analysis
Scalable analysis of linear systems using mathematical programming

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

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Widening polyhedra with landmarks

APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Accelerated data-flow analysis

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

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

Acceleration of the abstract fixpoint computation in numerical program analysis

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Static analysis by abstract interpretation aims at automatically proving properties of computer programs. Basically, an over-approximation of program semantics, defined as the least fixpoint of a system of semantic equations, must be computed. To enforce the convergence of this computation, widening operator is used but it may lead to coarse results. We propose a new method to accelerate the computation of this fixpoint by using standard techniques of numerical analysis. Our goal is to automatically and dynamically adapt the widening operator in order to maintain precision.