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 16 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)
• \texttt{cake\_lpr}: verified propagation redundancy checking in CakeML (Q2233509) (← links)
• Automatic refinement to efficient data structures: a comparison of two approaches (Q2417948) (← links)
• SMT proof checking using a logical framework (Q2441776) (← links)
• Strategyproof social choice when preferences and outcomes may contain ties (Q2673159) (← links)
• Functional Encryption for Inner Product with Full Function Privacy (Q2798775) (← links)
• A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality (Q2817909) (← links)
• SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers (Q2818043) (← links)
• versat: A Verified Modern SAT Solver (Q2891429) (← links)
• Animating the Formalised Semantics of a Java-Like Language (Q3088008) (← links)