VeriSoftBench: Repository-Scale Formal Verification Benchmarks for Lean

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Xin, Yutong, Chen, Qiaochu, Durrett, Greg, Dillig, Işil
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915809731805184
author Xin, Yutong
Chen, Qiaochu
Durrett, Greg
Dillig, Işil
author_facet Xin, Yutong
Chen, Qiaochu
Durrett, Greg
Dillig, Işil
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2602_18307
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle VeriSoftBench: Repository-Scale Formal Verification Benchmarks for Lean
Xin, Yutong
Chen, Qiaochu
Durrett, Greg
Dillig, Işil
Software Engineering
Computation and Language
Machine Learning
Programming Languages
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.
title VeriSoftBench: Repository-Scale Formal Verification Benchmarks for Lean
topic Software Engineering
Computation and Language
Machine Learning
Programming Languages
url https://arxiv.org/abs/2602.18307