Pages that link to "Item:Q606999"

The following pages link to Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL (Q606999):

Displaying 7 items.

• SAT Solver Verification (Q40545) (← links)
• The reflective Milawa theorem prover is sound (down to the machine code that runs it) (Q286790) (← links)
• Self-formalisation of higher-order logic. Semantics, soundness, and a verified implementation (Q287361) (← 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)