Pages that link to "Item:Q5920089"
From MaRDI portal
The following pages link to Efficient verified (UN)SAT certificate checking (Q5920089):
Displaying 9 items.
- Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points (Q670696) (← links)
- CoqQFBV: a scalable certified SMT quantifier-free bit-vector solver (Q832260) (← links)
- A verified SAT solver framework with learn, forget, restart, and incrementality (Q1663234) (← links)
- Formalization of the resolution calculus for first-order logic (Q1663242) (← links)
- Efficient, verified checking of propositional proofs (Q1687744) (← links)
- Certifying emptiness of timed Büchi automata (Q1996011) (← links)
- A flexible proof format for SAT solver-elaborator communication (Q2044190) (← links)
- Flexible proof production in an industrial-strength SMT solver (Q2104495) (← links)
- (Q5875431) (← links)
