paperbot · PL 论文追踪

全部论文 待读 收藏

P1 ProofCoop: Collaborative Automated Formal Verification

ProofCoop:协作式自动形式化验证
ICSE Proceedings of the 2026 IEEE/ACM 48th International Conference on Software Engineering2026匹配度 6/10 · 论文属于机器学习辅助形式化验证/定理证明,与“AI→PL:利用 LLM/Agent 改进静态分析/形式化验证”方向相邻;但它关注多个证明合成模型在搜索中的协作,而非 LLM/Agent 驱动的静态分析或浮点/贝叶斯程序分析,因此匹配度中等。引用 3 inbox
Zhanna Kaufman, Emily First, Alex Sanchez-Stern, Kyle Thompson, Sorin Lerner, Yuriy Brun
crossref: 2026-09-12

AI 速览

一句话:提出 ProofCoop,让多个证明合成模型在搜索中协作,显著提升 Coq 定理自动证明成功率。

在 Coq、Lean 等证明助手中,机器学习虽可自动合成证明,但现有方法成功率有限。已有组合多模型的方法(如 Diva)让各模型独立搜索,未能利用模型间协作。本文提出 ProofCoop,首次实现模型间协作式证明合成,支持六种协作方式:联合下一步预测、投票/竞标/堆叠式偏好预测、搜索中共享已证明引理,以及模型补全彼此的部分证明。在 CoqGym(124 个开源 Coq 项目、68.5K 定理,11.9K 测试定理)上,五个模型组合下 Diva 证明 3287 个(27.5%),最佳单模型证明 2604 个(21.8%),而 ProofCoop 证明 3937 个(33.0%),比此前最优组合方法平均高 19.8%;结合 CoqHammer 可达 36.0%。

问题
使用证明助手进行形式化验证时,自动证明合成仍只能成功解决一小部分定理;已有的多模型组合方法采用彼此独立的搜索,无法发挥模型间协作潜力。
方法
提出 ProofCoop,让多个学习到的证明合成模型在搜索过程中协作,包括联合下一步预测、投票/竞标/堆叠式偏好预测、搜索中共享已证明引理,以及模型补全彼此的部分证明等六种协作机制。
评估
在 CoqGym 基准的 11.9K 测试定理上,用五个模型对比 Diva、最佳单模型及 CoqHammer 组合;ProofCoop 自动证明 3937 个(33.0%),优于 Diva 的 3287 个(27.5%)和最佳单模型的 2604 个(21.8%),结合 CoqHammer 后达 36.0%。
原文摘要(Abstract)

Formal verification using proof assistants, such as Coq or Lean, is an effective way of ensuring software correctness. Recent research has shown that machine learning can automate proof synthesis, but such approaches are only successful a fraction of the time. Methods for improving such proof synthesis include training more precise models, improving the model-driven synthesis search mechanisms, and effectively combining multiple models into synthesis search. This paper focuses on the latter and develops ProofCoop, for the first time demonstrating collaborative cooperation between models. Diva, the state-of-the-art method for combining models, uses a disparate search for each model. On the CoqGym benchmark of 68.5K theorems from 124 open-source Coq projects a Diva combination of five models automatically proves 3,287 (27.5%) of CoqGym’s 11.9K test set theorems, while the best individual model proves only 2,604 (21.8%). By contrast, our method, ProofCoop can use the same five models to fully automatically prove 3,937 (33.0%) theorems, meaning that ProofCoop is 19.8% more likely to prove a theorem, on average, than the prior state of the art combination method. ProofCoop allows its models to build on each other’s contributions and demonstrates that such collaboration significantly increases synthesis success. ProofCoop enables six different types of collaboration: joint model next-step prediction at each search step; preferential next-step prediction via voting, bidding, and stacking; sharing lemmas proven across models mid-search, and models completing each other’s partial proofs. Together with CoqHammer, ProofCoop synthesizes proofs for 36.0% of the theorems. Our research demonstrates that creative uses of learned models can lead to collaborative synthesis that is more effective than prior approaches, suggesting a powerful new research direction in automated formal verification.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@inproceedings{paperbot11952,
  title = {ProofCoop: Collaborative Automated Formal Verification},
  author = {Zhanna Kaufman and Emily First and Alex Sanchez-Stern and Kyle Thompson and Sorin Lerner and Yuriy Brun},
  booktitle = {ICSE},
  year = {2026},
  doi = {10.1145/3744916.3787783}
}