Counterexample-guided Abstraction Refinement-英文文献.pdfVIP

Counterexample-guided Abstraction Refinement Edmund Clarke , Orna Grumberg , Somesh Jha , Yuan Lu , and Helmut Veith



   Carnegie Mellon University, Pittsburgh, USA  Technion, Haifa, Israel  Vienna University of Technology, Austria Abstract. We present an automatic iterative abstraction-refinement methodol- ogy in which 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 which analyze such counterexamples and refine the abstract model correspond- ingly. The refinement algorithm keeps the size of the abstract state space small due to the use of abstraction functions which distinguish many degrees of abstrac- tion for each program variable. We describe an implementation of our method- ology 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. 1 Introduction The state explosion problem remains a major hurdle in applying model checking to large industrial designs. Abstraction is certainly the most important technique for han- dling this problem. In fact, it is essential for verifying designs of industrial complex- ity. Currently, abstraction is typically a manual process, often requiring considerable creativity. In order for model checking to be used more widely in industry, automatic techniques are needed for generating abstractions. In this paper, we describe an auto- matic abstraction technique for ACTL specifications which is based on an analysis of     th