Advanced SAT-techniques for bounded model checking of blackbox designs

Proceedings - International Workshop on Microprocessor Test and Verification

Volumn , Issue , 2006, Pages 37-44

  Herbstritt, Marc ^a   Becker, Bernd ^a   Scholl, Christoph ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS;

BLACK BOXES; BOUNDED MODEL CHECKING; FIRST ORDER; NODE SELECTION; PROBLEM STRUCTURE; SAT SOLVERS;

MODEL CHECKING;

EID: 46449091757     PISSN: 15504093     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MTV.2006.3     Document Type: Conference Paper

References (22)

1. E. M. Clarke, A. Biere, R. Raimi, and Y. Zhu, "Bounded model checking using satisfiability solving," Formal Methods in System Design, vol. 19, no. 1, pp. 7-34, 2001.
2. A. Jain, V. Boppana, R. Mukherjee, J. Jain, M. Fujita, and M. Hsiao, "Testing, Verification, and Diagnosis in the Presence of Unknowns," in Proc. of VLSI Test Symposium, 2000, pp. 263-269.
3. C. Scholl and B. Becker, "Checking equivalence for partial implementations," in Proc. of Design Automation Conference (DAC), 2001, pp. 238-243.
4. T. Nopper and C. Scholl, "Approximate symbolic model checking for incomplete designs," in Proc. of 5th International Conference on Formal Methods in Computer-Aided Design (FMCAD), Nov 2004, pp. 290-305.
5. M. Herbstritt and B. Becker, "On SAT-based Bounded Invariant Checking of Blackbox Designs," in Proc. of Microprocessor Test and Verification Workshop (MTV). Austin (TX), USA: IEEE Computer Society, 2005, pp. 23-28.
6. M. Narizzano, L. Pulina, and A. Tacchella, "QBF Evaluation 2006," available on-line at www.qbflib.org/qbfeval [2006-08-02].
7. W. Günther, N. Drechsler, R. Drechsler, and B. Becker, "Verification of designs containing black boxes," in EUROMICRO, 2000, pp. 100-105.
8. C. Scholl and B. Becker, "Checking equivalence for circuits containing incompletely specified boxes." in Proc. of 20th International Conference on Computer Design (ICCD), Freiburg im Breisgau, Germany, 2002, pp. 56-63.
9. T. Nopper and C. Scholl, "Counterexample generation for incomplete designs," in ITG/GI/GMM-Workshop "Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen", 2007, to appear.
10. M. Abramovici, M. Breuer, and A. Friedman, Digital Systems Testing and Testable Design. Computer Science Press, 1990.
11. J. Marques-Silva and K. Sakallah, "GRASP: A search algorithm for propositional satisfiability," IEEE Trans. on Comp., vol. 48, no. 5, pp. 506-521, 1999.
12. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engeneering an efficient SAT solver," in Proc. of Design Automation Conference (DAC), 2001.
13. N. Eén and N. Sörensson, "An extensible sat-solver." in Proc. of 6th International Conference on Theory and Applications of Satisfiability Testing (SAT), ser. Lecture Notes in Computer Science, vol. 2919. Springer, 2004, pp. 502-518, selected Revised Papers.
14. E. Giunchiglia, M. Narizzano, and A. Tacchella, "Qube++: An efficient qbf solver." in Proc. of 5th International Conference on Formal Methods in Computer-Aided Design (FMCAD), ser. Lecture Notes in Computer Science, vol. 3312. Austin, Texas, USA: Springer, 2004, pp. 201-213.
15. H. Samulowitz and F. Bacchus, "Using sat in qbf." in Proc. of 11th International Conference on Principles and Practice of Constraint Programming (CP), ser. Lecture Notes in Computer Science, vol. 3709. Sitges, Spain: Springer, 2005, pp. 578-592.
16. A. Biere, "Resolve and expand." in Proc. of 7th International Conference on Theory and Applications of Satisfiability Testing (SAT), ser. Lecture Notes in Computer Science, vol. 3542. Vancouver, BC, Canada: Springer, 2005, pp. 59-70, selected Papers.
17. M. Benedetti, "skizzo: A suite to evaluate and certify qbfs." in Proc. of 20th International Conference on Automated Deduction (CADE), ser. Lecture Notes in Computer Science, vol. 3632. Tallinn, Estonia: Springer, 2005, pp. 369-376.
18. H. Samulowitz, J. Davies, and F. Bacchus, "Preprocessing qbf." in Proc. of 12th International Conference on Principles and Practice of Constraint Programming (CP), ser. Lecture Notes in Computer Science, vol. 4204. Springer, 2006, pp. 514-529.
19. E. Giunchiglia, M. Narizzano, and A. Tacchella, "Quantifier structure in search based procedures for qbfs." in Proc. of Conference on Design, Automation and Test in Europe (DATE). Munich, Germany: European Design and Automation Association, 2006, pp. 812-817.
20. A. Kuehlmann, V. Paruthi, F. Krohm, and M. M.K. Ganai, "Robust Boolean Reasoning for Equivalence Checking and Functional Property Verification," IEEE Trans. on CAD, 2002.
21. A. Kuehlmann, "Dynamic transition relation simplification for bounded property checking." in Proc. of International Conference on Computer-Aided Design (ICCAD). San Jose, CA, USA: IEEE Computer Society / ACM, 2004, pp. 50-57.
22. M. Herbstritt, "QBF blackbox_design family benchmarks," available on-line at http://www.qbflib.org/suite_detail.php?suiteId=22 [2006-08-02].