Space-efficient bounded model checking

Jacob Katz*, Ziyad Hanna, Nachum Dershowitz

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationProceedings - Design, Automation and Test in Europe, DATE '05
Pages686-687
Number of pages2
DOIs
StatePublished - 2005
EventDesign, Automation and Test in Europe, DATE '05 - Munich, Germany
Duration: 7 Mar 200511 Mar 2005

Publication series

NameProceedings -Design, Automation and Test in Europe, DATE '05
VolumeII
ISSN (Print)1530-1591

Conference

ConferenceDesign, Automation and Test in Europe, DATE '05
Country/TerritoryGermany
CityMunich
Period7/03/0511/03/05

Fingerprint

Dive into the research topics of 'Space-efficient bounded model checking'. Together they form a unique fingerprint.

Cite this