Automated abstraction refinement for model checking large state spaces using SAT based conflict analysis

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

Volumn 2517, Issue , 2002, Pages 33-51

  Chauhan, Pankaj ^a   Clarke, Edmund ^a   Kukula, James ^c   Sapra, Samir ^a   Veith, Helmut ^b   Wang, Dong ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^c SYNOPSYS INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER AIDED DESIGN; FORMAL METHODS;

ABSTRACT MODELING; ABSTRACTION REFINEMENT; AUTOMATIC ABSTRACTIONS; CONFLICT ANALYSIS; IMAGE COMPUTATION; MODEL-CHECKING SYSTEM; REAL-WORLD DESIGNS; TRANSITION RELATIONS;

MODEL CHECKING;

EID: 84948155079     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36126-x_3     Document Type: Conference Paper

References (21)

1. Felice Balarin and Alberto L. Sangiovanni-Vincentelli. An iterative approach to language containment. In Proceedings of CAV’93, pages 29–40, 1993.
2. Armin Biere, Alexandro Cimatti, Edmund M. Clarke, and Yunshan Zhu. Symbolic model checking without BDDs. In Proceedings of Tools and Algorithms for the Analysis and Construction of Systems (TACAS’99), number 1579 in LNCS, 1999.
3. Pankaj Chauhan, Edmund M. Clarke, Somesh Jha, Jim Kukula, Tom Shiple, Helmut Veith, and Dong Wang. Non-linear quantification scheduling in image computation. In Proceedings of ICCAD’01, pages 293–298, November 2001.
4. Pankaj Chauhan, Edmund M. Clarke, Somesh Jha, Jim Kukula, Helmut Veith, and Dong Wang. Using combinatorial optimization methods for quantification scheduling. In Tiziana Margaria and Tom Melham, editors, Proceedings of CHARME’01, volume 2144 of LNCS, pages 293–309, September 2001.
5. A. Cimatti, E. M. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: A new Symbolic Model Verifier. In N. Halbwachs and D. Peled, editors, Proceedings of the International Conference on Computer-Aided Verification (CAV’99), number 1633 in Lecture Notes in Computer Science, pages 495–499. Springer, July 1999.
6. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In E. A. Emerson and A. P. Sistla, editors, Proceedings of CAV, volume 1855 of LNCS, pages 154–169, July 2000.
7. E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000.
8. Edmund Clarke, Anubhav Gupta, James Kukula, and Ofer Strichman. SAT based abstraction-refinement using ILP and machine learning techniques. In Proceedings of CAV’02, 2002. To appear.
9. Edmund Clarke, Somesh Jha, Yuan Lu, and Helmut Veith. Tree-like counterexamples in model checking. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS’02), 2002. To appear.
10. Satyaki Das and David Dill. Successive approximation of abstract transition relations. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science (LICS’01), 2001.
11. Shankar G. Govindaraju and David L. Dill. Counterexample-guided choice of projections in approximate symbolic model checking. In Proceedings of ICCAD’00, San Jose, CA, November 2000.
12. P.-H. Ho, T. Shiple, K. Harer, J. Kukula, R. Damiano, V. Bertacco, J. Taylor, and J. Long. Smart simulation using collaborative formal and simulation engines. In Proceedings of ICCAD’00, November 2000.
13. R. Kurshan. Computer-Aided Verification of Co-ordinating Processes: The Automata-Theoretic Approach. Princeton University Press, 1994.
14. J. Lind-Nielsen and H. Andersen. Stepwise CTL model checking of state/event systems. In N. Halbwachs and D. Peled, editors, Proceedings of the International Conference on Computer Aided Verification (CAV’99), 1999.
15. David E. Long. Model checking, abstraction and compositional verification. PhD thesis, Carnegie Mellon University, 1993. CMU-CS-93-178.
16. Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the Design Automation Conference (DAC’01), pages 530–535, 2001.
17. Abelardo Pardo and Gary D. Hachtel. Incremental CTL model checking using BDD subsetting. In Proceedings of the Design Automation Conference (DAC’98), pages 457–462, June 1998.
18. J. P. Marques Silva and K. A. Sakallah. GRASP: A new search algorithm for satisfiability. Technical Report CSE-TR-292-96, Computer Science and Engineering Division, Department of EECS, Univ. Of Michigan, April 1996.
19. Dong Wang, Pei-Hsin Ho, Jiang Long, James Kukula, Yunshan Zhu, Tony Ma, and Robert Damiano. Formal property verification by abstraction refinement with formal, simulation and hybrid engines. In Proceedings of the DAC, pages 35–40, 2001.
20. Hantao Zhang. SATO: An efficient propositional prover. In Proceedings of the Conference on Automated Deduction (CADE’97), pages 272–275, 1997.
21. Lintao Zhang, Conor F. Madigan, Matthew W. Moskewicz, and Sharad Malik. Efficient conflict driven learning in a Boolean satisfiability solver. In Proceedings of ICCAD’01, November 2001.