Bounded model checking

Frontiers in Artificial Intelligence and Applications

Volumn 185, Issue 1, 2009, Pages 457-481

  Biere, Armin ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC DESIGN AUTOMATION;

BOUNDED MODEL CHECKING; ELECTRONICS DESIGN AUTOMATION; HARDWARE VERIFICATION; PROPERTY; TEMPORAL PROPERTY;

MODEL CHECKING;

EID: 72949096128     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-929-5-457     Document Type: Article

References (89)

1. A. Ayari and D. A. Basin. QUBOS: Deciding quantified boolean logic using propositional satisfiability solvers. In M. Aagaard and J. W. O'Leary, editors, Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design (FMCAD'02), volume 2517 of Lecture Notes in Computer Science, pages 187-201. Springer, 2002.
2. G. Audemard, M. Bozzano, A. Cimatti, and R. Sebastiani. Verifying industrial hybrid systems with MathSAT. Electronic Notes in Theoretical Computer Science, 119(2):17-32, 2005. In Proceedings of the 2nd International Workshop on Bounded Model Checking (BMC'04).
3. P. A. Abdulla, P. Bjesse, and N. Éen. Symbolic Reachability Analysis Based on SAT-Solvers. In S. Graf and M. Schwartzbach, editors, Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'00), volume 1785 of Lecture Notes in Computer Science, pages 411-425. Springer, 2000.
4. N. Amla, X. Du, A. Kuehlmann, R. P. Kurshan, and K. L. McMillan. An analysis of SAT-based model checking techniques in an industrial environment. In D. Borrione and W. J. Paul, editors, Proceedings of 13th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME'05), volume 3725 of Lecture Notes in Computer Science, pages 254-268, 2005.
5. M. Awedh and F. Somenzi. Automatic invariant strengthening to prove properties in bounded model checking. In Proceedings of the 43rd Design Automation Conference (DAC'06), pages 1073-1076. ACM, 2006.
6. M. Awedh and F. Somenzi. Termination criteria for bounded model checking: Extensions and comparison. Electronic Notes in Theoretical Computer Science, 144(1):51-66, 2006. In Proceedings of the 3rd International Workshop on Bounded Model Checking (BMC'05).
7. A. Biere, C. Artho, and V. Schuppan. Liveness Checking as Safety Checking. Electronic Notes in Theoretical Computer Science, 66(2), 2002. In Proceedings of the 7th International Workshop on Formal Methods for Industrial Critical Systems (FMICS'02).
8. G. P. Bischoff, K. S. Brace, G. Cabodi, S. Nocco, and S. Quer. Exploiting target enlargement and dynamic abstraction within mixed BDD and SAT invariant checking. Electronic Notes in Theoretical Computer Science, 119(2):33-49, 2005. In Proceedings of the 2nd International Workshop on Bounded Model Checking (BMC'04).
9. P. Bjesse and K. Claessen. SAT-based Verification without State Space Traversal. In W. A. H. Jr. and S. D. Johnson, editors, Proceedings of the 3rd International Conference on Formal Methods in Computer Aided Design (FMCAD'00), volume 1954 of Lecture Notes in Computer Science, pages 372-389. Springer, 2000.
10. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. Symbolic Model Checking without BDDs. In R. Cleaveland, editor, Proceedings of the 5th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), volume 1579 of Lecture Notes in Computer Science, pages 193-207. Springer, 1999.
11. J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98:142-170, 1992.
12. A. Biere, E. Clarke, R. Raimi, and Y. Zhu. Verifying safety properties of a PowerPC microprocessor using symbolic model checking without BDDs. In N. Halbwachs and D. Peled, editors, Proceedings of the 11th International Conference on Computer Aided Verification (CAV'99), volume 1633 of Lecture Notes in Computer Science, pages 60-71. Springer, 1999.
13. A. Biere, K. Heljanko, T. A. Junttila, T. Latvala, and V. Schuppan. Linear encodings of bounded LTL model checking. Logical Methods in Computer Science (LMCS'06), 2(5:5), 2006.
14. J. Baumgartner, A. Kuehlmann, and J. A. Abraham. Property Checking via Structural Analysis. In E. Brinksma and K. G. Larsen, editors, Proceedings of the 14th International Conference on Computer Aided Verification (CAV'02), volume 2404 of Lecture Notes in Computer Science, pages 151-165. Springer, 2002.
15. A. R. Bradley and Z. Manna. Checking safety by inductive generalization of counterexamples to induction. In Proceedings of 7th International Conference on Formal Methods in Computer-Aided Design (FMCAD'07), pages 173-180. IEEE Computer Society, 2007.
16. A. Borälv. The industrial success of verification tools based on Stälmarck's method. In O. Grumberg, editor, Proceedings of the 9th International Conference on Computer Aided Verification (CAV'97), volume 1254 of Lecture Notes in Computer Science, pages 7-10. Springer, 1997.
17. R. E. Bryant. Graph Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C(35), 1986.
18. E. M. Clarke and E. A. Emerson. Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic. In Proceedings of the Workshop on Logic of Programs, volume 131 of Lecture Notes in Computer Science. Springer, 1982.
19. E. M. Clarke, O. Grumberg, and K. Hamaguchi. Another look at LTL model checking. Formal Methods in System Design., 10(1):47-71, 1997.
20. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement for symbolic model checking. Journal of the ACM, 50(5), 2003.
21. E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT press, 1999.
22. M. Cadoli, A. Giovanardi, and M. Schaerf. An Algorithm to Evaluate Quantified Boolean Formulae. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI'98), pages 262- 267, 1998.
23. E. M. Clarke, D. Kroening, J. Ouaknine, and O. Strichman. Completeness and complexity of bounded model checking. In B. Steffen and G. Levi, editors, Proceedings of the 5th International Conference on Verification, Model Checking, and Abstract Inter
24. E. M. Clarke, D. Kroening, J. Ouaknine, and O. Strichman. Computational challenges in bounded model checking. Software Tools for Technology Transfer (STTT), 7(2):174-183, 2005. (Pubitemid 41349075)
25. B. Cook, D. Kroening, and N. Sharygina. Verification of boolean programs with unbounded thread creation. Theoretical Computer Science, 388(1-3):227-242, 2007.
26. G. Cabodi, S. Nocco, and S. Quer. Boosting the role of inductive invariants in model checking. In R. Lauwereins and J. Madsen, editors, Proceedings of the Conference on Design, Automation and Test in Europe (DATE'07), pages 1319-1324. ACM, 2007.
27. W. Craig. Linear reasoning: A new form of the Herbrand-Gentzen theorem. Journal of Symbolic Logic, 22(3):250-268, 1957.
28. N. Dershowitz, Z. Hanna, and J. Katz. Bounded model checking with QBF. In F. Bacchus and T. Walsh, editors, Proceedings of the 8th International Conference on Theory and Applications of Satisfiability Testing (SAT'05), volume 3569 of Lecture Notes in Computer Science. Springer, 2005.
29. L. M. de Moura, H. Rues, and M. Sorea. Bounded model checking and induction: From refutation to verification. In W. A. H. Jr. and F. Somenzi, editors, Proceedings of the 15th International Conferences on Computer Aided Verification (CAV'03), volume 2725 of Lecture Notes in Computer Science, pages 14-26. Springer, 2003.
30. E. A. Emerson. Temporal and modal logic. In Handbook of Theoretical Computer Science, volume B, pages 995-1072. MIT Press, 1990.
31. N. Éen and N. Sörensson. Temporal Induction by Incremental SAT Solving. Electronic Notes in Theoretical Computer Science, 89(4), 2003. In Proceedings of the 1st International Workshop on Bounded Model Checking (BMC'03).
32. M. Fränzle and C. Herde. Efficient proof engines for bounded model checking of hybrid systems. Electronic Notes in Theoretical Computer Science, 133:119-137, 2005.
33. A. M. Frisch, D. Sheridan, and T. Walsh. A fixpoint encoding for bounded model checking. In Proceedings of the 4th International Conference on Formal Methods in Computer Aided Designt (FMCAD'02), volume 2517 of Lecture Notes in Computer Science, p/r
34. A. V. Gelder. Verifying propositional unsatisfiability: Pitfalls to avoid. In J. Marques-Silva and K. A. Sakallah, editors, Proceedings of the 10th International Conference on Theory and Applications of Satisfiability Testing (SAT'07), volume 4501 of Lecture Notes in Computer Science, pages 328-333. Springer, 2007.
35. M. K. Ganai, A. Gupta, and P. Ashar. Efficient SAT-based unbounded symbolic model checking using circuit cofactoring. In Proceedings International Conference on Computer-Aided Design (ICCAD' 04), pages 510-517. IEEE Computer Society / ACM, 2004.
36. K. Heljanko. Bounded reachability checking with process semantics. In K. G. Larsen and M. Nielsen, editors, Proceedings of the 12th International Conference on Concurrency Theory (CONCUR'01), volume 2154 of Lecture Notes in Computer Science, pages 218-232. Springer, 2001.
37. K. Heljanko, T. A. Junttila, M. Keinänen, M. Lange, and T. Latvala. Bounded model checking for weak alternating Büchi automata. In T. Ball and R. B. Jones, editors, Proceedings of the 18th International Conference on Computer Aided Verification (CAV'06), volume 4144 of Lecture Notes in Computer Science, pages 95-108. Springer, 2006.
38. K. Heljanko, T. A. Junttila, and T. Latvala. Incremental and complete bounded model checking for full PLTL. In K. Etessami and S. K. Rajamani, editors, Proceedings of the 17th International Conference on Computer Aided Verification (CAV'05), volume 3576 of Lecture Notes in Computer Science, pages 98-111. Springer, 2005.
39. K. Heljanko and I. Niemelä. Bounded LTL model checking with stable models. Theory and Practice of Logic Programming, 3(4-5):519-550, 2003.
40. G. Holzmann. The SPIN Model Checker. Addison Wesley, 2004.
41. T. Jussila and A. Biere. Compressing BMC encodings with QBF. Electronic Notes in Theoretical Computer Science, 174(3):45-56, 2007. In Proceedings of the 4th International Workshop on Bounded Model Checking (BMC'06).
42. T. Jussila, K. Heljanko, and I. Niemelä. BMC via on-the-fly determinization. Electronic Notes in Theoretical Computer Science, 89(4), 2003. In Proceedings of the 1st International Workshop on Bounded Model Checking (BMC'03).
43. A. Kuehlmann and F. Krohm. Equivalence checking using cuts and heaps. In Proceedings of the 34th Design Automation Conference (DAC'97), pages 263-268. ACM, 1997.
44. A. Kuehlmann, V. Paruthi, F. Krohm, and M. K. Ganai. Robust Boolean Reasoning for Equivalence Checking and Functional Property Verification. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 21(12):1377-1394, 2002.
45. J. Kraj́cek. Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic. Journal on Symbolic Logic, 62(2):457-486, 1997.
46. H. Kautz and B. Selman. Planning as satisfiability. In B. Neumann, editor, Proceedings of the 10th European Conference on Artificial Intelligence (ECAI'92), pages 359-363. John Wiley & Sons, 1992.
47. D. Kroening and O. Strichman. Efficient computation of recurrence diameters. In L. D. Zuck, P. C. Attie, A. Cortesi, and S. Mukhopadhyay, editors, Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'03), volume 2575 of Lecture Notes in Computer Science, pages 298-309. Springer, 2003.
48. A. Kuehlmann. Dynamic transition relation simplification for bounded property checking. In Proceedings of the International Conference on Computer-Aided Design (ICCAD'04), pages 50-57. IEEE Computer Society / ACM, 2004.
49. R. P. Kurshan. Verification technology transfer. In H. Veith and O. Grumberg, editors, 25 Years of Model Checking, volume 5000 of Lecture Notes in Computer Science, pages 46-64. Springer, 2008.
50. J. Kim, J. P. Whittemore, and K. A. Sakallah. On Solving Stack- Based Incremental Satisfiability Problems. In Proceedings of the International Conference on Computer Design (ICCD'00), pages 379-382, 2000.
51. T. Latvala, A. Biere, K. Heljanko, and T. A. Junttila. Simple bounded LTL model checking. In Proceedings of the 6th International Conference on Formal Methods in Computer Aided Design (FMCAD'04), volume 3312 of Lecture Notes in Computer Science, pages 186-200. Springer, 2004. (Pubitemid 39749976)
52. O. Lichtenstein and A. Pnueli. Checking that finite state programs satisfy their linear specification. In ACM Symposium on Principles of Programming Languages, pages 97-107, 1985.
53. K. L. McMillan and N. Amla. Automatic abstraction without counterexamples. In H. Garavel and J. Hatcliff, editors, Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'03), volume 2619 of Lecture Notes in Computer Science, pages 2-17. Springer, 2003.
54. M. Maidl. Using model checking for system verification. PhD thesis, Ludwig-Maximilians-Universiät at München, 2000.
55. A. Mishchenko, S. Chatterjee, and R. K. Brayton. DAG-aware AIG rewriting a fresh look at combinational logic synthesis. In E. Sentovich, editor, Proceedings of the 43rd Design Automation Conference (DAC'06), pages 532-535. ACM, 2006.
56. K. L. McMillan. Symbolic Model Checking: An approach to the State Explosion Problem. Kluwer, 1993.
57. K. L. McMillan. Applying SAT Methods in Unbounded Symbolic Model Checking. In E. Brinksma and K. G. Larsen, editors, Proceedings of the 14th International Conference on Computer-Aided Verification (CAV'02), volume 2404 of Lecture Notes in Computer Science, pages 250-264. Springer, 2002.
58. K. L. McMillan. Interpolation and SAT-based Model Checking. In J. W. A. Hunt and F. Somenzi, editors, Proceedings of the 15th Conference on Computer-Aided Verification (CAV'03), volume 2725 of Lecture Notes in Computer Science, pages 1-13. Springer, 2003.
59. K. L. McMillan. An interpolating theorem prover. Theoretical Computer Science, 345(1), 2005.
60. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Design Automation Conference (DAC'01), pages 530-535, 2001.
61. M. Mneimneh and K. Sakallah. SAT-based sequential depth computation. In Proceedings of the Asia South Pacific Design Automation Conference (ASPDAC'03), pages 87-92. ACM, 2003.
62. J. P. Marques-Silva and K. A. Sakallah. GRASP: A Search Algorithm for Propositional Satisfiability. IEEE Transactions on Computers, 48(5):506-521, 1999.
63. H. Mangassarian, A. G. Veneris, S. Safarpour, M. Benedetti, and D. Smith. A performance-driven QBF-based iterative logic array representation with applications to verification, debug and test. In G. G. E. Gielen, editor, Proceedings of the International Conference on Computer-Aided Design (ICCAD'07), pages 240-245. IEEE, 2007.
64. I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3-4):241-273, 1999.
65. M. Prasad, A. Biere, and A. Gupta. A survey on recent advances in SAT-based formal verification. Software Tools for Technology Transfer (STTT), 7(2), 2005.
66. D. Plaisted, A. Biere, and Y. Zhu. A Satisfiability Procedure for Quantified Boolean Formulae. Discrete Applied Mathematics, 130(2):291-328, 2003.
67. D. Peled. Combining partial order reductions with on-the-fly modelchecking. In Proceedings of the 6th International Conference on Computer Aided Verification (CAV'94), pages 377-390. Springer-Verlag, 1994.
68. A. Pnueli. The temporal logic of programs. In Proceedings of IEEE Symposium on Foundations of Computer Science, 1977.
69. F. Pigorsch, C. Scholl, and S. Disch. Advanced unbounded model checking based on AIGs, BDD sweeping, and quantifier scheduling. In Proceedings 6th International Conference on Formal Methods in Computer-Aided Design (FMCAD'06), pages 89-96. IEEE Computer Society, 2006.
70. P. Pudĺak. Lower bounds for resolution and cutting planes proofs and monotone computations. Journal of Symbolic Logic, 62(3), 1997.
71. J.-P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In International Symposium on Programming, volume 137 of Lecture Notes in Computer Science. Springer, 1982.
72. W. J. Savitch. Relational between nondeterministic and deterministic tape complexity. Journal of Computer and System Sciences, 4:177-192, 1970.
73. V. Schuppan and A. Biere. Efficient reduction of finite state model checking to reachability analysis. Software Tools for Technology Transfer (STTT), 5(1-2):185-204, 2004.
74. A. P. Sistla and E. M. Clarke. The complexity of propositional linear temporal logics. Journal of the ACM, 32(3):733-749, 1985.
75. P. Simons, I. Niemelä, and T. Soininen. Extending and implementing the stable model semantics. Journal on Artificial Intelleligence, 138(1-2):181-234, 2002.
76. M. Sheeran, S. Singh, and G. Stälmarck. Checking safety properties using induction and a SAT-solver. In W. A. H. Jr. and S. D. Johnson, editors, Proceedings of the 3rd International Conference on Formal Methods in Computer Aided Design (FMCAD'00), volume 1954 of Lecture Notes in Computer Science, pages 108-125. Springer, 2000.
77. O. Strichman. Pruning Techniques for the SAT-based Bounded Model Checking Problem. In T. Margaria and T. F. Melham, editors, Proceedings of the 11th Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME'01), volume 2144 of Lecture Notes in Computer Science, pages 58-70. Springer, 2001.
78. G. S. Tseitin. On the Complexity of Derivation in Propositional Calculus. In Studies in Constructive Mathematics and Mathematical Logic, Part II, volume 8 of Seminars in Mathematics, pages 234- 259. V.A. Steklov Mathematical Institute, 1968. English Translation: Consultants Bureau, New York, 1970, pages 115 - 125.
79. M. Y. Vardi. From Church and Prior to PSL. In H. Veith and O. Grumberg, editors, 25 Years of Model Checking, volume 5000 of Lecture Notes in Computer Science, pages 150-171. Springer, 2008.
80. C. A. J. van Eijk. Sequential equivalence checking without state space traversal. In Proceedings of the Conference on Design, Automation and Test in Europe (DATE'98), pages 618-623. IEEE Computer Society, 1998.
81. H. Veith and O. Grumberg, editors. 25 Years of Model Checking, volume 5000 of Lecture Notes in Computer Science. Springer, 2008.
82. M. Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, 1994.
83. P. F. Williams, A. Biere, E. M. Clarke, and A. Gupta. Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking. In E. A. Emerson and A. P. Sistla, editors, Proceedings of the 12th International Conference on Computer Aided Verification (CAV'00), volume 1855 of Lecture Notes in Computer Science, pages 124-138. Springer, 2000.
84. J. P. Whittemore, J. Kim, and K. A. Sakallah. SATIRE: A New Incremental Satisfiability Engine. In Proceedings of the 38th Design Automation Conference (DAC'01), pages 542-545, 2001.
85. P. Wolper, M. Vardi, and A. P. Sistla. Reasoning about infinite computation paths. In Proceedings of 24th Annual Symposium on Foundations of Computer Science (FOCS'83), pages 185-194. IEEE Computer Society, 1983.
86. G. Yorsh and M. Musuvathi. A combination method for generating interpolants. Technical Report MSR-TR-2004-2108, Microsoft Research, 2004.
87. G. Yorsh and M. Musuvathi. A combination method for generating interpolants. In R. Nieuwenhuis, editor, Proceedings of the 20th International Conference on Automated Deduction (CADE'05), volume 3632 of Lecture Notes in Computer Science, pages 353-368. Springer, 2005.
88. H. Zhang. SATO: An efficient propositional prover. In W. McCune, editor, Proceedings of the 14th International Conference on Automated Deduction (CADE'97), volume 1249 of Lecture Notes in Computer Science, pages 272-275. Springer, 1997.
89. L. Zhang and S. Malik. Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications. In Proceedings of the Conference on Design, Automation and Test in Europe (DATE'03), pages 10880-10885. IEEE Computer Society, 2003.