Abstraction refinement for bounded model checking

Lecture Notes in Computer Science

Volumn 3576, Issue , 2005, Pages 112-124

  Gupta, Anubhav ^a   Strichman, Ofer ^b  

^a Carnegie Mellon University   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

REFINING;

ABSTRACTION-REFINEMENT; BOUNDED MODEL CHECKING (BMC);

MATHEMATICAL MODELS;

EID: 26444465970     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11513988_11     Document Type: Conference Paper

References (15)

1. [AM04] N. Amla and K. L. McMillan. A hybrid of counterexample-based and proof-based abstraction. In Formal Methods in Computer-Aided Design, 5th International Confrence, FMCAD 2004, pages 260-274, 2004.
2. [BCCZ99] A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In In Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), LNCS, 1999.
3. [BGA02] S. Barner, D. Geist, and A.Gringauze. Symbolic localization reduction with reconstruction layering and backtracking. In Proc. of Conference on Computer-Aided Verification (CAV), Copenhagen, Denmark, July 2002.
4. [CA93] J. M. Crawford and L. D. Anton. Experimental results on the crossover point in satisfiability problems. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 21-27. AAAI Press, 1993.
5. +02] P. Chauhan, E. Clarke, J. Kukula, S. Sapra, H. Veith, and D. Wang. Automated abstraction refinement for model checking large state spaces using SAT based conflict analysis. In Fourth International Conference on Formal Methods in Computer-Aided Design (FMCAD'02), LNCS, 2002.
6. th Intl. Conference on Computer Aided Verification (CAV'02), LNCS, pages 265-279. Springer-Verlag, 2002.
7. [DP60] M. Davis and H. Putnam. A computing procedure for quantification theory. J. ACM, 7:201-215, 1960.
8. [GGYA03] A. Gupta, M. K. Ganai, Z. Yang, and P. Ashar. Iterative abstraction using SAT-based bmc with proof analysis. In ICCAD, pages 416-423, 2003.
9. +03] M. Glusman, G. Kamhi, S. Mador-Haim, R. Fraer, and M. Y. Vardi. Multiple-counterexample guided iterative abstraction refinement: An industrial evaluation. In Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2003, LNCS, pages 176-191, 2003.
10. [Kur94] R. Kurshan. Computer aided verification of coordinating processes. Princeton University Press, 1994.
11. [MA03] K. McMillan and N. Amla. Automatic abstraction without counterexamples. In 9th Intl. Conf. on Tools And Algorithms For The Construction And Analysis Of Systems (TACAS'03), volume 2619 of LNCS, 2003.
12. [McM03] Ken McMillan. From bounded to unbounded model checking, 2003.
13. +01] M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proc. Design Automation Conference 2001 (DAC'01), 2001.
14. [Sil99] J. P. M. Silva. The impact of branching heuristics in propositional satisfiability algorithms. In 9th Portuguese Conference on Artificial Intelligence (EPIA), 1999.
15. [WJHS04] G. Wang, H. Jin, G. D. Hachtel, and F. Somenzi. Refining the SAT decision ordering for bounded model checking. In ACM/IEEE 41th Design Automation Conference (DAC'04), pages 535-538, 2004.