Pruning Techniques for the SAT-Based Bounded Model Checking Problem
- 24 August 2001
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Robust search algorithms for test pattern generationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Checking Safety Properties Using Induction and a SAT-SolverPublished by Springer Nature ,2000
- Tuning SAT Checkers for Bounded Model CheckingPublished by Springer Nature ,2000
- GRASP: a search algorithm for propositional satisfiabilityIEEE Transactions on Computers, 1999
- Symbolic Model Checking without BDDsPublished by Defense Technical Information Center (DTIC) ,1999
- Verifying Safety Properties of a PowerPC− Microprocessor Using Symbolic Model Checking without BDDsPublished by Springer Nature ,1999
- Solving the incremental satisfiability problemThe Journal of Logic Programming, 1993
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960