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.
Type de document :
Communication dans un congrès
Antoine Miné. SAS 2012 The 19th International Static Analysis Symposium, Sep 2012, Deauville, France. Springer Verlag, 7460, pp.198-213, 2012, Lecture Notes in Computer Science. 〈10.1007/978-3-642-33125-1_15〉
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00734340
Contributeur : Nicolas Halbwachs <>
Soumis le : vendredi 21 septembre 2012 - 14:44:35
Dernière modification le : jeudi 11 janvier 2018 - 06:26:56
Document(s) archivé(s) le : samedi 22 décembre 2012 - 03:37:45

Fichier

sas-14.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

IMAG | UGA

Citation

Nicolas Halbwachs, Julien Henry. When the Decreasing Sequence Fails. Antoine Miné. SAS 2012 The 19th International Static Analysis Symposium, Sep 2012, Deauville, France. Springer Verlag, 7460, pp.198-213, 2012, Lecture Notes in Computer Science. 〈10.1007/978-3-642-33125-1_15〉. 〈hal-00734340〉

Partager

Métriques

Consultations de la notice

540

Téléchargements de fichiers

461