Presented by Monissa Mohan 1. A highly optimized BCP algorithm Two watched literals Fast Backtracking Efficient Decision Heuristic Focused on.
SAT and Model Checking. Bounded Model Checking (BMC) A.I. Planning problems: can we reach a desired state in k steps? Verification of safety properties:
1 Abstraction Refinement for Bounded Model Checking Anubhav Gupta, CMU Ofer Strichman, Technion Highly Jet Lagged.
Decision Procedures An Algorithmic Point of View
Chaff: Engineering An Efficient SAT Solver
