When the Decreasing Sequence Fails - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

When the Decreasing Sequence Fails

Nicolas Halbwachs
  • Function : Author
  • PersonId : 844681
Julien Henry
  • Function : Author
  • PersonId : 926519


The classical method for program analysis by abstract in- terpretation consists in computing a increasing sequence with widening, which converges towards a correct solution, then computing a decreasing sequence of correct solutions without widening. It is generally admit- ted that, when the decreasing sequence reaches a fixpoint, it cannot be improved further. As a consequence, all efforts for improving the pre- cision of an analysis have been devoted to improving the limit of the increasing sequence. In this paper, we propose a method to improve a fixpoint after its computation. The method consists in projecting the solution onto well-chosen components and to start again increasing and decreasing sequences from the result of the projection.
Fichier principal
Vignette du fichier
sas-14.pdf (199.83 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00734340 , version 1 (21-09-2012)



Nicolas Halbwachs, Julien Henry. When the Decreasing Sequence Fails. SAS 2012 The 19th International Static Analysis Symposium, Sep 2012, Deauville, France. pp.198-213, ⟨10.1007/978-3-642-33125-1_15⟩. ⟨hal-00734340⟩
420 View
758 Download



Gmail Facebook Twitter LinkedIn More