The Computer Journal Advance Access originally published online on October 11, 2007
The Computer Journal 2009 52(3):280-287; doi:10.1093/comjnl/bxm085
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
Heuristic-Guided Abstraction Refinement
1 Department of Computer Science and Technology, Tsinghua University, Beijing, China
2 School of Software, Tsinghua University, Beijing, China
3 Department of ECE, Portland State University, Oregon, USA
* Corresponding author: hef02{at}mails.tsinghua.edu.cn
Received 2 August 2006; revised 1 September 2007
Model checking has been considered as a promising approach to establish the correctness of systems. Counterexample-guided abstraction refinement is a key strategy for model checking in verification of large-scale systems. State separation problem poses the main hurdle during the refinement. We present two fast heuristics to solve this problem. We prove the effectiveness of our heuristics by both theoretical analysis and experimental results. Experimental results show the promising performance of our approach.
Key Words: verification model checking abstraction heuristics