Exploiting SAT solvers in unbounded model checking K. L. McMillan Cadence Berkeley Labs.
1 Decision heuristics based on an Abstraction/Refinement model Ofer Strichman Roman Gershman An earlier version was presented in IBMs verification conference.
