SPLASH 2025
Sun 12 - Sat 18 October 2025 Singapore
co-located with ICFP/SPLASH 2025

This program is tentative and subject to change.

Sat 18 Oct 2025 17:15 - 17:30 at Orchid Small - TOPLAS and Remote

Interactive theorem provers, or proof assistants, are important tools across many areas of computer science and mathematics, but even experts find them challenging to use effectively. To improve their design, we need a deeper, user-centric, understanding of proof assistant usage.

We present the results of an observation study of proof assistant users. We use contextual inquiry methodology, observing 30 participants doing their everyday work in Coq and Lean. We qualitatively analyze their experiences to surface four observations: that proof writers iterate on their proofs by reacting to and incorporating feedback from the proof assistant; that proof progress often involves challenging conversations with the proof assistant; that proofs are constructed in consultation with a wide array of external resources; and that proof writers are guided by design considerations that go beyond simply “getting to QED.” Our documentation and analysis of these four themes clarifies what proof work really looks like with current tools as well as potential design opportunities that tool builders and researchers should consider when working to improve the usability of proof assistants.

This program is tentative and subject to change.

Sat 18 Oct

Displayed time zone: Perth change

16:00 - 17:30
TOPLAS and RemoteOOPSLA at Orchid Small
16:00
15m
Talk
(TOPLAS) Polynomial Bounds of CFLOBDDs against BDDs
OOPSLA
Xusheng Zhi , Thomas Reps University of Wisconsin-Madison
DOI
16:15
15m
Talk
(TOPLAS) Type-Safe Compilation of Dynamic Inheritance via Merging
OOPSLA
Yaozhu Sun National Institute of Informatics, Xuejing Huang IRIF, Bruno C. d. S. Oliveira University of Hong Kong
16:30
15m
Talk
Detecting and explaining (in-)equivalence of context-free grammars
OOPSLA
Marko Schmellenkamp Ruhr University Bochum, Thomas Zeume Ruhr University Bochum, Sven Argo Ruhr University Bochum, Sandra Kiefer University of Oxford, Cedric Siems Ruhr University Bochum, Fynn Stebel Ruhr University Bochum
16:45
15m
Talk
Modal Abstractions for Virtualizing Memory Addresses
OOPSLA
Ismail Kuru Drexel University, Colin Gordon Drexel University
17:00
15m
Talk
Agora: Trust Less and Open More in Verification for Confidential Computing
OOPSLA
Hongbo Chen Indiana University Bloomington, Quan Zhou Penn State University, Sen Yang Yale University, Dang Sixuan Duke University, Xing Han The Hong Kong University of Science and Technology, Danfeng Zhang Duke University, Fan Zhang Yale University, XiaoFeng Wang Nanyang Technological University
17:15
15m
Talk
QED in Context: An Observation Study of Proof Assistant Users
OOPSLA
Jessica Shi University of Pennsylvania, Cassia Torczon University of Pennsylvania, Harrison Goldstein University at Buffalo, the State University of New York at Buffalo, Benjamin C. Pierce University of Pennsylvania, Andrew Head University of Pennsylvania