SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers

DOI10.1007/978-3-319-40970-2_36zbMath1475.68443OpenAlexW2487961158MaRDI QIDQ2818043

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (4)

Never trust your solver: certification for SAT and QBF ⋮ Efficient benchmarking of algorithm configurators via model-based surrogates ⋮ DRAT Proofs for XOR Reasoning ⋮ The \textsc{MergeSat} solver

Uses Software

• Paramils
• Plingeling
• versat
• Runsolver
• CryptoMiniSat
• Treengeling
• Spybug
• SpySMAC
• SMAC
• Lingeling
• Sparrow2Riss

Cites Work

• Unnamed Item
• The configurable SAT solver challenge (CSSC)
• Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
• Conflict-driven answer set solving: from theory to practice
• versat: A Verified Modern SAT Solver
• Inprocessing Rules
• SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers
• ParamILS: An Automatic Algorithm Configuration Framework
• Automated Testing and Debugging of SAT and QBF Solvers
• Theory and Applications of Satisfiability Testing

This page was built for publication: SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers