arXiv AI

Do Theorem Provers Need Theorem-Proving Agents? mini-Lean-agent: A Coding-Agent Baseline for Lean

arXiv AI
Jun 16

SorryDB: Can AI Provers Complete Real-World Lean Theorems?

arXiv:2603. 02668v2 Announce Type: replace Abstract: We present SorryDB, a dynamically-updating benchmark of open Lean tasks drawn from 78 real world formalization projects on GitHub.

By Austin Letson, Leopoldo Sarra, Auguste Poiroux, Oliver Dressler, Paul Lezeau, Dhyan Aranha, Frederick Pu, Aaron Hill, Miguel Corredera Hidalgo, Julian Berman, George Tsoukalas, Lenny Taelman
arXiv AI
Oct 2

FORALL-LEAN-AGENT for Auditable Reasoning in Formal Mathematics and Software Verification

FORALL-LEAN-AGENT is a frontend‑agnostic framework that enhances auditable reasoning in formal mathematics and software verification. It integrates isolated workspaces, Lean tools, and fresh review processes—including statement comparison, axiom audits, and independent proof checking—to bind verification evidence and reviewer decisions to the same candidate artifact, ensuring traceable acceptance. Evaluations on VeriSoftBench, PutnamBench, and the Lean Eval track show that the framework improves benchmark success rates and reduces costs while providing evidence beyond aggregate solve counts.

By Naing Oo Lwin
arXiv AI
Jun 6

Goedel-Architect: Streamlining Formal Theorem Proving with Blueprint Generation and Refinement

arXiv:2606. 06468v1 Announce Type: new Abstract: We introduce Goedel-Architect, an agentic framework for formal theorem proving in Lean 4 centered on blueprint generation and refinement.

By Jui-Hui Chung, Ziyang Cai, Zihao Li, Qishuo Yin, Rohit Agarwal, Simon Park, Rodrigo Porto, Narutatsu Ri, Ziran Yang, Shange Tang, Xingyu Dang, Hongzhou Lin, Mengdi Wang, Danqi Chen, Chi Jin, Liam H Fowl, Sanjeev Arora
Hugging Face Trending Papers
Jul 7

Harnessing Code Agents for Automatic Software Verification

Formal verification offers the strongest guarantee of software correctness, but it does not scale: the proofs demanded by interactive theorem provers such as Coq require enormous expert effort. Large language models (LLMs) promise to generate these proofs automatically, yet existing approaches wire a fixed, human-designed proof strategy into the system and constrain the model to follow it (retrieving premises and predicting tactics one step at a time, or splitting goals by divide-and-conquer), and still prove only a fraction of their target theorems.

arXiv AI
Oct 12

ProgramGym: Scaling Training Environments for Long-Horizon Program Reproduction Agents

ProgramGym introduces a scalable framework for training long-horizon program reproduction agents, comprising Program-Env and Program-Agent components. Program-Env builds verifiable training environments from repositories via a feedback loop that repairs sandbox builds and improves black-box tests, yielding 1,648 environments across C, C++, Go, and Rust. Program-Agent employs a role-isolated workflow of analysis, implementation, and review with revision management, boosting performance on ProgramBench and raising Qwen3.8-27B’s accuracy from 34.87% to 42.84% and surpassing flagship models with fine-tuning.

By Chengyi Yang, Renxu Bao, Jue Hou, Zongpei Teng, Ziheng Wang, Yujie Lin, Chengsong Huang, Junnan Zhu, Delai Qiu, Yining Wang, Shengping Liu, Fei Long, Jinsong Su