Counterexample-guided abstraction refinement for symbolic model checking Export

@article{clarke2003counterexample, abstract = {The state explosion problem remains a major hurdle in applying symbolic model checking to large hardware designs. State space abstraction, having been essential for verifying designs of industrial complexity, is typically a manual process, requiring considerable creativity and insight.In this article, we present an automatic iterative abstraction-refinement methodology that extends symbolic model checking. In our method, the initial abstract model is generated by an automatic analysis of the control structures in the program to be verified. Abstract models may admit erroneous (or "spurious") counterexamples. We devise new symbolic techniques that analyze such counterexamples and refine the abstract model correspondingly. We describe aSMV, a prototype implementation of our methodology in NuSMV. Practical experiments including a large Fujitsu IP core design with about 500 latches and 10000 lines of SMV code confirm the effectiveness of our approach.}, address = {New York, NY, USA}, author = {Clarke, Edmund and Grumberg, Orna and Jha, Somesh and Lu, Yuan and Veith, Helmut}, citeulike-article-id = {480431}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=876643}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/876638.876643}, day = {01}, doi = {10.1145/876638.876643}, issn = {00045411}, journal = {Journal of the ACM}, keywords = {abstraction-refinement, model-checking, verification}, month = {September}, number = {5}, pages = {752--794}, posted-at = {2009-11-06 17:36:08}, priority = {2}, publisher = {ACM}, title = {Counterexample-guided abstraction refinement for symbolic model checking}, url = {http://dx.doi.org/10.1145/876638.876643}, volume = {50}, year = {2003} }

TY - JOUR ID - clarke2003counterexample L3 - citeulike-article-id:480431 N2 - The state explosion problem remains a major hurdle in applying symbolic model checking to large hardware designs. State space abstraction, having been essential for verifying designs of industrial complexity, is typically a manual process, requiring considerable creativity and insight.In this article, we present an automatic iterative abstraction-refinement methodology that extends symbolic model checking. In our method, the initial abstract model is generated by an automatic analysis of the control structures in the program to be verified. Abstract models may admit erroneous (or "spurious") counterexamples. We devise new symbolic techniques that analyze such counterexamples and refine the abstract model correspondingly. We describe aSMV, a prototype implementation of our methodology in NuSMV. Practical experiments including a large Fujitsu IP core design with about 500 latches and 10000 lines of SMV code confirm the effectiveness of our approach. IS - 5 JF - Journal of the ACM SN - 00045411 AD - New York, NY, USA EP - 794 TI - Counterexample-guided abstraction refinement for symbolic model checking PB - ACM VL - 50 SP - 752 KW - abstraction-refinement KW - model-checking KW - verification AU - Clarke, Edmund AU - Grumberg, Orna AU - Jha, Somesh AU - Lu, Yuan AU - Veith, Helmut PY - 2003/09/01/ UR - http://dx.doi.org/10.1145/876638.876643 ER -