The International SAT Solver Competitions

Järvisalo, Matti; Berre, Daniel Le; Roussel, Olivier; Simon, Laurent

doi:10.1609/aimag.v33i1.2395

Cited by 96 publications

(79 citation statements)

References 17 publications

(19 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Comparison with other competitions Over the past fifteen years, the arise of several software tool competitions [2,21,54,55,59,84] has deeply contributed to advance the state of the art in the computer-aided verification technology. The international SAT solver competition [59] is a pioneer example with a long track record of editions starting from 2002.…”

Section: Lessons Learned and Discussionmentioning

confidence: 99%

“…For these reasons, inspired by the success of similar events in other areas of computer-aided verification (e.g., SAT [59], SV-COMP [20], SMT [2], RERS [53,54]), Ezio Bartocci, Borzoo Bonakdarpour, and Yliès Falcone organized the first international Competition on Runtime Verification (CRV 2014) with the aim to foster the process of comparison and evaluation of software runtime verification tools.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

First international Competition on Runtime Verification: rules, benchmarks, tools, and final results of CRV 2014

Bartocci

Falcone

Bonakdarpour

et al. 2017

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

The first international Competition on Runtime Verification (CRV) was held in September 2014, in Toronto, Canada, as a satellite event of the 14th international conference on Runtime Verification (RV'14). The event was organized in three tracks: (1) offline monitoring, (2) online monitoring of C programs, and (3) online monitoring of Java programs. In this paper, we report on the phases and rules, a description of the participating teams and their submitted benchmark, the (full) results, as well as the lessons learned from the competition.

show abstract

Section: Lessons Learned and Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

First international Competition on Runtime Verification: rules, benchmarks, tools, and final results of CRV 2014

Bartocci

Falcone

Bonakdarpour

et al. 2017

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

show abstract

“…For a given group of symmetries, the first tool generates less permutations to represent the group than the second one, but it is slower than the other one. We selected from the last six editions of the SAT contests [11], the CNF instances for which bliss finds at least 2% of the variables are involved in some symmetries that could be computed in at most 1000 s of CPU time. We obtained a total of 1350 symmetric instances (discarding repetitions) out of 3700 instances in total.…”

Section: Discussionmentioning

confidence: 99%

CDCLSym: Introducing Effective Symmetry Breaking in SAT Solving

Metin¹,

Baarir

Colange

et al. 2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. SAT solvers are now widely used to solve a large variety of problems, including formal verification of systems. SAT problems derived from such applications often exhibit symmetry properties that could be exploited to speed up their solving. Static symmetry breaking is so far the most popular approach to take advantage of symmetries. It relies on a symmetry preprocessor which augments the initial problem with constraints that force the solver to consider only a few configurations among the many symmetric ones. This paper presents a new way to handle symmetries, that avoid the main problem of the current static approaches: the prohibitive cost of the preprocessing phase. Our proposal has been implemented in MiniSym. Extensive experiments on the benchmarks of last six SAT competitions show that our approach is competitive with the best state-of-the-art static symmetry breaking solutions.

show abstract

“…In particular, as we will see below, SAT solving is the CSP branch in which portfolio approaches have been grown more. Starting from 2002, international SAT solver competitions [111] take place in order to evaluate the performance of different solvers on extensive benchmarks of real case, randomly generated and hand-crafted instances defined in the Dimacs standard format [112]. It is worth noting that, although technically SAT problems are simplified CSPs, in the literature there is a clear distinction between them and the "generic" CSPs (which typically have integer domains).…”

Section: Boolean Variablesmentioning

confidence: 99%

Portfolio approaches in constraint programming

Amadini

2015

Constraints

View full text Add to dashboard Cite

Recent research has shown that the performance of a single, arbitrarily efficient algorithm can be significantly outperformed by using a portfolio of -possibly onaverage slower-algorithms. Within the Constraint Programming (CP) context, a portfolio solver can be seen as a particular constraint solver that exploits the synergy between the constituent solvers of its portfolio for predicting which is (or which are) the best solver(s) to run for solving a new, unseen instance.In this thesis we examine the benefits of portfolio solvers in CP. Despite portfolio approaches have been extensively studied for Boolean Satisfiability (SAT) problems, in the more general CP field these techniques have been only marginally studied and used. We conducted this work through the investigation, the analysis and the construction of several portfolio approaches for solving both satisfaction and optimization problems. We focused in particular on sequential approaches, i.e., single-threaded portfolio solvers always running on the same core.We started from a first empirical evaluation on portfolio approaches for solving Constraint Satisfaction Problems (CSPs), and then we improved on it by introducing new data, solvers, features, algorithms, and tools. Afterwards, we addressed the more general Constraint Optimization Problems (COPs) by implementing and testing a number of models for dealing with COP portfolio solvers. Finally, we have come full circle by developing sunny-cp: a sequential CP portfolio solver that turned out to be competitive also in the MiniZinc Challenge, the reference competition for CP solvers.iii iv

show abstract

The International SAT Solver Competitions

Cited by 96 publications

References 17 publications

First international Competition on Runtime Verification: rules, benchmarks, tools, and final results of CRV 2014

First international Competition on Runtime Verification: rules, benchmarks, tools, and final results of CRV 2014

CDCLSym: Introducing Effective Symmetry Breaking in SAT Solving

Portfolio approaches in constraint programming

Contact Info

Product

Resources

About