Optimal abstraction on real-valued programs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Optimal abstraction on real-valued programs

Résumé

In this paper, we show that it is possible to abstract program fragments using real variables using formulas in the theory of real closed fields. This abstraction is compositional and modular. We first propose an exact abstraction for programs without loops. Given an abstract domain (in a wide class including intervals and octagons), we then show how to obtain an optimal abstraction of program fragments with respect to that domain. This abstraction allows computing optimal fixed points inside that abstract domain, without the need for a widening operator.
Fichier principal
Vignette du fichier
exact_real_abstraction.pdf (257.74 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00148608 , version 1 (22-05-2007)

Identifiants

Citer

David Monniaux. Optimal abstraction on real-valued programs. 14th International Static Analysis Symposium (SAS 2007), 2007, Kongens Lyngby, Denmark. pp.104-120, ⟨10.1007/978-3-540-74061-2_7⟩. ⟨hal-00148608⟩
104 Consultations
102 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More