Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download
Contributor : Nicolas Halbwachs <>
Submitted on : Tuesday, December 18, 2007 - 3:34:46 PM
Last modification on : Thursday, November 19, 2020 - 3:58:03 PM
Long-term archiving on: : Monday, April 12, 2010 - 8:22:04 AM


Files produced by the author(s)




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⟩



Record views


Files downloads