Thu 27 Aug 2026 11:06 - 11:24 at IP126 Auditorium - Program Analysis Chair(s): Ben Greenman

The widespread adoption of AI-assisted coding is directly proportional to an increase in software bugs; can AI-assisted formal verification help reduce bugs at a comparable scale? In this experience report we give an anecdotal account of AI agents, equipped with a CLI and a proof assistant, producing thousands of lines of machine-checked code. We detail our experience across different proof-engineering tasks: implementing verified data structures for a standard library, translating unverified code into a formal language while inferring its specification, and porting and refactoring existing proofs to new frameworks. We present the techniques that made agentic proof-oriented programming (PoP) effective—or ineffective—and characterize the role of the human expert, whose contribution reduces to providing natural-language problem descriptions, reviewing auto-generated specifications, and occasionally supplying a key invariant. Our findings suggest that this division of labor can provide unprecedented leverage to a human expert in the loop and that agentic PoP has crossed the threshold of practical usefulness.

Thu 27 Aug

Displayed time zone: Eastern Time (US & Canada) change

10:48 - 12:00
Program AnalysisICFP Papers at IP126 Auditorium
Chair(s): Ben Greenman University of Utah
10:48
18m
Talk
Machine-Generated, Machine-Checked Proofs for a Verified Compiler (Experience Report)
ICFP Papers
Zoe Paraskevopoulou National Technical University of Athens
DOI
11:06
18m
Talk
Proofs Promptly: Proof-Oriented Programming with AI Agents (Experience Report)Remote
ICFP Papers
Eleftherios Ioannidis Microsoft Research, Nikhil Swamy Microsoft Research, Gabriel Ebner Microsoft Research, Matthai Philipose Microsoft Research, Tahina Ramananandro Microsoft Research
DOI
11:24
18m
Talk
Programming Backpropagation with Reverse Handlers for Arrows
ICFP Papers
Takahiro Sanada Fukui Prefectural University, Keisuke Hoshino Research Institute for Mathematical Sciences, Kyoto University, Kenshin Hirai Research Institute for Mathematical Sciences, Kyoto University, Shin-ya Katsumata Kyoto Sangyo University
DOI
11:42
18m
Talk
On Recursion in Graded Modal Type Theory
ICFP Papers
Oskar Eriksson Department of Computer Science and Engineering, University of Gothenburg and Chalmers University of Technology, Gothenburg, Sweden, Andreas Abel Gothenburg University, Nils Anders Danielsson University of Gothenburg
DOI