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

August 26, 2025 Β· Declared Dead Β· πŸ› Proceedings of the 1st ACM SIGPLAN International Workshop on Language Models and Programming Languages

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Barış Bayazıt, Yao Li, Xujie Si arXiv ID 2508.18587 Category cs.PL: Programming Languages Cross-listed cs.AI Citations 2 Venue Proceedings of the 1st ACM SIGPLAN International Workshop on Language Models and Programming Languages Last Checked 4 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Programming Languages

Died the same way β€” πŸ‘» Ghosted