Bounded Model Checking with Parametric Data Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
Compressing BMC Encodings with QBF
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Algorithms for maximum satisfiability using unsatisfiable cores
Proceedings of the conference on Design, automation and test in Europe
Bounded Model Checking with Description Logic Reasoning
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Deciding Effectively Propositional Logic Using DPLL and Substitution Sets
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Consistency checking of all different constraints over bit-vectors within a SAT solver
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Journal of Computer Science and Technology
A Compact Representation for Syntactic Dependencies in QBFs
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Solving QBF with combined conjunctive and disjunctive normal form
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers
Electronic Notes in Theoretical Computer Science (ENTCS)
Symbolic algorithmic verification of generalized noninterference
WSEAS Transactions on Computers
Evaluating and certifying QBFs: A comparison of state-of-the-art tools
AI Communications
Deciding Effectively Propositional Logic Using DPLL and Substitution Sets
Journal of Automated Reasoning
A first step towards a unified proof checker for QBF
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Nenofex: expanding NNF for QBF solving
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
An AIG-Based QBF-solver using SAT for preprocessing
Proceedings of the 47th Design Automation Conference
Leveraging dominators for preprocessing QBF
Proceedings of the Conference on Design, Automation and Test in Europe
An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Abstraction-based algorithm for 2QBF
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Transformations into normal forms for quantified circuits
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Resolution proofs and Skolem functions in QBF evaluation and applications
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Validating QBF validity in HOL4
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Proving valid quantified Boolean formulas in HOL light
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Rewriting (dependency-)quantified 2-CNF with arbitrary free literals into existential 2-HORN
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Validating QBF invalidity in HOL4
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Unified QBF certification and its applications
Formal Methods in System Design
Parallel QBF Solving with Advanced Knowledge Sharing
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Verification of partial designs using incremental QBF solving
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
| Hi-index | 0.00 |
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion problem. Methods based on the validity of Quantified Boolean Formulas (QBF) allow an exponentially more succinct representation of the checked formulas, but have not been widely used, because of the lack of an efficient decision procedure for QBF. We evaluate the usage of QBF in BMC, using general-purpose SAT and QBF solvers. We also present 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. Our procedure performs much better for BMC than the general-purpose QBF solvers, without incurring the space overhead of propositional SAT.