Passport: Improving Automated Formal Verification Using Identifiers
Not on the map. Why?
Abstract (arXiv)
Formally verifying system properties is one of the most effective ways of improving system quality, but its high manual effort requirements often render it prohibitively expensive. Tools that automate formal verification, by learning from proof corpora to suggest proofs, have just begun to show their promise. These tools are effective because of the richness of the data the proof corpora contain. This richness comes from the stylistic conventions followed by communities of proof developers, together with the logical systems beneath proof assistants. However, this richness remains underexploited, with most work thus far focusing on architecture rather than making the most of the proof data. In this paper, we develop Passport, a fully-automated proof-synthesis tool that systematically explores how to most effectively exploit one aspect of that proof data: identifiers. Passport enriches a predictive Coq model with three new encoding mechanisms for identifiers: category vocabulary indexing, subword sequence modeling, and path elaboration. We compare Passport to three existing base tools which Passport can enhance: ASTactic, Tac, and Tok. In head-to-head comparisons, Passport automatically proves 29% more theorems than the best-performing of these base tools. Combining the three Passport-enhanced tools automatically proves 38% more theorems than the three base tools together, without Passport's enhancements. Finally, together, these base tools and Passport-enhanced tools prove 45% more theorems than the combined base tools without Passport's enhancements. Overall, our findings suggest that modeling identifiers can play a significant role in improving proof synthesis, leading to higher-quality software.
Key facts. Cited by 19 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 Apr 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 11; 2025: 4; 2026: 2.
19 papers.
Sort:
By area:
- 2023Baldur: Whole-Proof Generation and Repair with Large Language Modelscited by 118
- 2024A Survey on Deep Learning for Theorem Provingcited by 55
- 2024Lean Copilot: Large Language Models as Copilots for Theorem Proving in Leancited by 52
- 2024Rango: Adaptive Retrieval-Augmented Proving for Automated Software Verificationcited by 25
- 2024Proof Automation with Large Language Modelscited by 20
- 2024miniCodeProps: a Minimal Benchmark for Proving Code Propertiescited by 18
- 2023Can Transformers Learn to Solve Problems Recursively?cited by 17
- 2024Graph2Tac: Online Representation Learning of Formal Math Conceptscited by 15
- 2024Transformer-Based Models Are Not Yet Perfect At Learning to Emulate Structural Recursioncited by 14
- 2024Cobblestone: A Divide-and-Conquer Approach for Automating Formal Verificationcited by 8
- 2025Agentic Verification of Software Systemscited by 5
- 2024QEDCartographer: Automating Formal Verification Using Reward-Free Reinforcement Learningcited by 3
7 more
- 2025A Case Study on the Effectiveness of LLMs in Verification with Proof Assistantscited by 3
- 2024Application of AI to formal methods - an analysis of current trendscited by 2
- 2026Automated Lemma Discovery in Agentic Program Verificationcited by 2
- 2024The Tactician's Web of Large-Scale Formal Knowledgecited by 1
- 2025Hierarchical Attention Generates Better Proofscited by 1
- 2025Position: Intelligent Coding Systems Should Write Programs with Justificationscited by 0
- 2026PROVE-RT: Generating Mechanized Theorem Prover Scripts for Real-Time Systems using LLMscited by 0
- 2026PROVE-RT: Generating Mechanized Theorem Prover Scripts for Real-Time Systems using LLMs13 Aug 2026
- 2026Automated Lemma Discovery in Agentic Program Verification23 Mar 2026
- 2025Agentic Verification of Software Systems21 Nov 2025
- 2025A Case Study on the Effectiveness of LLMs in Verification with Proof Assistants26 Aug 2025
- 2025Position: Intelligent Coding Systems Should Write Programs with Justifications8 Aug 2025
- 2025Hierarchical Attention Generates Better Proofs27 Apr 2025
- 2024Rango: Adaptive Retrieval-Augmented Proving for Automated Software Verification18 Dec 2024
- 2024Application of AI to formal methods - an analysis of current trends22 Nov 2024
- 2024Cobblestone: A Divide-and-Conquer Approach for Automating Formal Verification25 Oct 2024
- 2024Proof Automation with Large Language Models22 Sep 2024
- 2024QEDCartographer: Automating Formal Verification Using Reward-Free Reinforcement Learning17 Aug 2024
- 2024miniCodeProps: a Minimal Benchmark for Proving Code Properties16 Jun 2024
7 more
- 2024Lean Copilot: Large Language Models as Copilots for Theorem Proving in Lean18 Apr 2024
- 2024A Survey on Deep Learning for Theorem Proving15 Apr 2024
- 2024Transformer-Based Models Are Not Yet Perfect At Learning to Emulate Structural Recursion23 Jan 2024
- 2024The Tactician's Web of Large-Scale Formal Knowledge5 Jan 2024
- 2024Graph2Tac: Online Representation Learning of Formal Math Concepts5 Jan 2024
- 2023Can Transformers Learn to Solve Problems Recursively?24 May 2023
- 2023Baldur: Whole-Proof Generation and Repair with Large Language Models8 Mar 2023
- 2025Agentic Verification of Software Systemscited by 5
- 2026Automated Lemma Discovery in Agentic Program Verificationcited by 2
- 2026Automated Lemma Discovery in Agentic Program Verification23 Mar 2026
- 2025Agentic Verification of Software Systems21 Nov 2025
- 2023Baldur: Whole-Proof Generation and Repair with Large Language Modelscited by 118
- 2024A Survey on Deep Learning for Theorem Provingcited by 55
- 2024Lean Copilot: Large Language Models as Copilots for Theorem Proving in Leancited by 52
- 2024Proof Automation with Large Language Modelscited by 20
- 2024miniCodeProps: a Minimal Benchmark for Proving Code Propertiescited by 18
- 2023Can Transformers Learn to Solve Problems Recursively?cited by 17
- 2024Graph2Tac: Online Representation Learning of Formal Math Conceptscited by 15
- 2024Transformer-Based Models Are Not Yet Perfect At Learning to Emulate Structural Recursioncited by 14
- 2024Cobblestone: A Divide-and-Conquer Approach for Automating Formal Verificationcited by 8
- 2024QEDCartographer: Automating Formal Verification Using Reward-Free Reinforcement Learningcited by 3
- 2025A Case Study on the Effectiveness of LLMs in Verification with Proof Assistantscited by 3
- 2024Application of AI to formal methods - an analysis of current trendscited by 2
12 most cited of 16 All 16 (JSON)
- 2026PROVE-RT: Generating Mechanized Theorem Prover Scripts for Real-Time Systems using LLMs13 Aug 2026
- 2025A Case Study on the Effectiveness of LLMs in Verification with Proof Assistants26 Aug 2025
- 2025Position: Intelligent Coding Systems Should Write Programs with Justifications8 Aug 2025
- 2025Hierarchical Attention Generates Better Proofs27 Apr 2025
- 2024Application of AI to formal methods - an analysis of current trends22 Nov 2024
- 2024Cobblestone: A Divide-and-Conquer Approach for Automating Formal Verification25 Oct 2024
- 2024Proof Automation with Large Language Models22 Sep 2024
- 2024QEDCartographer: Automating Formal Verification Using Reward-Free Reinforcement Learning17 Aug 2024
- 2024miniCodeProps: a Minimal Benchmark for Proving Code Properties16 Jun 2024
- 2024Lean Copilot: Large Language Models as Copilots for Theorem Proving in Lean18 Apr 2024
- 2024A Survey on Deep Learning for Theorem Proving15 Apr 2024
- 2024Transformer-Based Models Are Not Yet Perfect At Learning to Emulate Structural Recursion23 Jan 2024
12 newest of 16 All 16 (JSON)