SAT-based model checking without unrolling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6538 LNCS, Issue , 2011, Pages 70-87

  Bradley, Aaron R ^a  

^a University of Colorado at Boulder   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR-STATE; EXPERIMENTAL STUDIES; NEW FORMS; PARALLEL IMPLEMENTATIONS; PROOF SEARCH; REACHABILITY; SAT-BASED MODEL CHECKING; SYMBOLIC MODEL CHECKING; TRANSITION RELATIONS; TRANSITION SYSTEM;

ABSTRACTING; ALGORITHMS; REFINING;

MODEL CHECKING;

EID: 79251570863     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18275-4_7     Document Type: Conference Paper

References (25)

1. Awedh, M., Somenzi, F.: Automatic invariant strengthening to prove properties in bounded model checking. In: DAC, pp. 1073-1076. ACM Press, New York (2006)
2. Biere, A., Cimatti, A., Clarke, E.M., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 193-207. Springer, Heidelberg (1999)
3. Biere, A., Claessen, K.: Hardware model checking competition. In: Hardware Verification Workshop (2010)
4. Bradley, A.R.: Safety Analysis of Systems. PhD thesis, Stanford University (May 2007)
5. Bradley, A.R.: k-step relative inductive generalization. Tech. Rep., CU Boulder (March 2010), http://arxiv.org/abs/1003.3649
6. Bradley, A.R., Manna, Z.: Checking safety by inductive generalization of counter-examples to induction. In: FMCAD (2007)
7. Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 10-20 states and beyond. Inf. Comput. 98(2), 142-170 (1992)
8. Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5) (2003)
9. Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (2000)
10. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238-252. ACM Press, New York (1977)
11. Eén, N.: Cut sweeping. Tech. rep., Cadence (2007)
12. Eén, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61-75. Springer, Heidelberg (2005) (Pubitemid 41425497)
13. Eén, N., Mishchenko, A., Sörensson, N.: Applying logic synthesis for speeding up SAT. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 272-286. Springer, Heidelberg (2007)
14. Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
15. Eén, N., Sörensson, N.: Temporal induction by incremental SAT solving. In: BMC (2003)
16. Floyd, R.W.: Assigning meanings to programs. In: Symposia in Applied Mathematics, vol. 19, pp. 19-32. American Mathematical Society, Providence (1967)
17. Graf, S., Saidi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 72-83. Springer, Heidelberg (1997)
18. Hoare, C.A.R.: An axiomatic basis for computer programming. Communications of the ACM 12(10), 576-580 (1969)
19. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, New York (1995)
20. McMillan, K.L.: Applying SAT methods in unbounded symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 250-264. Springer, Heidelberg (2002)
21. McMillan, K.L.: Interpolation and SAT-based model checking. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 1-13. Springer, Heidelberg (2003)
22. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: DAC (2001)
23. de Moura, L., Rueß, H., Sorea, M.: Bounded model checking and induction: From refutation to verification. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 14-26. Springer, Heidelberg (2003) (Pubitemid 36881605)
24. Sheeran, M., Singh, S., Stålmarck, G.: Checking safety properties using induction and a SAT-solver. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol. 1954, pp. 108-125. Springer, Heidelberg (2000)
25. Vimjam, V.C., Hsiao, M.S.: Fast illegal state identification for improving SAT-based induction. In: DAC, pp. 241-246. ACM Press, New York (2006)