Refining Abstract Interpretation-based Approximations with Constraint Solvers

Abstract : Programs with floating-point computations are tricky to develop because floating-point arithmetic differs from real arithmetic and has many counterintuitive properties. A classical approach to verify such programs consists in estimating the precision of floating-point computations with respect to the same sequence of operations in an idealized semantics of real numbers. Tools like \FLUCTUAT{}---based on abstract interpretation---have been designed to address this problem. However, such tools compute an over-approximation of the domains of the variables, both in the semantics of the floating-point numbers and in the semantics of the real numbers. This over-approximation can be very coarse on some programs. In this paper, we show that constraint solvers over floating-point numbers and real numbers can significantly refine the approximations computed by \FLUCTUAT{}. We managed to reduce drastically the domains of variables of C programs that are difficult to handle for abstract interpretation techniques implemented in \FLUCTUAT{}.
Type de document :
[Research Report] Laboratoire I3S / UNS. 2011
Liste complète des métadonnées

Littérature citée [24 références]  Voir  Masquer  Télécharger
Contributeur : Michel Rueher <>
Soumis le : mardi 13 septembre 2011 - 21:19:39
Dernière modification le : mercredi 31 janvier 2018 - 10:24:05
Document(s) archivé(s) le : mardi 13 novembre 2012 - 10:41:24


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00623274, version 1



Olivier Ponsini, Claude Michel, Michel Rueher. Refining Abstract Interpretation-based Approximations with Constraint Solvers. [Research Report] Laboratoire I3S / UNS. 2011. 〈hal-00623274〉



Consultations de la notice


Téléchargements de fichiers