A Case Study on the Effectiveness of LLMs in Verification with Proof Assistants
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 30 of its 99 references that are in the map. First posted on arXiv 26 Aug 2025.
Builds on
30 of 99 references.
References · 30
- 2023A Survey on Hallucination in Large Language Models: Principles, Taxonomy, Challenges, and Open Questionscited by 1,601
- 2023LeanDojo: Theorem Proving with Retrieval-Augmented Language Modelscited by 427
- 2021MiniF2F: a cross-system benchmark for formal Olympiad-level mathematicscited by 391
- 2023Explainability for Large Language Models: A Surveycited by 333
- 2025DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decompositioncited by 287
- 2023ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematicscited by 192
- 2023Baldur: Whole-Proof Generation and Repair with Large Language Modelscited by 119
- 2019Learning to Prove Theorems via Interacting with Proof Assistantscited by 109
- 2016DeepMath - Deep Sequence Models for Premise Selectioncited by 81
- 2024DafnyBench: A Benchmark for Formal Software Verificationcited by 57
- 2024Autoformalize Mathematical Statements by Symbolic Equivalence and Semantic Consistencycited by 41
- 2019Generating Correctness Proofs with Neural Networkscited by 37
18 more
- 2025VERINA: Benchmarking Verifiable Code Generationcited by 34
- 2024Autoformalizing Euclidean Geometrycited by 27
- 2024Rango: Adaptive Retrieval-Augmented Proving for Automated Software Verificationcited by 27
- 2020The Tactician (extended version): A Seamless, Interactive Tactic Learner and Prover for Coqcited by 24
- 2024FVEL: Interactive Formal Verification Environment with Large Language Models via Theorem Provingcited by 22
- 2024Proof Automation with Large Language Modelscited by 22
- 2022Passport: Improving Automated Formal Verification Using Identifierscited by 19
- 2025Proving the Coding Interview: A Benchmark for Formally Verified Code Generationcited by 19
- 2024miniCodeProps: a Minimal Benchmark for Proving Code Propertiescited by 18
- 2025Proving Olympiad Inequalities by Synergizing LLMs and Symbolic Reasoningcited by 17
- 2020QED at Large: A Survey of Engineering of Formally Verified Softwarecited by 13
- 2024Selene: Pioneering Automated Proof in Software Verificationcited by 12
- 2024CoqPilot, a plugin for LLM-based generation of proofscited by 11
- 2019Interaction Trees: Representing Recursive and Impure Programs in Coqcited by 7
- 2018Concrete Semantics with Coq and CoqHammercited by 2
- 2017Total Haskell is Reasonable Coqcited by 1
- 2018From C to Interaction Trees: Specifying, Verifying, and Testing a Networked Servercited by 1
- 2019Embracing a mechanized formalization gapcited by 1
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.