Counterexample-guided abstraction refinement for symbolic model checking

Journal of the ACM

Volumn 50, Issue 5, 2003, Pages 752-794

  Clarke, Edmund ^a,f   Grumberg, Orna ^b   Jha, Somesh ^c,g   Lu, Yuan ^d   Veith, Helmut ^e  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c UNIVERSITY OF WISCONSIN MADISON   (United States)

^d BROADCOM CORPORATION   (United States)

^e VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^f Carnegie Mellon University ^*  (United States)

^g University of Wisconsin   (United States)

Author keywords

Abstraction; Hardware verification; Symbolic model checking; Temporal logic

Indexed keywords

HARDWARE VERIFICATION; SYMBOLIC MODEL CHECKING; TEMPORAL LOGIC;

ALGORITHMS; BOOLEAN ALGEBRA; FORMAL LANGUAGES; FORMAL LOGIC; MICROPROCESSOR CHIPS;

SOFTWARE ENGINEERING;

EID: 4243189286     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/876638.876643     Document Type: Article

References (83)

1. ABDULLA, P. A., ANNICHINI, A., BENSALEM, S., BOUAJJANI, A., HABERMEHL, P., AND LAKHNECH, Y. 1999. Verification of infinite-state systems by combining abstraction and reachability analysis. In Computer-Aided Verification (CAV).
2. BALARIN, F., AND SANGIOVANNI-VINCENTELLI, A. L. 1993. An iterative approach to language containment. In Computer-Aided Verification (CAV).
3. BALL, T., MAJUMDAR, R., MILLSTEIN, T., AND RAJAMANI, S. K. 2001. Automatic predicate abstraction of C programs. In Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation (PLDI). ACM, New York.
4. BELLARE, M., GOLDREICH, O., AND SUDAN, M. 2003. Free bits, PCPs and non-approximability - towards tight results. SIAM J. Comput. 27, 804-915.
5. BENSALEM, S., BOUAJJANI, A., LOISEAUX, C., AND SIFAKIS, J. 1992. Property preserving simulations. In Computer-Aided Verification (CAV).
6. BENSALEM, S., LAKHNECH, Y., AND OWRE, S. 1998. Computing abstractions of infinite state systems compositionally and automatically. In Computer-Aided Verification (CAV).
7. BEREZIN, S., BIERE, A., CLARKE, E., AND ZHU, Y. 1998. Combining symbolic model checking with uninterpreted functions for out-of-order processor verification. In Formal Methods in Computer-Aided Design.
8. BIERE, A., CIMATTI, A., CLARKE, E., FUJITA, M., AND ZHU, Y. 1999. Symbolic model checking using SAT procedures instead of BDDs. In Design Automation Conference.
9. BJORNER, N. S., BROWNE, A., AND MANNA, Z. 1997. Automatic generation of invariants and intermediate assertions. Theoret. Comput. Sci. 173, 1, 49-87.
10. BRUNS, G., AND GODEFROID, P. 1999. Model checking partial state spaces with 3-valued temporal logics. In Computer Aided Verification (CAV).
11. BRYANT, R. E. 1986. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 55, 8, 677-691.
12. BRYANT, R. E. 1991. On the complexity of VLSI implementations and graph representations of boolean functions with application to integer multiplication. IEEE Trans. Comput. 40, 205-213.
13. BURCH, J., AND DILL, D. 1994. Automatic verification of pipelined microprocessor control. In Computer-Aided Verification (CAV).
14. BURCH, J. R., CLARKE, E. M., AND LONG, D. E. 1991. Symbolic model checking with partitioned transition relations. In Proceedings of the 1991 International Conference on Very Large Scale Integration, A. Halaas and P. B. Denyer, Eds. Winner of the Sidney Michaelson Best Paper Award.
15. 20 states and beyond. Inf. Comput. 98, 142-170.
16. CIMATTI, A., CLARKE, E., GIUNCHIGLIA, F., AND ROVERI, M. 1998. NuSMV: A new symbolic model checker. In Software Tools for Technology Transfer.
17. CLARKE, E., ENDERS, R., FILKORN, T., AND JHA, S. 1996. Exploiting symmetry in temporal logic model checking. Form. Meth. Syst. Des. 9, 1/2, 41-76.
18. CLARKE, E., JHA, S., LU, Y., AND WANG, D. 1999. Abstract BDDs: A technique for using abstraction in model checking. In Correct Hardware Design and Verification Methods (CHARME).
19. CLARKE, E., LU, Y., JHA, S., AND VEITH, H. 2001. Counterexamples in model checking. Tech. Rep., Carngie Mellon University. CMU-CS-01-106.
20. CLARKE, E. M., AND EMERSON, E. A. 1981. Synthesis of synchronization skeletons for branching time temporal logic. In Logic of Programs: Workshop.
21. CLARKE, E. M., EMERSON, E. A., AND SISTLA, A. P. 1983. Automatic verification of finite-state concurrent system using temporal logic. In Proceedings of the 10th Annual ACM Symposium on Principles of Programming Languages (POPL). ACM, New York.
22. CLARKE, E. M., GRUMBERG, O., AND LONG, D. E. 1994. Model checking and abstraction. ACM Trans. Prog. Lang. Syst. (TOPLAS) 16, 5 (Sept.), 1512-1542.
23. CLARKE, JR., E. M., EMERSON, E. A., AND SISTLA, A. P. 1986. Automatic verification of finite-state cgoncurrent systems using temporal logic specifications. ACM Trans. Prog. Lang. Syst. (TOPLAS) 8, 2 (Apr.), 244-263.
24. COLON, M. A., AND URIBE, T. E. 1998. Generating finite-state abstraction of reactive systems using decision procedures. In Computer-Aided Verification (CAV).
25. COUDERT, O., BERTHET, C., AND MADRE, J. C. 1989. Verification of synchronous sequential machines based on symbolic execution. In Proceedings of the 1989 International Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, France, J. Sifakis, Ed. Lecture Notes in Computer Science, vol. 407. Springer-Verlag, New York.
26. COUSOT, P., AND COUSOT, R. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the ACM Symposium of Programming Language, 238-252.
27. COUSOT, P., AND COUSOT, R. 1999. Refining model checking by abstract interpretation. Automat. Softw. Eng. 6, 69-95.
28. DAMS, D., GERTH, R., AND GRUMBERG, O. 1997a. Abstract interpretation of reactive systems. ACM Trans. Prog. Lang. Syst. (TOPLAS) 19, 2.
29. DAMS, D. R., GRUMBERG, O., AND GERTH, R. 1993. Generation of reduced models for checking fragments of CTL. In Computer-Aided Verification (CAV).
30. DAMS, D. R., GRUMBERG, O., AND GERTH, R. 1997b. Abstract interpretation of reactive systems: Abstractions preserving ∀CTL*, ∃CTL*, CTL*. In Proceedings of the IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET 94).
31. DAS, S., AND DILL, D. L. 2001. Successive approximation of abstract transition relations. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, Los Alamitos, Calif.
32. DAS, S., DILL, D. L., AND PARK, S. 1999. Experience with predicate abstraction. In Computer-Aided Verification (CAV).
33. DINGEL, J., AND FILKORN, T. 1995. Model checking for infinite state systems using data abstraction, assumption-commitment style reasoning and theorem proving. In Computer-Aided Verification (CAV).
34. DWYER, M. B., HATCLIFF, J., JOEHANES, R., LAUBACH, S., PASAREANU, C. S., ROBBY, VISSER, W., AND ZHENG, H. 2001. Tool-supported program abstraction for finite-state verification. In Proceedings of the 23rd International Conference on Software Engineering (ICSE).
35. EMERSON, E., AND SISTLA, A. 1996. Symmetry and model checking. Formal Methods in System Design 9(1/2), 105-130.
36. EMERSON, E., AND TREflER, R. 1999, From asymmetry to full symmetry: New techniques for symmetry reduction in model checking. In Correct Hardware Design and Verification Methods (CHARME). Lecture Notes in Computer Science, vol. 1703. Springer-Verlag, New York, 142-156.
37. FEIGE, U., AND KILIAN, J. 1996. Zero knowledge and the chromatic number. In Proceedings of the IEEE Conference on Computational Complexity (CCC). IEEE Computer Society Press, Los Alamitos, Calif., 278-287.
38. FEIGENBAUM, J., KANNAN, S., VARDI, M. Y., AND VISWANATHAN, M. 1999. Complexity of problems on graphs represented as OBDDs. Chic. J. Theoret. Comput. Sci.
39. FUJITSU. 1996. Fujitsu aims media processor at DVD. Microprocessor Rep. 11-13.
40. FURA, D., WINDLEY, P., AND SOMANI, A. 1993. Abstraction techniques for modeling real-world interface chips. In International Workshop on Higher Order Logic Theorem Proving and its Applications, J.J. Joyce and C.-J.H. Seger, Eds. Lecture Notes in Computer Science, vol. 780. University of British Columbia, Springer Verlag, published 1994, Vancouver, Canada, 267-281.
41. GAREY, M. R., AND JOHNSON, D. S. 1979. Computers and interactability: A guide to the theory of NP-Completeness. W. H. Freeman and Company.
42. GODEFROID, P., PELED, D., AND STASKAUSKAS, M. 1996. Using partial order methods in the formal verification of industrial concurrent programs. In Proceedings of the ISSTA '96 International Symposium on Software Testing and Analysis. 261-269.
43. GOTTLOB, G., LEONE, N., AND VEITH, H. 1999. Succinctness as a source of complexity in logical formalisms. Ann. Pure Appl. Logic 97, 1-3, 231-260.
44. GOVINDARAJU, S. G., AND DILL, D. L. 1998. Verification by approximate forward and backward reach-ability, In Proceedings of the International Conference of Computer-Aided Design (ICCAD).
45. GOVINDARAJU, S. G., AND DILL, D. L. 2000. Counterexample-guided choice of projections in approximate symbolic model checking. In Proceedings of the International Conference on Computer-Aided Design (ICCAD). 115-119.
46. GRAF, S. 1994. Verification of distributed cache memory by using abstractions. In Proceedings of Computer-Aided Verification (CAV).
47. GRAF, S., AND SAÏDI, H. 1997. Construction of abstract state graphs with PVS. In Proceedings of Computer-Aided Verification (CAV).
48. HO, P.-H., ISLES, A. J., AND KAM, T. 1998. Formal verification of pipeline control using controlled token nets and abstract interpretation. In Proceedings of the International Conference of Computer-Aided Design (ICCAD).
49. HOJATI, R., AND BRAYTON, R. K. 1995. Automatic datapath abstraction in hardware systems. In Proceedings of Computer-Aided Verification (CAV).
50. IP, C., AND DILL, D. 1996. Better verification through symmetry. Form. Meth. Syst. Des. 9, 1/2, 41-76.
51. JENSEN, K. 1996. Condensed state spaces for symmetrical colored petri nets. Form. Meth. Syst. Des. 9, 1/2, 7-40.
52. JONES, R. B., SKAKKEBAK, J. U., AND DILL, D. L. 1998. Reducing manual abstraction in formal verification of out-of-order execution. In Form. Meth. Comput.-Aided Des. 2-17.
53. KARP, R. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. Miller and J. Thatcher, Eds. 85-103.
54. KURSHAN, R. P. 1994. Computer-Aided Verification of Coordinating Processes. Princeton University Press, Princeton, NJ.
55. LEE, W., PARDO, A., JANG, J., HACHTEL, G., AND SOMENZI, F. 1996. Tearing based abstraction for CTL model checking. In Proceedings of the International Conference of Computer-Aided Design (ICCAD). 76-81.
56. LESENS, D., AND SAÏDI, H. 1997. Automatic verification of parameterized networks of processes by abstraction. In Proceedings of the International Workshop on Verification of Infinite State Systems (INFINITY). Bologna.
57. LIND-NIELSEN, J., AND ANDERSEN, H. R. 1999. Stepwise CTL model checking of state/event systems. In Proceedings of Computer-Aided Verification (CAV).
58. LOISEAUX, C., GRAF, S., SIFAKIS, J., BOUAJJANI, A., AND BENSALEM, S. 1995. Property preserving abstractions for the verification of concurrent systems. Form. Meth. Syst. Des., 1-36.
59. LONG, D. E. 1993. Model checking, abstraction and compositional verification. Ph.D. dissertation. School of Computer Science, Carnegie Mellon University, Pittsburgh, Pa. CMU-CS-93-178.
60. MANNA, Z., COLN, M. C., FINKBEINER, B., SIPMA, H., AND URIBE, T. E. 1998. Abstraction and modular verification of infinite-state reactive systems. In Proceedings of the Requirements Targeting Software and Systems Engineering (RTSE).
61. MCMILLAN, K. 1996. A conjunctively decomposed boolean representation for symbolic model checking. In Proceedings of Computer-Aided Verification (CAV). 13-25.
62. MCMILLAN, K. L. 1993. Symbolic Model Checking. Kluwer Academic Publishers.
63. MCMILLAN, K. L. 1999a. Verification of infinite state systems by compositional model checking. In Proceedings of the Conference on Correct Hardware Design and Verification Methods (CHARME). 219-234.
64. MCMILLAN, K. L. 1999b. Verification of infinite state systems by compositional model checking. In Proceedings of the Conference on Correct Hardware Design and Verification Methods (CHARME).
65. PARDO, A. 1997. Automatic abstraction techniques for formal verification of digital systems. Ph.D. dissertation, Dept. of Computer Science, University of Colorado at Boulder, Boulder Colo.
66. PARDO, A., AND HACHTEL, G. 1998. Incremental CTL model checking using BDD subsetting. In Design Automation Conference (DAC).
67. PELED, D. 1993. All from one, one from all: on model checking using representatives. In Proceedings of the 5th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 697. Springer-Verlag, New York (Elounda Crete, Greece). 409-423.
68. PIXLEY, C. 1990. A computational theory and implementation of sequential hardware equivalence. In Proceedings of the CAV Workshop (also DIMACS Tech. Report 90-31), R. Kurshan and E. Clarke, Eds. Rutgers University, NJ.
69. PIXLEY, C., BEIHL, G., AND PACAS-SKEWES, E. 1991. Automatic derivation of FSM specification to implementation encoding. In Proceedings of the International Conference on Computer Design (Cambridge, Mass.). 245-249.
70. PIXLEY, C., JEONG, S.-W., AND HACHTEL, G. D. 1992. Exact calculation of synchronization sequences based on binary decision diagrams. In Proceedings of the 29th Design Automation Conference, 620-623.
71. RUSHBY, J. 1999. Integrated formal verification: using model checking with automated abstraction, invariant generation, and theorem proving. In Theoretical and practical aspects of SPIN model checking: 5th and 6th international SPIN workshops.
72. RUSU, V., AND SINGERMAN, E. 1999. On proving safety properties by integrating static analysis, theorem proving and abstraction. In Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS).
73. SAGIV, S., REPS, T. W., AND WILHELM, R. 1999. Parametric shape analysis via 3-valued logic. In Proceedings of the Symposium on Principles of Programming Languages (POPL).
74. SAÏDI, H., AND SHANKAR, N. 1999. Abstract and model checking while you prove. In Proceedings of Computer-Aided Verification (CAV).
75. SIFAKIS, J. 1983. Property preserving homomorphisms of transition systems. In Proceedings of the 4th Workshop on Logics of Programs.
76. SOMENZI, F. 2001. CUDD: CU decision diagram package, http://vlsi. colorado.edu/fabio/.
77. TAKAYAMA, K., SATOH, T., NAKATA, T., AND HIROSE, F. 1998. An approach to verify a large scale system-on-chip using symbolic model checking. In Proceedings of the International Conference of Computer Design.
78. VAN AELTEN, F., LIAO, S., ALLEN, J., AND DEVADAS, S. 1992. Automatic generation and verification of sufficient correctness properties for synchronous processors. In International Conference of Computer-Aided Design (ICCAD).
79. VEITH, H. 1997. Languages represented by Boolean formulas. Inf. Proc. Lett. 63, 251-256.
80. VEITH, H. 1998a. How to encode a logical structure as an OBDD. In Proceedings of the 13th Annual IEEE Conference on Computational Complexity (CCC). IEEE Computer Society, Press, Los Alamitos, Calif., 122-131.
81. VEITH, H. 1998b. Succinct representation, leaf languages and projection reductions. Inf. Comput. 142, 2, 207-236.
82. WOLPER, P., AND LOVINFOSSE, V. 1989. Verifying properties of large sets of processes with network invariants. In Proceedings of the 1989 International Workshop on Automatic Verification Methods for Finite State Systems. Lecture Notes in Computer Science, vol. 407. Springer-Verlag, New York.
83. YANG, B., BRYANT, R. E., O'HALLARON, D. R., BIERE, A., COUDERT, O., JANSSEN, G., AND R. K. RANJAN, F. S. 1998. A performance study of BDD-based model checking. In Formal Methods in Computer-Aided Design. Lecture Notes in Computer Science, vol. 1522. Springer-Verlag, New York.