SpyBug: automated bug detection in the configuration space of SAT solvers
DOI10.1007/978-3-319-40970-2_36zbMATH Open1475.68443OpenAlexW2487961158MaRDI QIDQ2818043FDOQ2818043
Authors: Norbert Manthey, Marius Lindauer 
Publication date: 5 September 2016
Published in: Theory and Applications of Satisfiability Testing – SAT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-40970-2_36
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cites Work
- Paramils: an automatic algorithm configuration framework
- Controlling a solver execution with the runsolver Tool
- Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
- Conflict-driven answer set solving: from theory to practice
- Inprocessing rules
- Automated testing and debugging of SAT and QBF solvers
- Theory and Applications of Satisfiability Testing
- The configurable SAT solver challenge (CSSC)
- versat: A Verified Modern SAT Solver
- SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers
Cited In (7)
- Targeted configuration of an SMT solver
- DRAT proofs for XOR reasoning
- Automated testing and debugging of SAT and QBF solvers
- SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers
- Efficient benchmarking of algorithm configurators via model-based surrogates
- Never trust your solver: certification for SAT and QBF
- The \textsc{MergeSat} solver
Uses Software
This page was built for publication: SpyBug: automated bug detection in the configuration space of SAT solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2818043)
