Tuning SAT checkers for bounded model checking

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

Volumn 1855, Issue , 2000, Pages 480-494

  Shtrichman, Ofer ^a,b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER AIDED ANALYSIS; OPTIMIZATION;

BOUNDED MODEL CHECKING; COMPLEMENTARY TECHNIQUES; MODEL CHECKER; PROPOSITIONAL FORMULAS; PROPOSITIONAL SATISFIABILITY PROBLEMS; SAT CHECKING; SYMBOLIC MODEL CHECKING; TEST CASE;

MODEL CHECKING;

EID: 84944402340     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722167_36     Document Type: Conference Paper

References (13)

1. I. Beer, S. Ben-David, C. Eisner, D. Geist, L. Gluhovsky, T. Heyman, A. Landver, P. Paanah, Y. Rodeh, G. Ronin, and Y. Wolfsthal. RuleBase: Model checking at IBM. In Orna Grumberg, editor, Proc. 9th Intl. Conference on Computer Aided Verification (CAV'97), volume 1254 of Lect. Notes in Comp. Sci., pages 480-483. Springer-Verlag, 1997.
2. I. Beer, S. Ben-David, C. Eisner, and A. Landver. RuleBase: An industry oriented formal verification tool. In Proc. Design Automation Conference 96 (DAC96), 1996.
3. I. Beer, S. Ben-David, and A. Landver. On-the-fly model checking of RCTL formulas. In A.J. Hu and M.Y. Vardi, editors, Proc. 10th Intl. Conference on Computer Aided Verification (CAV'98), volume 1427 of Lect. Notes in Comp. Sci., pages 184-194. Springer-Verlag, 1998.
4. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking with- out BDDs. In Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS99), Lect. Notes in Comp. Sci. Springer-Verlag, 1999.
5. A. Biere, E. Clarke, R. Raimi, and Y. Zhu. Verifying safety properties of a power pcTM microprocessor using symbolic model checking without bdds. In N. Halb- wachs and D. Peled, editors, Proc. 11st Intl. Conference on Computer Aided Verification (CAV'99), Lect. Notes in Comp. Sci. Springer-Verlag, 1999.
6. Wililiam Chan, Richard Anderson, Paul Beame, and David Notkin. Improving efficiency of symbolic model checking for state-based system requirements. In International Symposium on Software Testing and Analysis (ISSTA98), Lect. Notes in Comp. Sci. Springer-Verlag, 1998.
7. M. Davis and H. Putnam.: A computing procedure for quantification theory. J. ACM, 7:201-215, 1960.
8. H. Iwashita, T. Nakata, and F. Hirose. Ctl model checking based on forward state traversal. In IEEE/ACM International conference on Computer Aided Design, pages 82-87, November 1996.
9. Ofer Shtrichman. Tuning sat checkers for bounded model checking - experiments with static and dynamic orderings. Technical report, Weizmann Institute, 2000. can be downloaded from www.weizmann.ac.il/_ofers.
10. J.P.M Silva. The impact of branching heuristics in propositional satisfiability algorithms. In 9th Portuguese Conference on Artificial Intelligence (EPIA), 1999.
11. J.P.M Silva and K. A. Sakallah.: GRASP - a new search algorithm for satisfyability. Technical Report TR-CSE-292996, Univerisity of Michigen, 1996.
12. J.P.M Silva and K. A. Sakallah. GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers, 48:506-516, 1999.
13. H. Zhang. SATO: An efficient propositional prover. In International Conference on Automated Deduction (CADE-97), 1997.