mlsanityData to 14 Oct 2026

Efficient Certified RAT Verification

arXiv 1612.02353 ↗First posted 7 Dec 2016cs.LOcited by 13

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

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 3; 2025: 4; 2026: 4.

13 papers.

Sort:

By area: