 |
|
|
|
| HAL : hal-00199168, version 1 |
| DOI : 10.1007/s10009-003-0127-4 |
| Fiche détaillée |  Récupérer au format |
|
|
| Software Tools for Technology Transfer (STTT) 5, 2-3 (2004) 158-164 |
|
|
|
|
| Counter-example generation in symbolic abstract model-checking |
|
|
| Gordon Pace 1, 2Nicolas Halbwachs 1 |
|
|
| (03/2004) |
|
|
|
| The boundaries of model-checking have been extended through the use of abstraction. These techniques are conservative, in the following sense: when the verification succeeds, the verified property is guaranteed to hold; but when it fails, it may result either from the non satisfaction of the property, or from a too rough abstraction. In case of failure, it is, in general, undecidable whether an abstract trace corresponding to a counter-example has any concrete counterparts. For debugging purposes, one usually desires to go further than giving a ldquoyes/nordquo answer (actually, a ldquoyes/donrsquot knowrdquo answer!), and look for such concrete counter-examples. We propose a solution in which we apply standard test-pattern generation technology to search for concrete instances of abstract traces. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | VERIMAG (VERIMAG - IMAG) |
|
|
|
CNRS : UMR5104 – Université Joseph Fourier - Grenoble I – Institut National Polytechnique de Grenoble (INPG) |
|
|
| 2 : | Semantics & Verification Research Group (SVRG) |
|
|
|
University of Malta |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Systèmes embarqués Informatique/Langage de programmation Informatique/Génie logiciel |
|
|
| Model-checking - Abstraction - Concrete counterexample - Test pattern generation |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00199168, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00199168 | |
| oai:hal.archives-ouvertes.fr:hal-00199168 | |
| Contributeur : Nicolas Halbwachs | |
| Soumis le : Mardi 18 Décembre 2007, 15:34:46 | |
| Dernière modification le : Mardi 18 Décembre 2007, 16:53:04 | |
