Counter-example generation in symbolic abstract model-checking

Abstract : 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.
Document type :
Journal articles
Software Tools for Technology Transfer (STTT), Springer, 2004, 5 (2-3), pp.158-164. <10.1007/s10009-003-0127-4>
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-00199168
Contributor : Nicolas Halbwachs <>
Submitted on : Tuesday, December 18, 2007 - 3:34:46 PM
Last modification on : Tuesday, December 18, 2007 - 4:53:04 PM
Document(s) archivé(s) le : Monday, April 12, 2010 - 8:22:04 AM

File

main.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Gordon Pace, Nicolas Halbwachs, Pascal Raymond. Counter-example generation in symbolic abstract model-checking. Software Tools for Technology Transfer (STTT), Springer, 2004, 5 (2-3), pp.158-164. <10.1007/s10009-003-0127-4>. <hal-00199168>

Share

Metrics

Record views

228

Document downloads

81