Pages that link to "Item:Q1687744"

The following pages link to Efficient, verified checking of propositional proofs (Q1687744):

Displaying 23 items.

• Efficiently checking propositional refutations in HOL theorem provers (Q1006729) (← links)
• Using an induction prover for verifying arithmetic circuits (Q1856145) (← links)
• The propositional formula checker HeerHugo (Q1977753) (← links)
• Certifying emptiness of timed Büchi automata (Q1996011) (← links)
• Generating extended resolution proofs with a BDD-based SAT solver (Q2044191) (← links)
• Clause redundancy and preprocessing in maximum satisfiability (Q2104499) (← links)
• Simulating strong practical proof systems with extended resolution (Q2209554) (← links)
• \texttt{cake\_lpr}: verified propagation redundancy checking in CakeML (Q2233509) (← links)
• Milestones from the Pure Lisp Theorem Prover to ACL2 (Q2280212) (← links)
• Formally verifying the solution to the Boolean Pythagorean triples problem (Q2323449) (← links)
• SMT proof checking using a logical framework (Q2441776) (← links)
• Efficient Probabilistically Checkable Debates (Q3088122) (← links)
• DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs (Q3192088) (← links)
• Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof (Q3453106) (← links)
• Batch ZK Proof and Verification of OR Logic (Q3624273) (← links)
• The Mechanical Verification of a DPLL-Based Satisfiability Solver (Q5179007) (← links)
• On the concrete efficiency of probabilistically-checkable proofs (Q5495829) (← links)
• (Q5875431) (← links)
• Efficient verified (UN)SAT certificate checking (Q5919480) (← links)
• Propositional proof skeletons (Q6535365) (← links)
• Unsatisfiability proofs for distributed clause-sharing SAT solvers (Q6535367) (← links)
• A resolution-based interactive proof system for UNSAT (Q6629521) (← links)
• Practical algebraic calculus and Nullstellensatz with the checkers Pacheck and Pastèque and Nuss-Checker (Q6661748) (← links)