Improved SAT Based Bounded Model Checking
The usefulness of Bounded Model Checking(BMC) based on propositional satisfiability methods has recently proven its efficacy for bug hunting. The basic idea is to search for a counterexample in executions whose length is bounded by some integer k. In fact, for some properties some bounded paths are equivalent. In the original Bounded Model Checking equivalent bounded paths may be searched repeatedly. Therefore some searches are redundant. In this paper with respect to some properties we exploit new encoding for Bounded Model Checking such that we can avoid searching for redundant bounded paths.
KeywordsModel Check Linear Temporal Logic Atomic Proposition Propositional Formula Kripke Structure
Unable to display preview. Download preview PDF.
- Clarke, E.M., Grumberg, O., Peled, D.: Model checking. MIT Press, Cambridge (2000)Google Scholar
- Pnueli, A.: A temporal logic of concurrent programs. Theoretical Computer Science 13, 45–60Google Scholar
- Shtrichman, O.: Tuning SAT checkers for Bounded Model-Checking. In: CAV. LNCS, vol. 1855 (2000)Google Scholar