A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Towards Bounded Model Checking for the Universal Fragment of TCTL
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Partial-Order Reduction in Symbolic State Space Exploration
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Tuning SAT Checkers for Bounded Model Checking
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Symbolic model checking for temporal-epistemic logics
ACM SIGACT News
Symbolic model checking for temporal-epistemic logic
Logic Programs, Norms and Action
| Hi-index | 0.00 |
Bounded Model Checking (BMC) encodes a model checking problem in the propositional logic. Diagnosing the resulting formula to be satisfiable provides a counterexample. While surprisingly efficient for many complex systems, in general BMC still fails to be complete and is a method of falsification rather then validation. The major obstacle is satisfiability testing (SAT). The paper introduces a selective search to the standard DLL SAT algorithm, allowing to profit from several optimization techniques proposed for non-symbolic methods. Partial-order reductions are shown as an example of selective search. Preliminary experimental results confirm that the selective search can significantly improve the effectiveness of BMC.