 |
|
|
|
| HAL : hal-00600087, version 1 |
| arXiv : 1106.2637 |
| DOI : 10.1007/978-3-642-23702-7_27 |
| Fiche détaillée |  Récupérer au format |
|
|
| Static analysis symposium (SAS), Venezia : Italie (2011) |
|
|
|
|
| Using Bounded Model Checking to Focus Fixpoint Iterations |
|
|
| David Monniaux 1Laure Gonnord 2 |
|
|
| (2011) |
|
|
|
| Two classical sources of imprecision in static analysis by abstract interpretation are widening and merge operations. Merge operations can be done away by distinguishing paths, as in trace partitioning, at the expense of enumerating an exponential number of paths. In this article, we describe how to avoid such systematic exploration by focusing on a single path at a time, designated by SMT-solving. Our method combines well with acceleration techniques, thus doing away with widenings as well in some cases. We illustrate it over the well-known domain of convex polyhedra. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | VERIMAG (VERIMAG - IMAG) |
|
|
|
CNRS : UMR5104 – Université Joseph Fourier - Grenoble I – Institut National Polytechnique de Grenoble (INPG) |
|
|
| 2 : | Laboratoire d'Informatique Fondamentale de Lille (LIFL) |
|
|
|
CNRS : UMR8022 – INRIA – IRCICA – Université Lille 1 - Sciences et Technologies |
|
|
|
|
|
|
|
|
|
| SYNCHRONE |
|
|
|
|
| Domaine | : | Informatique/Langage de programmation Informatique/Logique en informatique |
|
|
| abstract interpretation – SMT-solving – polyhedra |
|
|
|
| Liste des fichiers attachés à ce document : | ||||||||||
|
||||||||||
|
|
|
| hal-00600087, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00600087 | |
| oai:hal.archives-ouvertes.fr:hal-00600087 | |
| Contributeur : David Monniaux | |
| Soumis le : Lundi 13 Juin 2011, 19:38:15 | |
| Dernière modification le : Lundi 26 Septembre 2011, 10:11:29 | |
