Skip to Main content Skip to Navigation
Conference papers

Space-Efficient Bounded Model Checking

Abstract : Current algorithms for bounded model checking use SAT methods for checking satisfiability of Boolean formulae. These methods suffer from the potential memory explosion problem. Methods based on the validity of Quantified Boolean Formulae (QBF) allow an exponentially more succinct representation of formulae to be checked, because no "unrolling" of the transition relation is required. These methods have not been widely used, because of the lack of an efficient decision procedure for QBF. We evaluate the usage of QBF in bounded model checking (BMC), using general-purpose SAT and QBF solvers. We develop a special-purpose decision procedure for QBF used in BMC, and compare our technique with the methods using general-purpose SAT and QBF solvers on real-life industrial benchmarks.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00181188
Contributor : Eda Publishing Association <>
Submitted on : Tuesday, October 23, 2007 - 1:53:16 PM
Last modification on : Tuesday, January 1, 2019 - 6:46:02 AM
Document(s) archivé(s) le : Sunday, April 11, 2010 - 11:38:46 PM

File

228820686.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Jacob Katz, Ziyad Hanna, Nachum Dershowitz. Space-Efficient Bounded Model Checking. DATE'05, Mar 2005, Munich, Germany. pp.686-687, ⟨10.1109/DATE.2005.276⟩. ⟨hal-00181188⟩

Share

Metrics

Record views

92

Files downloads

153