Efficient Certified RAT Verification
Not on the map. Why?
Abstract (arXiv)
Clausal proofs have become a popular approach to validate the results of SAT solvers. However, validating clausal proofs in the most widely supported format (DRAT) is expensive even in highly optimized implementations. We present a new format, called LRAT, which extends the DRAT format with hints that facilitate a simple and fast validation algorithm. Checking validity of LRAT proofs can be implemented using trusted systems such as the languages supported by theorem provers. We demonstrate this by implementing two certified LRAT checkers, one in Coq and one in ACL2.
Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). First posted on arXiv 7 Dec 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 3; 2025: 4; 2026: 4.
13 papers.
Sort:
By area:
- 2024Leveraging the Context through Multi-Round Interactions for Jailbreaking Attackscited by 36
- 2022Certified Symmetry and Dominance Breaking for Combinatorial Optimisationcited by 13
- 2024Certified MaxSAT Preprocessingcited by 3
- 2025PICID: Proof-Driven Clause Learning in Neural Network Verificationcited by 3
- 2025Certifying Pareto-Optimality in Multi-Objective Maximum Satisfiabilitycited by 2
- 2021Proof Generation in CDSATcited by 0
- 2024How To Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability: A Branch-and-Bound Approach for Resolution Proof Length Minimizationcited by 0
- 2025Pseudo-Boolean Proof Logging for Optimal Classical Planningcited by 0
- 2025Faster Certified Symmetry Breaking Using Orders With Auxiliary Variablescited by 0
- 2026Streaming LRAT Certificates into Lean Theoremscited by 0
- 2026Formally Verified Synthesizable Floating-Point Data Types in ARCH HDLcited by 0
- 2026LeanCSP: A Framework for Certifying Constraint Reformulation and Solving in Leancited by 0
- 2026Dependable AI-Assisted Engineering: A Formal Framework for AI Participation and Assurance in Safety-Critical Workflows2 Oct 2026
- 2026LeanCSP: A Framework for Certifying Constraint Reformulation and Solving in Lean30 Jul 2026
- 2026Formally Verified Synthesizable Floating-Point Data Types in ARCH HDL26 Jul 2026
- 2026Streaming LRAT Certificates into Lean Theorems1 Jul 2026
- 2025Faster Certified Symmetry Breaking Using Orders With Auxiliary Variables20 Nov 2025
- 2025Pseudo-Boolean Proof Logging for Optimal Classical Planning25 Apr 2025
- 2025PICID: Proof-Driven Clause Learning in Neural Network Verification15 Mar 2025
- 2025Certifying Pareto-Optimality in Multi-Objective Maximum Satisfiability29 Jan 2025
- 2024How To Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability: A Branch-and-Bound Approach for Resolution Proof Length Minimization12 Nov 2024
- 2024Certified MaxSAT Preprocessing26 Apr 2024
- 2024Leveraging the Context through Multi-Round Interactions for Jailbreaking Attacks14 Feb 2024
- 2022Certified Symmetry and Dominance Breaking for Combinatorial Optimisation23 Mar 2022
1 more
- 2021Proof Generation in CDSAT6 Jul 2021
- 2022Certified Symmetry and Dominance Breaking for Combinatorial Optimisationcited by 13
- 2024Certified MaxSAT Preprocessingcited by 3
- 2025PICID: Proof-Driven Clause Learning in Neural Network Verificationcited by 3
- 2025Certifying Pareto-Optimality in Multi-Objective Maximum Satisfiabilitycited by 2
- 2021Proof Generation in CDSATcited by 0
- 2024How To Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability: A Branch-and-Bound Approach for Resolution Proof Length Minimizationcited by 0
- 2025Pseudo-Boolean Proof Logging for Optimal Classical Planningcited by 0
- 2025Faster Certified Symmetry Breaking Using Orders With Auxiliary Variablescited by 0
- 2026Streaming LRAT Certificates into Lean Theoremscited by 0
- 2026Formally Verified Synthesizable Floating-Point Data Types in ARCH HDLcited by 0
- 2026LeanCSP: A Framework for Certifying Constraint Reformulation and Solving in Leancited by 0
- 2026Dependable AI-Assisted Engineering: A Formal Framework for AI Participation and Assurance in Safety-Critical Workflowscited by 0
- 2026Dependable AI-Assisted Engineering: A Formal Framework for AI Participation and Assurance in Safety-Critical Workflows2 Oct 2026
- 2026LeanCSP: A Framework for Certifying Constraint Reformulation and Solving in Lean30 Jul 2026
- 2026Formally Verified Synthesizable Floating-Point Data Types in ARCH HDL26 Jul 2026
- 2026Streaming LRAT Certificates into Lean Theorems1 Jul 2026
- 2025Faster Certified Symmetry Breaking Using Orders With Auxiliary Variables20 Nov 2025
- 2025Pseudo-Boolean Proof Logging for Optimal Classical Planning25 Apr 2025
- 2025PICID: Proof-Driven Clause Learning in Neural Network Verification15 Mar 2025
- 2025Certifying Pareto-Optimality in Multi-Objective Maximum Satisfiability29 Jan 2025
- 2024How To Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability: A Branch-and-Bound Approach for Resolution Proof Length Minimization12 Nov 2024
- 2024Certified MaxSAT Preprocessing26 Apr 2024
- 2022Certified Symmetry and Dominance Breaking for Combinatorial Optimisation23 Mar 2022
- 2021Proof Generation in CDSAT6 Jul 2021