DMCA
Incrementally Improving SAT-based Bounded Model Checking
BibTeX
@MISC{Zhang_incrementallyimproving,
author = {Liang Zhang and Mukul R Prasad and Michael S Hsiao},
title = {Incrementally Improving SAT-based Bounded Model Checking},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Bounded Model Checking (BMC) based on Boolean Satisfiability (SAT) methods has recently gained popularity as a viable alternative to BDD-based techniques for verifying large designs. This work proposes a number of conceptually simple, but extremely effective, optimizations for enhancing the performance of SATbased BMC flows. The keys ideas include (1) a novel idea to combine SAT-based inductive reasoning and BMC, (2) clever orchestration of variable ordering and learned information in an incremental framework for BMC, and (3) BMC-specific ordering strategies for the SAT solver. Our experiments, conducted on a wide range of industrial designs, show that the proposed optimizations consistently provide between 1-2 orders of magnitude speedup and can be extremely useful in enhancing the efficacy of typical SATBMC tools.
Keyphrases
sat-based bounded model checking large design typical satbmc tool variable ordering industrial design bdd-based technique bmc-specific ordering strategy key idea satbased bmc boolean satisfiability model checking wide range incremental framework sat-based inductive reasoning magnitude speedup 1-2 order novel idea sat solver clever orchestration
