CAQE: A Certifying QBF Solver

We present a new CEGAR-based algorithm for QBF. The algorithm builds on a decomposition of QBFs into a sequence of propositional formulas, which we call the clausal abstraction. Each of the propositional formulas contains the variables of just one quantifier level and additional variables describing the interaction with adjacent quantifier levels. This decomposition leads to a simpler notion of refinement compared to earlier approaches. We also show how to effectively construct Skolem and Herbrand functions from true, respectively false, QBFs; allowing us to certify the solver result. We implemented the algorithm in a solver called CAQE. The experimental evaluation shows that CAQE has competitive performance compared to current QBF solvers and outperforms previous certifying solvers.

[1]  Armin Biere,et al.  PicoSAT Essentials , 2008, J. Satisf. Boolean Model. Comput..

[2]  Armin Biere,et al.  Efficient extraction of Skolem functions from QRAT proofs , 2014, 2014 Formal Methods in Computer-Aided Design (FMCAD).

[3]  Helmut Veith,et al.  Counterexample-guided abstraction refinement for symbolic model checking , 2003, JACM.

[4]  E. Allen Emerson,et al.  A More Efficient BDD-Based QBF Solver , 2011, CP.

[5]  Nachum Dershowitz,et al.  Bounded Model Checking with QBF , 2005, SAT.

[6]  Armin Biere,et al.  DepQBF: A Dependency-Aware QBF Solver , 2010, J. Satisf. Boolean Model. Comput..

[7]  Fahiem Bacchus,et al.  A Uniform Approach for Generating Proofs and Strategies for Both True and False QBF Formulas , 2011, IJCAI.

[8]  Bernd Finkbeiner,et al.  Detecting Unrealizable Specifications of Distributed Systems , 2014, TACAS.

[9]  Armin Biere,et al.  Resolution-Based Certificate Extraction for QBF - (Tool Presentation) , 2012, SAT.

[10]  Hillel Kugler,et al.  Symbolic Approximation of the Bounded Reachability Probability in Large Markov Chains , 2014, QEST.

[11]  Robert K. Brayton,et al.  ABC: An Academic Industrial-Strength Verification Tool , 2010, CAV.

[12]  Armin Biere,et al.  Blocked Clause Elimination for QBF , 2011, CADE.

[13]  Armin Biere,et al.  A Unified Proof System for QBF Preprocessing , 2014, IJCAR.

[14]  Mikolás Janota,et al.  Solving QBF by Clause Selection , 2015, IJCAI.

[15]  Lakhdar Sais,et al.  A Symbolic Search Based Approach for Quantified Boolean Formulas , 2005, SAT.

[16]  Armando Tacchella,et al.  QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability , 2001, IJCAR.

[17]  Mikolás Janota,et al.  Abstraction-Based Algorithm for 2QBF , 2011, SAT.

[18]  Armin Biere,et al.  Compressing BMC Encodings with QBF , 2007, BMC@FLoC.

[19]  Mikolás Janota,et al.  Solving QBF with Counterexample Guided Refinement , 2012, SAT.

[20]  Florian Lonsing,et al.  SAT-based methods for circuit synthesis , 2014, 2014 Formal Methods in Computer-Aided Design (FMCAD).

[21]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[22]  Armin Biere,et al.  Resolve and Expand , 2004, SAT.

[23]  Marco Benedetti,et al.  QBF-Based Formal Verification: Experience and Perspectives , 2008, J. Satisf. Boolean Model. Comput..

[24]  Armando Solar-Lezama,et al.  Programming by sketching for bit-streaming programs , 2005, PLDI '05.

[25]  Wenhui Zhang,et al.  QBF Encoding of Temporal Properties and QBF-Based Verification , 2014, IJCAR.

[26]  Bernd Finkbeiner,et al.  Fast DQBF Refutation , 2014, SAT.

[27]  Mikolás Janota,et al.  On QBF Proofs and Preprocessing , 2013, LPAR.

[28]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[29]  Armin Biere,et al.  Nenofex: Expanding NNF for QBF Solving , 2008, SAT.

[30]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[31]  Bernd Becker,et al.  Proving QBF-hardness in Bounded Model Checking for Incomplete Designs , 2013, 2013 14th International Workshop on Microprocessor Test and Verification.