swMATH8417MaRDI QIDQ20426FDOQ20426
Author name not available (Why is that?)
Official website: http://rd.springer.com/chapter/10.1007/978-3-642-27940-9_24
Cited In (23)
- Efficient verified (UN)SAT certificate checking
- An expressive model for instance decomposition based parallel SAT solvers
- Extracting verified decision procedures: DPLL and resolution
- Verifying the conversion into CNF in dafny
- Title not available (Why is that?)
- A verified SAT solver framework with learn, forget, restart, and incrementality
- A verified SAT solver framework with learn, forget, restart, and incrementality
- DRAT-trim
- GNATprove
- IsaFoL
- GRAT
- OEuf
- DPT
- SAT Solver Verification
- BooleForce
- Efficient, verified checking of propositional proofs
- FRAT
- cake_lpr
- CertiStr
- Mechanical verification of SAT refutations with extended resolution
- versat: A Verified Modern SAT Solver
- SpyBug: automated bug detection in the configuration space of SAT solvers
- \texttt{cake\_lpr}: verified propagation redundancy checking in CakeML
This page was built for software: versat
