Skip to Main content Skip to Navigation
Conference papers

When the Decreasing Sequence Fails

Abstract : 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.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Nicolas Halbwachs <>
Submitted on : Friday, September 21, 2012 - 2:44:35 PM
Last modification on : Thursday, November 19, 2020 - 3:58:03 PM
Long-term archiving on: : Saturday, December 22, 2012 - 3:37:45 AM


Files produced by the author(s)




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⟩



Record views


Files downloads