The set of novelties introduced with the SAT solver Glucose is now considered as a standard
for practical SAT solving. In this paper, we review the different strategies and technologies …

The SAT Competitions constitute a well-established series of yearly open international
algorithm implementation competitions, focusing on the Boolean satisfiability (or …

SAT solving in large distributed environments has previously led to some famous results and
to impressive speedups for selected inputs. However, in terms of general-purpose SAT …

A simple yet successful approach to parallel satisfiability (SAT) solving is to run several
different (a portfolio of) SAT solvers on the input problem at the same time until one solver …

Over the last decade, parallel SAT solving has been widely studied from both theoretical and
practical aspects. There are now numerous solvers that differ by parallelization strategies …

We introduce a structure-aware parallel technique for context-bounded analysis of
concurrent programs. The key intuition consists in decomposing the set of concurrent traces …

As multi-core computing is now standard, it seems irresponsible for constraints researchers
to ignore the implications of it. Researchers need to address a number of issues to exploit …

Boolean satisfiability (SAT) solving is one of the most competitive research areas of
theoretical computer science. The performance of state-of-the-art SAT solvers has been …

Distributed clause-sharing SAT solvers can solve problems up to one hundred times faster
than sequential SAT solvers by sharing derived information among multiple sequential …

Over the last decade, parallel SATisfiability solving has been widely studied from both
theoretical and practical aspects. There are two main approaches. First, divide-and-conquer …