arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0710.4629cs.LO
收藏

空间有效的有界模型检验

Space-Efficient Bounded Model Checking

Jacob Katz, Ziyad Hanna, Nachum Dershowitz

摘要:

现有的有界模型检验算法使用SAT方法来检验布尔公式的可满足性。这些方法遭受潜在的内存爆炸问题。基于量化布尔公式(QBF)的有效性的方法允许检查公式的指数更简洁的表示,因为不需要“展开”的过渡关系。由于缺乏一个有效的QBF决策过程,这些方法没有得到广泛的应用。我们评估使用QBF有界模型检验(BMC),使用通用SAT和QBF求解器。我们开发了一个特殊用途的决策过程中使用的BMC QBF,并比较我们的技术与使用通用SAT和QBF求解器在现实生活中的工业基准的方法。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑