mlsanityData to 7 Oct 2026

VeriSoftBench: Repository-Scale Formal Verification Benchmarks for Lean

arXiv 2602.18307 ↗First posted 20 Feb 2026cs.SE cs.CL cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

Large language models have achieved striking results in interactive theorem proving, particularly in Lean. However, most benchmarks for LLM-based proof automation are drawn from mathematics in the Mathlib ecosystem, whereas proofs in software verification are developed inside definition-rich codebases with substantial project-specific libraries. We introduce VeriSoftBench, a benchmark of 500 Lean 4 proof obligations drawn from open-source formal-methods developments and packaged to preserve realistic repository context and cross-file dependencies. Our evaluation of frontier LLMs and specialized provers yields three observations. First, provers tuned for Mathlib-style mathematics transfer poorly to this repository-centric setting. Second, success is strongly correlated with transitive repository dependence: tasks whose proofs draw on large, multi-hop dependency closures are less likely to be solved. Third, providing curated context restricted to a proof's dependency closure improves performance relative to exposing the full repository, but nevertheless leaves substantial room for improvement. Our benchmark and evaluation suite are released at https://github.com/utopia-group/VeriSoftBench.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 25 of its 61 references that are in the map. First posted on arXiv 20 Feb 2026.

Builds on

25 of 61 references.

References · 25

  1. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  2. 2021Program Synthesis with Large Language Modelscited by 3,509
  3. 2023LeanDojo: Theorem Proving with Retrieval-Augmented Language Modelscited by 414
  4. 2021MiniF2F: a cross-system benchmark for formal Olympiad-level mathematicscited by 380
  5. 2020Generative Language Modeling for Automated Theorem Provingcited by 379
  6. 2022Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofscited by 278
  7. 2025DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decompositioncited by 270
  8. 2022HyperTree Proof Search for Neural Theorem Provingcited by 192
  9. 2025Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learningcited by 173
  10. 2024PutnamBench: Evaluating Neural Theorem-Provers on the Putnam Mathematical Competitioncited by 153
  11. 2025Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correctioncited by 140
  12. 2019Learning to Prove Theorems via Interacting with Proof Assistantscited by 107
13 more
  1. 2022Thor: Wielding Hammers to Integrate Language Models and Automated Theorem Proverscited by 97
  2. 2023An In-Context Learning Agent for Formal Theorem-Provingcited by 78
  3. 2025Hilbert: Recursively Building Formal Proofs with Informal Reasoningcited by 55
  4. 2024DafnyBench: A Benchmark for Formal Software Verificationcited by 54
  5. 2023Verus: Verifying Rust Programs using Linear Ghost Types (extended version)cited by 50
  6. 2024miniCTX: Neural Theorem Proving with (Long-)Contextscited by 35
  7. 2025CLEVER: A Curated Benchmark for Formally Verified Code Generationcited by 27
  8. 2025Ax-Prover: A Deep Reasoning Agentic Framework for Theorem Proving in Mathematics and Quantum Physicscited by 27
  9. 2024Rango: Adaptive Retrieval-Augmented Proving for Automated Software Verificationcited by 25
  10. 2024miniCodeProps: a Minimal Benchmark for Proving Code Propertiescited by 18
  11. 2025Proving the Coding Interview: A Benchmark for Formally Verified Code Generationcited by 18
  12. 2025Lean-SMT: An SMT tactic for discharging proof goals in Leancited by 9
  13. 2024Small Scale Reflection for the Working Lean Usercited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 6.

6 papers.