loading...
Combination Model Checking: Approach and a Case Study
Linz, Austria September 20-September 24
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ASE.2004.1003919th IEEE International Conference on ...
 This Article 
 
PDF
HTML
IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Yunja Choi, Fraunhofer Institute for Experimental Software Engineering, Germany
Mats P. E. Heimdahl, University of Minnesota, USA
We present combination model checking approach using a SAT-based bounded model checker together with a BDD-based symbolic model checker to provide a more efficient counter example generation process. We provide this capability without compromising the verification capability of the symbolic model checker. The basic idea is to use the symbolic model checker to determine whether or not a property holds in the model. If the property holds, we are done. If it does not, we preempt the counterexample generation and use the SAT-based model checker for this purpose. An application of the combination approach to a version of a Flight Guidance System (FGS) from Rockwell Collins, Inc. shows huge performance gain when checking a collection of several hundred properties.
Citation:
Yunja Choi, Mats P. E. Heimdahl, "Combination Model Checking: Approach and a Case Study," ase, pp.354-357, 19th IEEE International Conference on Automated Software Engineering (ASE'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.