HackerPapers

arXiv:2508.18587cs.PL

A Case Study on the Effectiveness of LLMs in Verification with Proof Assistants

Barış Bayazıt, Yao Li, Xujie Si

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

Large language models (LLMs) can potentially help with verification using proof assistants by automating proofs. However, it is unclear how effective LLMs are in this task. In this paper, we perform a case study based on two mature Rocq projects: the hs-to-coq tool and Verdi. We evaluate the effectiveness of LLMs in generating proofs by both quantitative and qualitative analysis. Our study finds that: (1) external dependencies and context in the same source file can significantly help proof generation; (2) LLMs perform great on small proofs but can also generate large proofs; (3) LLMs perform differently on different verification projects; and (4) LLMs can generate concise and smart proofs, apply classical techniques to new definitions, but can also make odd mistakes.

arXiv comments
Accepted by LMPL 2025
Journal reference
DOI
doi:10.1145/3759425.3763391
Subjects
cs.PLProgramming Languages cs.AIArtificial Intelligence

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from May 2026 to May 2026.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Of course they are. LLMs are routinely used to generate Lean proofs, so of course they can also be used to generate verified software. They probably aren't being used that way, yet, but they will be: * A Case Study on the Effectiveness of LLMs in Verification with Proof…

      naaskingView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.