A minimalistic look at widening operators - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Higher-Order and Symbolic Computation Année : 2009

A minimalistic look at widening operators

David Monniaux

Résumé

We consider the problem of formalizing the familiar notion of widening in abstract interpretation in higher-order logic. It turns out that many axioms of widening (e.g. widening sequences are ascending) are not useful for proving correctness. After keeping only useful axioms, we give an equivalent characterization of widening as a lazily constructed well-founded tree. In type systems supporting dependent products and sums, this tree can be made to reflect the condition of correct termination of the widening sequence.
Fichier principal
Vignette du fichier
minimalistic_widening.pdf (184.39 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00363204 , version 1 (20-02-2009)
hal-00363204 , version 2 (11-06-2009)
hal-00363204 , version 3 (23-11-2009)

Identifiants

Citer

David Monniaux. A minimalistic look at widening operators. Higher-Order and Symbolic Computation, 2009, 22 (2), pp.145-154. ⟨10.1007/s10990-009-9046-8⟩. ⟨hal-00363204v3⟩
404 Consultations
268 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More