Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors

Miroslav N Velev, Randal E Bryant
2003 Journal of symbolic computation  
We compare SAT-checkers and decision diagrams on the evaluation of Boolean formulas produced in the formal verification of both correct and buggy versions of superscalar and VLIW microprocessors. We identify one SAT-checker that significantly outperforms the rest. We evaluate ways to enhance its performance by variations in the generation of the Boolean correctness formulas. We reassess optimizations previously used to speed up the formal verification and probe future challenges.
doi:10.1016/s0747-7171(02)00091-3 fatcat:ma4sxaghq5cdreaqjmcubhws7e