QmiraXT - A Multithreaded QBF Solver

This paper introduces the state-of-the-art multithreaded QBF solver QMiraXT. QMiraXT is the first parallel QBF Solver that supports advanced features such as: conflict/solution analysis with non-chronological backtracking; knowledge sharing between threads; and novel preprocessing and decision heuristics. By utilizing these features, QMiraXT is significantly faster on industrial and formal verification problems than other solvers. In summary, with 4 threads, QMiraXT solved 22 more benchmarks, providing a speedup of 3.82 compared to the next best sequential solver.

[1]  Burkhard Monien,et al.  A Distributed Algorithm to Evaluate Quantified Boolean Formulae , 2000, AAAI/IAAI.

[2]  Patricia J. Teller,et al.  Proceedings of the 2008 ACM/IEEE conference on Supercomputing , 2008, HiPC 2008.

[3]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

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

[5]  R. Wolski,et al.  GridSAT: A Chaff-based Distributed SAT Solver for the Grid , 2003, ACM/IEEE SC 2003 Conference (SC'03).

[6]  Daniel Kroening,et al.  A First Step Towards a Unified Proof Checker for QBF , 2007, SAT.

[7]  Sharad Malik,et al.  Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms , 2003, SAT.

[8]  Wolfgang Küchlin,et al.  PaSAT - Parallel SAT-Checking with Lemma Exchange: Implementation and Applications , 2001, Electron. Notes Discret. Math..

[9]  S. Malik,et al.  Towards symmetric treatment of con?icts and satisfaction in quanti-fied Boolean satisfiability solv , 2002 .

[10]  Maria Paola Bonacina,et al.  PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems , 1996, J. Symb. Comput..

[11]  Hans Kleine Büning,et al.  Resolution for Quantified Boolean Formulas , 1995, Inf. Comput..

[12]  Bernd Becker,et al.  On Combining 01X-Logic and QBF , 2007, EUROCAST.

[13]  Armando Tacchella,et al.  QuBE++: An Efficient QBF Solver , 2004, FMCAD.

[14]  Ian P. Gent,et al.  Solution Learning and Solution Directed Backjumping, Revisited , 2004 .

[15]  Fahiem Bacchus,et al.  Preprocessing QBF , 2006, CP.

[16]  Marco Benedetti,et al.  sKizzo: A Suite to Evaluate and Certify QBFs , 2005, CADE.

[17]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[18]  Sharad Malik,et al.  Conflict driven learning in a quantified Boolean Satisfiability solver , 2002, ICCAD 2002.

[19]  Jussi Rintanen,et al.  Constructing Conditional Plans by a Theorem-Prover , 1999, J. Artif. Intell. Res..

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

[21]  Sharad Malik,et al.  Towards a symmetric treatment of satisfaction and conflicts in QBF , 2002 .

[22]  Armando Tacchella,et al.  Learning for quantified boolean logic satisfiability , 2002, AAAI/IAAI.

[23]  Bernd Becker,et al.  Multithreaded SAT Solving , 2007, 2007 Asia and South Pacific Design Automation Conference.

[24]  Armando Tacchella,et al.  Watched Data Structures for QBF Solvers , 2003, SAT.