Increasing the robustness of bounded model checking by computing lower bounds on the reachable states

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

Volumn 3312, Issue , 2004, Pages 230-244

  Awedh, Mohammad ^a   Somenzi, Fabio ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; BOOLEAN FUNCTIONS; COMPUTER AIDED DESIGN; FORMAL METHODS;

BINARY DECISION DIAGRAMS (BDDS); BOUNDED MODEL CHECKING; REACHABILITY ANALYSIS; SAFETY PROPERTY; SATISFIABILITY SOLVERS; SYMBOLIC MODEL CHECKERS; TEMPORAL OPERATORS; TIME REQUIREMENTS;

MODEL CHECKING;

EID: 34547214110     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30494-4_17     Document Type: Article

References (20)

1. J. Baumgartner, A. Kuehlmann, and J. Abraham. Property checking via structural analysis. In E. Brinksma and K. G. Larsen, editors, Fourteenth Conference on Computer Aided Verification (CAV'02), pages 151-165. Springer-Verlag, Berlin, July 2002. LNCS 2404.
2. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Fifth International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'99), pages 193-207, Amsterdam, The Netherlands, Mar. 1999. LNCS 1579.
3. R. K. Brayton et al. VIS: A system for verification and synthesis. In T. Henzinger and R. Alur, editors, Eighth Conference on Computer Aided Verification (CAV'96), pages 428-432. Springer-Verlag, Rutgers University, 1996. LNCS 1102.
4. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, Aug. 1986.
5. G. Cabodi, P. Camurati, and S. Quer. Symbolic exploration of large circuits with enhanced forward/backward traversais. In Proceedings of the Conference on European Design Automation, pages 22-27, Grenoble, France, Sept. 1994.
6. G. Cabodi, S. Nocco, and S. Quer. Improving SAT-based bounded model checking by means of BDD-based approximate traversal. In Proceedings of the Conference on Design, Automation and Test in Europe, pages 898-905, Munich, Germany, Mar. 2003.
7. E. Clarke, A. Gupta, J. Kukula, and O. Strichman. SAT based abstraction-refinement using ILP and machine learning. In E. Brinksma and K. G. Larsen, editors, Fourteenth Conference on Computer Aided Verification (CAV 2002), pages 265-279. Springer-Verlag, July 2002. LNCS 2404.
8. L. de Moura, H. Rueß, and M. Sorea. Bounded model checking and induction: From refutation to verification. In W. A. Hunt, Jr. and F. Somenzi, editors, Fifteenth Conference on Computer Aided Verification (CAV'03), pages 1-13. Springer-Verlag, Boulder, CO, July 2003. LNCS 2725.
9. N. Eén and N. Sörensson. Temporal induction by incremental SAT solving. Electronic Notes in Theoretical Computer Science, 89(4), 2003. First International Workshop on Bounded Model Checking, http://www.elsevier.nl/ locate/entcs/.
10. D. Kröning and O. Strichman. Efficient computation of recurrence diameters. In Verification, Model Checking, and Abstract Interpretation, pages 298-309, New York, NY, Jan. 2003. Springer. LNCS 2575.
11. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Boston, MA, 1994.
12. K. L. McMillan. Interpolation and SAT-based model checking. In W. A. Hunt, Jr. and F. Somenzi, editors, Fifteenth Conference on Computer Aided Verification (CAV'03), pages 1-13. Springer-Verlag, Berlin, July 2003. LNCS 2725.
13. K. L. McMillan and N. Amla. Automatic abstraction without counterexamples. In International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'03), pages 2-17, Warsaw, Poland, Apr. 2003. LNCS 2619.
14. M. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the Design Automation Conference, pages 530-535, Las Vegas, NV, June 2001.
15. K. Ravi and F. Somenzi. High-density reachability analysis. In Proceedings of the International Conference on Computer-Aided Design, pages 154-158, San Jose, CA, Nov. 1995.
16. M. Sheeran, S. Singh, and G. Stalmarck. Checking safety properties using induction and a SAT-solver. In W. A. Hunt, Jr. and S. D. Johnson, editors, Formal Methods in Computer Aided Design, pages 108-125. Springer-Verlag, Nov. 2000. LNCS 1954.
17. A. P. Sistla. Safety, liveness and fairness in temporal logic. Formal Aspects in Computing, 6:495-511, 1994.
18. URL: http://vlsi.colorado.edu/~vis.
19. Vis verification benchmarks. http://vlsi.colorado.edu/~vis.
20. J. Whittemore, J. Kim, and K. Sakallah. SATIRE: A new incremental satisfiability engine. In Proceedings of the Design Automation Conference, pages 542-545, Las Vegas, NV, June 2001.