Pages that link to "Item:Q5179007"
From MaRDI portal
The following pages link to The Mechanical Verification of a DPLL-Based Satisfiability Solver (Q5179007):
Displaying 13 items.
- 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)
- A verified SAT solver framework with learn, forget, restart, and incrementality (Q1663234) (← links)
- Efficient, verified checking of propositional proofs (Q1687744) (← links)
- A flexible proof format for SAT solver-elaborator communication (Q2044190) (← links)
- Verifying the conversion into CNF in dafny (Q2148786) (← links)
- Formally verified tableau-based reasoners for a description logic (Q2351147) (← links)
- A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality (Q2817909) (← links)
- Mechanical Verification of a Constructive Proof for FLP (Q2829253) (← links)
- versat: A Verified Modern SAT Solver (Q2891429) (← links)
- (Q5094131) (← links)
- (Q6060676) (← links)
- Verifying a sequent calculus Prover for first-order logic with functions in Isabelle/HOL (Q6611963) (← links)