Skip to Main content Skip to Navigation
Conference papers

Abstract Fixpoint Computations with Numerical Acceleration Methods

Olivier Bouissou 1, * Yassamine Seladji 1 Alexandre Chapoutot 2
* Corresponding author
1 LMeASI - Laboratoire Modélisation et Analyse de Systèmes en Interaction
LIST - Laboratoire d'Intégration des Systèmes et des Technologies : DRT/LIST
2 PEQUAN - Performance et Qualité des Algorithmes Numériques
LIP6 - Laboratoire d'Informatique de Paris 6
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.
Document type :
Conference papers
Complete list of metadatas
Contributor : Alexandre Chapoutot <>
Submitted on : Wednesday, June 16, 2010 - 10:35:37 AM
Last modification on : Monday, February 10, 2020 - 6:12:32 PM
Long-term archiving on: : Friday, September 17, 2010 - 1:23:00 PM


Files produced by the author(s)




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⟩



Record views


Files downloads