Abstract Fixpoint Computations with Numerical Acceleration Methods - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Abstract Fixpoint Computations with Numerical Acceleration Methods

Abstract

Static analysis by abstract interpretation aims at automatically proving properties of computer programs. To do this, 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.
Fichier principal
Vignette du fichier
main.pdf (236.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00492483 , version 1 (16-06-2010)

Identifiers

Cite

Olivier Bouissou, Yassamine Seladji, Alexandre Chapoutot. Abstract Fixpoint Computations with Numerical Acceleration Methods. International Workshop on Numerical and Symbolic Abstract Domains, Sep 2010, Perpignan, France. pp.29-42, ⟨10.1016/j.entcs.2010.09.004⟩. ⟨hal-00492483⟩
105 View
128 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More