What Happens to Software When Proof is Cheap? @uwcse
What Happens to Software When Proof is Cheap?  @uwcse
Uploaded April 2026 | Updated September 2026, 2 weeks ago
2025-26 Allen School Distinguished Lecture Series
Title: What Happens to Software When Proof is Cheap?
Speaker: Mike Dodds (Galois, Inc.)
Date: Thursday, April 16, 2026

Abstract: In July 2025, three AI systems independently achieved gold-medal standard at the International Math Olympiad. One of them, Harmonic's Aristotle, did it by constructing formal proofs in the Lean proof assistant. Six months later, several AIs working together used Lean to solve an open problem posed by Paul Erdős. We may soon live in a strange world where AI is better at math than any human expert.

Lean and tools like it bridge two worlds: mathematicians use them to formalise theorems, but engineers use them to prove that code behaves correctly. This second use, formal verification, has a long history and a few notable successes in cryptography, operating systems, and parser security. But these successes have always been limited by the sheer difficulty of the mathematical reasoning they require.

Now, AI may be changing this picture. If mathematical reasoning is cheap, we could eliminate entire classes of bugs from systems at scale, guarantee that safety-critical code behaves as intended, or verify auto-generated code as fast as it is written. Our need for rigorous verification is growing just as the cost of doing so may be dropping.

The most important software in need of verification may be AI systems themselves. These are growing more capable and more opaque, and we are granting them increasing power over consequential decisions. The same advances making mathematical proof cheaper may also be creating the systems that most urgently need to be proved safe.

Bio: Mike Dodds is a Principal Scientist at Galois, Inc., an employee-owned research company in Portland, OR. Galois builds formal methods and security technologies for clients including DARPA and AWS. Mike's work focuses on making formal verification practical: he led the verification of core cryptographic code in the AWS-LibCrypto library, built reference PDF parsers for the PDF Association, and developed tools for translating legacy C code into Rust. Before Galois, he held academic positions at the University of Cambridge and the University of York, where he worked on separation logic, concurrency, and hardware memory models. He holds a PhD from York.

This video is closed captioned.
What Happens to Software When Proof is Cheap?[Audio Descriptions] I Am CSE: Melanie SclarFrom Code Generation Towards Software Engineering–Yangruibo Ding (Columbia University)Data Science for Human Well-Being: Tim Althoff (Allen School)IFDS Workshop–Principled Memorization Measurement in Foundation ModelsTowards Planning in Creative Contexts–Alexander Spangher (USC)[ASL] Toward Total Scene Understanding for Autonomous Driving—Drago Anguelov (Waymo)Open the Paths: Amazon India Commute On-Demand ReviewComputer Security and Privacy for Existing and Emerging Technologies: Franzi Roesner (Allen School)Accelerating Science with AIA Dogged Pursuit For Satisfaction–Ryan Williams (MIT CSAIL)2024 Winter Robotics Colloquium: Matt Barnes (Google Research)
Paul G. Allen School |

What Happens to Software When Proof is Cheap?

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER