Pages that link to "Item:Q839035"
From MaRDI portal
The following pages link to Formalization and implementation of modern SAT solvers (Q839035):
Displaying 9 items.
- The reflective Milawa theorem prover is sound (down to the machine code that runs it) (Q286790) (← links)
- Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL (Q606999) (← links)
- Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points (Q670696) (← links)
- Efficient, verified checking of propositional proofs (Q1687744) (← links)
- Verifying the conversion into CNF in dafny (Q2148786) (← links)
- Formally verified tableau-based reasoners for a description logic (Q2351147) (← links)
- An Expressive Model for Instance Decomposition Based Parallel SAT Solvers (Q2964456) (← links)
- The Mechanical Verification of a DPLL-Based Satisfiability Solver (Q5179007) (← links)
- (Q6060676) (← links)