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.
Type de document :
Communication dans un congrès
EDAA - European design and Automation Association. DATE'05, Mar 2005, Munich, Germany. 2, pp.686-687, 2005, 〈10.1109/DATE.2005.276〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00181188
Contributeur : Eda Publishing Association <>
Soumis le : mardi 23 octobre 2007 - 13:53:16
Dernière modification le : mardi 1 janvier 2019 - 06:46:02
Document(s) archivé(s) le : dimanche 11 avril 2010 - 23:38:46

Fichier

228820686.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Jacob Katz, Ziyad Hanna, Nachum Dershowitz. Space-Efficient Bounded Model Checking. EDAA - European design and Automation Association. DATE'05, Mar 2005, Munich, Germany. 2, pp.686-687, 2005, 〈10.1109/DATE.2005.276〉. 〈hal-00181188〉

Partager

Métriques

Consultations de la notice

60

Téléchargements de fichiers

37