Difference between revisions of "Painless"

From LRDE

Line 17: Line 17:
   
 
== Related Publications ==
 
== Related Publications ==
* [[Publications/le-frioux.19.tacas|Modular and Efficient Divide-and-Conquer SAT Solver on Top of the Painless Framework]] in ''Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)''.
+
* [[Publications/le-frioux.19.tacas|Modular and Efficient Divide-and-Conquer SAT Solver on Top of the Painless Framework]] in ''Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'19)''.
 
* [https://www.lrde.epita.fr/dload/painless/painless-mcomsps-18.pdf painless-mcomsps and painless-mcomsps-sym] in ''Proceedings of SAT Competition 2018: Solver and Benchmark Descriptions''
 
* [https://www.lrde.epita.fr/dload/painless/painless-mcomsps-18.pdf painless-mcomsps and painless-mcomsps-sym] in ''Proceedings of SAT Competition 2018: Solver and Benchmark Descriptions''
* [[Publications/le-frioux.17.sat|Painless: a Framework for Parallel SAT Solving]] in ''Proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing (SAT)''.
+
* [[Publications/le-frioux.17.sat|Painless: a Framework for Parallel SAT Solving]] in ''Proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing (SAT'17)''.
 
* [https://www.lrde.epita.fr/dload/painless/painless-maplecomsps-17.pdf painless-maplecomsps] in ''Proceedings of SAT Competition 2017: Solver and Benchmark Descriptions''
 
* [https://www.lrde.epita.fr/dload/painless/painless-maplecomsps-17.pdf painless-maplecomsps] in ''Proceedings of SAT Competition 2017: Solver and Benchmark Descriptions''

Revision as of 12:42, 18 February 2019

PArallel INstantiabLE Sat Solver (Painless) is a framework written in C++ that simplifies the implementation and evaluation of new parallel SAT solvers for many-core environments. The components of Painless can be instantiated independently to produce a new complete solver. The guiding principle is to separate the technical components dedicated to some specific aspect of concurrent programming, from the components implementing heuristics and optimizations embedded in a parallel SAT solver.

Painless has been developed by the LRDE and the MoVe team at LIP6.

Source Code

painless-v1

Awards

Painless-MapleCOMSPS won 1st in the SAT Competition 2018 parallel track!


Painless-MapleCOMSPS won 3rd in the SAT Competition 2017 parallel track!

Related Publications