Pages that link to "Item:Q4930578"
From MaRDI portal
The following pages link to Automated Testing and Debugging of SAT and QBF Solvers (Q4930578):
Displaying 17 items.
- The reflective Milawa theorem prover is sound (down to the machine code that runs it) (Q286790) (← links)
- The configurable SAT solver challenge (CSSC) (Q502389) (← links)
- Efficient benchmarking of algorithm configurators via model-based surrogates (Q1707462) (← links)
- QBFFam: a tool for generating QBF families from proof complexity (Q2118282) (← links)
- New models for generating hard random Boolean formulas and disjunctive logic programs (Q2287195) (← links)
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) (Q2321317) (← links)
- QMaxSATpb: a certified MaxSAT solver (Q2694600) (← links)
- SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers (Q2818043) (← links)
- versat: A Verified Modern SAT Solver (Q2891429) (← links)
- SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers (Q3453227) (← links)
- Expressing Symmetry Breaking in DRAT Proofs (Q3454124) (← links)
- (Q4625701) (← links)
- (Q4625702) (← links)
- (Q4993272) (← links)
- Mining definitions in Kissat with Kittens (Q6056639) (← links)
- Towards Uniform Certification in QBF (Q6151563) (← links)
- Certified dominance and symmetry breaking for combinatorial optimisation (Q6488808) (← links)
