paperbot · PL 论文追踪

全部论文 待读 收藏

P1 QEDCartographer: Automating Formal Verification Using Reward-Free Reinforcement Learning

QEDCartographer:使用无奖励强化学习自动化形式验证
ICSE 2025 IEEE/ACM 47th International Conference on Software Engineering (ICSE)2025匹配度 5/10 · 该论文属于用机器学习(监督+无奖励强化学习)改进形式化验证中的证明合成,与“AI→PL”方向有一定交集,且包含 benchmark 与工程实现;但未涉及 LLM/Agent,也不属于静态分析、浮点程序分析或贝叶斯程序分析等用户核心兴趣点,因此匹配度中等。引用 2 inbox
Alex Sanchez-Stern, Abhishek Varghese, Zhanna Kaufman, Dylan Zhang, Talia Ringer, Yuriy Brun
crossref: 2026-09-12

AI 速览

一句话:提出结合监督与无奖励强化学习的证明合成工具 QEDCartographer,利用证明分支结构提升 Coq 定理自动证明率。

形式验证能提升软件可靠性,但人工编写证明极为困难。现有证明合成工具依赖定理证明器的粗粒度进度信号,搜索近乎无方向。QEDCartographer 结合监督学习与强化学习,将证明的分支结构纳入搜索,实现无奖励强化学习以缓解稀疏奖励问题。在含 124 个 Coq 项目、68.5K 条定理的 CoqGym 基准上,它全自动证明 21.4% 的测试定理,优于此前最优的纯监督学习工具 Proverbot9001 (19.8%) 和组合 62 个工具的 Diva (19.2%);相比 Proverbot9001,平均证明短 26%、快 27%。与 CoqHammer 结合可证明 31.8%,表明强化学习是改进证明合成搜索的有效方向。

问题
形式验证中人工编写证明成本高,现有证明合成工具依赖定理证明器提供粗糙的进度信号,导致证明空间搜索近乎无方向,且形式验证的奖励信号稀疏。
方法
提出 QEDCartographer,结合监督学习与强化学习,并将证明的分支结构纳入搜索,实现无奖励强化学习,以更有效地探索证明空间。
评估
在 CoqGym 基准(124 个 Coq 项目、68.5K 条定理)上评估,全自动证明 21.4% 测试定理,超过 Tok、Tac、ASTactic、Passport、Proverbot9001 和 Diva;相比 Proverbot9001 证明更短更快,并与 CoqHammer 结合证明 31.8%。
原文摘要(Abstract)

Formal verification is a promising method for producing reliable software, but the difficulty of manually writing verification proofs severely limits its utility in practice. Recent methods have automated some proof synthesis by guiding a search through the proof space using a theorem prover. Unfortunately, the theorem prover provides only the crudest estimate of progress, resulting in effectively undirected search. To address this problem, we create QEDCartographer, an automated proofsynthesis tool that combines supervised and reinforcement learning to more effectively explore the proof space. QEDCartographer incorporates the proofs' branching structure, enabling rewardfree search and overcoming the sparse reward problem inherent to formal verification. We evaluate QEDCartographer using the CoqGym benchmark of 68.5 K theorems from 124 open-source Coq projects. QEDCartographer fully automatically proves$\mathbf{2 1. 4 \%}$of the test-set theorems. Previous search-based proof-synthesis tools Tok, Tac, ASTactic, Passport, and Proverbot9001, which rely only on supervised learning, prove$9.6 \%, 9.8 \%, 10.9 \%$, 12.5 %, and 19.8 %, respectively. Diva, which combines 62 tools, proves 19.2 %. Comparing to the most effective prior tool, Proverbot9001, QEDCartographer produces 26 % shorter proofs 27 % faster, on average over the theorems both tools prove. Together, QEDCartographer and non-learning-based CoqHammer prove 31.8 % of the theorems, while CoqHammer alone proves$\mathbf{2 6. 6 \%}$. Our work demonstrates that reinforcement learning is a fruitful research direction for improving proof-synthesis tools' search mechanisms.

链接与引用

DOI 原文 ·

BibTeX
@inproceedings{paperbot8875,
  title = {QEDCartographer: Automating Formal Verification Using Reward-Free Reinforcement Learning},
  author = {Alex Sanchez-Stern and Abhishek Varghese and Zhanna Kaufman and Dylan Zhang and Talia Ringer and Yuriy Brun},
  booktitle = {ICSE},
  year = {2025},
  doi = {10.1109/icse55347.2025.00033}
}