Diversity-Driven Automated Formal Verification
Emily First, Yuriy Brun
摘要
Formally verified correctness is one of the most desirable properties of software systems. But despite great progress made via interactive theorem provers, such as Coq, writing proof scripts for verification remains one of the most effort-intensive (and often prohibitively difficult) software development activities. Recent work has created tools that automatically synthesize proofs or proof scripts. For example, CoqHammer can prove 26.6% of theorems completely automatically by reasoning using precomputed facts, while TacTok and ASTactic, which use machine learning to model proof scripts and then perform biased search through the proof-script space, can prove 12.9% and 12.3% of the theorems, respectively. Further, these three tools are highly complementary; together, they can prove 30.4% of the theorems fully automatically. Our key insight is that control over the learning process can produce a diverse set of models, and that, due to the unique nature of proof synthesis (the existence of the theorem prover, an oracle that infallibly judges a proof's correctness), this diversity can significantly improve these tools' proving power. Accordingly, we develop Diva, which uses a diverse set of models with TacTok's and ASTactic's search mechanism to prove 21.7% of the theorems. That is, Diva proves 68% more theorems than TacTok and 77% more than ASTactic. Complementary to CoqHammer, Diva proves 781 theorems (27% added value) that CoqHammer does not, and 364 theorems no existing tool has proved automatically. Together with CoqHammer, Diva proves 33.8% of the theorems, the largest fraction to date. We explore nine dimensions for learning diverse models, and identify which dimensions lead to the most useful diversity. Further, we develop an optimization to speed up Diva's execution by 40X. Our study introduces a completely new idea for using diversity in machine learning to improve the power of state-of-the-art proof-script synthesis techniques, and empirically demonstrates that the improvement is significant on a dataset of 68K theorems from 122 open-source software projects.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper14
- Baldur: Whole-Proof Generation and Repair with Large Language ModelsEmily First, Markus N. Rabe, Talia Ringer, Yuriy BrunFSE 2023 · 被引用 89 次
- Towards AI-Assisted Synthesis of Verified Dafny MethodsMd Rakib Hossain Misu, Cristina V. Lopes, Iris Ma, James NobleFSE 2024 · 被引用 26 次
- Better Automatic Program Repair by Using Bug Reports and Tests TogetherManish Motwani, Yuriy BrunICSE 2023 · 被引用 22 次
- Graph2Tac: Online Representation Learning of Formal Math ConceptsLasse Blaauwbroek, Mirek Olsák, Jason Rute, Fidel Ivan Schaposnik Massolo 等ICML 2024 · 被引用 18 次
- Automated Program Repair, What Is It Good For? Not Absolutely Nothing!Hadeel Eladawy, Claire Le Goues, Yuriy BrunICSE 2024 · 被引用 15 次
它引用的顶会 Paper5
- Proof Artifact Co-Training for Theorem Proving with Language ModelsJesse Michael Han, Jason Rute, Yuhuai Wu, Edward W. Ayers 等ICLR 2022 · 被引用 149 次
- Simple High-Level Code for Cryptographic Arithmetic - With Proofs, Without CompromisesAndres Erbsen, Jade Philipoom, Jason Gross, Robert Sloan 等S&P 2019 · 被引用 147 次
- TacticZero: Learning to Prove Theorems from Scratch with Deep Reinforcement LearningMinchao Wu, Michael Norrish, Christian Walder, Amir DezfouliNeurIPS 2021 · 被引用 56 次
- TacTok: semantics-aware proof synthesisEmily First, Yuriy Brun, Arjun GuhaOOPSLA 2020 · 被引用 39 次
- Proof repair across type equivalencesTalia Ringer, RanDair Porter, Nathaniel Yazdani, John Leo 等PLDI 2021 · 被引用 20 次
相关 Paper
- ProofCoop: Collaborative Automated Formal VerificationZhanna Kaufman, Emily First, Alex Sanchez-Stern, Kyle Thompson 等ICSE 2026
- QEDCartographer: Automating Formal Verification Using Reward-Free Reinforcement LearningAlex Sanchez-Stern, Abhishek Varghese, Zhanna Kaufman, Shizhuo Dylan Zhang 等ICSE 2025 · 被引用 2 次
- Gpass: A Goal-Adaptive Neural Theorem Prover Based on Coq for Automated Formal VerificationYizhou Chen, Zeyu Sun, Guoqing Wang, Dan HaoICSE 2025 · 被引用 2 次
- Cobblestone: A Divide-and-Conquer Approach for Automating Formal VerificationSaketh Ram Kasibatla, Arpan Agrawal, Yuriy Brun, Sorin Lerner 等ICSE 2026 · 被引用 3 次
- Rango: Adaptive Retrieval-Augmented Proving for Automated Software VerificationKyle Thompson, Nuno Saavedra, Pedro Carrott, Kevin Fisher 等ICSE 2025 · 被引用 4 次
