Iterative Abstraction using SAT-Based BMC with Proof Analysis

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

Volumn , Issue , 2003, Pages 416-423

  Gupta, Aarti ^a   Ganai, Malay ^a   Yang, Zijiang ^a   Ashar, Pranav ^a  

^a NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING;

BINARY DECISION DIAGRAMS (BDD); BOUNDED MODEL CHECKING (BMC);

COMPUTER AIDED DESIGN;

EID: 0347409197     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. E. M. Clarke, O. Grumberg, and D. Peled, Model Checking: MIT Press, 1999.
2. K. L. McMillan, Symbolic Model Checking: An Approach to the State Explosion Problem: Kluwer Academic Publishers, 1993.
3. R. E. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Transactions on Computers, vol. C-35(8), pp. 677-691, 1986.
4. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu, "Symbolic Model Checking without BDDs," in Proceedings of Workshop on Tools and Algorithms for Analysis and Construction of Systems (TACAS), vol. 1579, LNCS, 1999.
5. M. Sheeran, S. Singh, and G. Stalmarck, "Checking Safety Properties using Induction and a SAT Solver," in Proceedings of Conference on Formal Methods in Computer-Aided Design, 2000.
6. J. P. Marques-Silva and K. A. Sakallah, "GRASP: A Search Algorithm for Prepositional Satisfiability," IEEE Transactions on Computers, vol. 48, pp. 506-521, 1999.
7. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an Efficient SAT Solver," in Proceedings of Design Automation Conference, 2001.
8. E. Goldberg and Y. Novikov, "BerkMin: A Fast and Robust SAT-Solver," in Proceedings of Conference on Design Automation & Test Europe (DATE), 2002, pp. 142-149.
9. M. Ganai, L. Zhang, P. Ashar, and A. Gupta, "Combining Strengths of Circuit-based and CNF-based Algorithms for a High Performance SAT Solver," in Proceedings of the Design Automation Conference, 2002.
10. L. Zhang and S. Malik, "Validating SAT Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications," in Proceedings of Conference on Design Automation & Test Europe (DATE), 2003.
11. E. Goldberg and Y. Novikov, "Verification of Proofs of Unsatisfiability for CNF Formulas," in Proceedings of Conference on Design Automation & Test Europe (DATE), 2003.
12. P. Chauhan, E. M. 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 Proceedings of Conference on Formal Methods in CAD (FMCAD), 2002.
13. K. L. McMillan and N. Amla, "Automatic Abstraction Without Counterexamples," in Proceedings of Tools for Algorithms for Construction and Analysis of Systems (TACAS), 2003.
14. A. Kuehlmann, M. Ganai, and V. Paruthi, "Circuit-based Boolean Reasoning," in Proceedings of Design Automation Conference, 2001.
15. E. M. Clarke, O. Grumberg, and D. E. Long, "Model Checking and Abstraction," in Proceedings of Conference on Principles of Programming Languages, 1992.
16. A. Gupta, M. Ganai, C. Wang, Z. Yang, and P. Ashar, "Abstraction and BDDs Complement SAT-based BMC in DiVer," in Proceedings of International Conference on Computer Aided Verification, vol. 2725, LNCS, 2003.
17. R. P. Kurshan, Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach: Princeton University Press, 1994.
18. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith, "Counterexample-guided abstraction refinement," in Proceedings of Conference on Computer Aided Verification, vol. 1855,LNCS, 2000, pp. 154-169.
19. D. Wang, P.-H. Ho, J. Long, J. Kukula, Y. Zhu, H. Keung, T. Ma, and R. Damiano, "Formal Property Verification by Abstraction Refinement with formal, simulation, and hybrid engines," in Proceedings of Design Automation Conference, 2001.
20. E. M. Clarke, A. Gupta, J. Kukula, and O. Strichman, "SAT based abstraction-refinement using ILP and machine learning techniques," in Proceedings of Conference on Computer Aided Verification, 2002.
21. R. Majumdar, T. A. Henzinger, R. Jhala, and G. Sutre, "Lazy Abstraction," in Proceedings of Conference on Principles of Programming Languages, 2002.
22. K. L. McMillan, "Interpolation and SAT-based Model Checking," in Proceedings of Conference on Computer-Aided Verification, vol. 2725, LNCS, 2003.
23. M. Davis and H. Putnam, "A Computing Procedure for Quantification Theory," Journal of ACM, vol. 7, pp. 201-214, 1960.
24. L. Zhang, C. Madigan, M. Moskewicz, and S. Malik, "Efficient Conflict Driven Learning in a Boolean Satisfiability Solver," in Proceedings of the International Conference on Computer-Aided Design, 2001.
25. A. Gupta, Z. Yang, P. Ashar, L. Zhang, and S. Malik, "Partition-Based Decision Heuristics for Image Computation using SAT and BDDs," in Proceedings of International Conference on Computer-Aided Design, 2001.