The Burden of Proof: Automated Tooling for Rapid Iteration on Large Mechanised Proofs

We report on challenges and solutions in making large mechanised proofs scale, based on our experience proving correctness properties for a cache coherence protocol. This was a difficult proof that required dozens of iterations to get right, and ultimately led to an inductive invariant with nearly 800 conjuncts, and to over 54,000 proof obligations. To address these proof engineering challenges we developed super_sketch, a tool that automates the generation of proofs involving multiple subgoals in Isabelle/HOL, enabling efficient management and maintenance of large-scale proofs. We further contribute super_fix, a tool to fix corner cases that cannot be fully automated with super_sketch, such as correcting proof scripts invalidated by upstream changes to definitions. This allowed us to drop simplifying restrictions in our model while retaining the correctness proof, as we avoid the significant manual effort that would otherwise be required to inspect and fix the broken lines of the original proof when generalising the model. Our work provides insights into proof engineering practices and highlights the need for improved support in proof assistants for large-scale mechanized proofs.

Authors

Institutions

Publication Details

Published
2025-04-27
DOI
https://doi.org/10.1109/formalise66629.2025.00010
Citations
2
Primary Topic
Logic, programming, and type systems
Type
article
Field-Weighted Citation Impact
4.96
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Burden of Proof: Automated Tooling for Rapid Iteration on Large Mechanised Proofs

John Wickerson, Jonathan Julián Huerta y Munive, Alastair F. Donaldson, Chenqing Tan
2 citations
Logic, programming, and type systems
4.96
article

The Burden of Proof: Automated Tooling for Rapid Iteration on Large Mechanised Proofs

John Wickerson, Jonathan Julián Huerta y Munive, Alastair F. Donaldson, Chenqing Tan
article en
2 citations

Abstract

We report on challenges and solutions in making large mechanised proofs scale, based on our experience proving correctness properties for a cache coherence protocol. This was a difficult proof that required dozens of iterations to get right, and ultimately led to an inductive invariant with nearly 800 conjuncts, and to over 54,000 proof obligations. To address these proof engineering challenges we developed super_sketch, a tool that automates the generation of proofs involving multiple subgoals in Isabelle/HOL, enabling efficient management and maintenance of large-scale proofs. We further contribute super_fix, a tool to fix corner cases that cannot be fully automated with super_sketch, such as correcting proof scripts invalidated by upstream changes to definitions. This allowed us to drop simplifying restrictions in our model while retaining the correctness proof, as we avoid the significant manual effort that would otherwise be required to inspect and fix the broken lines of the original proof when generalising the model. Our work provides insights into proof engineering practices and highlights the need for improved support in proof assistants for large-scale mechanized proofs.

Czech Technical University in Prague (CZ), Imperial College London (GB)
Openalex Percentile: Top 5%
Logic, programming, and type systems
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The Burden of Proof: Automated Tooling for Rapid Iteration on Large Mechanised Proofs — John Wickerson, Jonathan Julián Huerta y Munive, et al. · (2025) | TGRS Research Map | TGRS