POPL 2025
Sun 19 - Sat 25 January 2025 Denver, Colorado, United States
VenueCurtis Hotel Denver
Room nameMarco Polo
Floor3
Capacity450
Room InformationNo extra information available
Program

This program is tentative and subject to change.

You're viewing the program in a time zone which is different from your device's time zone change time zone

Mon 20 Jan

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

09:00 - 10:30
Session 1CPP at Marco Polo
Chair(s): Nicolas Tabareau Inria
09:00
60m
Keynote
Prospects for Computer Formalization of Infinite-Dimensional Category Theory
CPP
Emily Riehl Johns Hopkins University
10:00
30m
Talk
Certifying rings of integers in number fieldsdistinguished paper
CPP
Anne Baanen Vrije Universiteit Amsterdam, Alain Chavarri Villarello Vrije Universiteit Amsterdam, Sander R. Dahmen Vrije Universiteit Amsterdam
11:00 - 12:30
Session 2CPP at Marco Polo
Chair(s): Jennifer Paykin Intel
11:00
30m
Talk
Split Decisions: Explicit Contexts for Substructural Languagesdistinguished paper
CPP
Daniel Zackon McGill University, Chuta Sano McGill University, Alberto Momigliano Università degli Studi di Milano, Brigitte Pientka McGill University
11:30
30m
Talk
Machine Checked Proofs and Programs in Algebraic Combinatorics
CPP
Florent Hivert Univ. Paris-Saclay, LISN, LMF, CNRS, INRIA
12:00
30m
Talk
Monadic interpreters for concurrent memory models: Executable semantics of a concurrent subset of LLVM IRremote presentation
CPP
Nicolas Chappe Inria Lyon, LIP, Ludovic Henrio University of Lyon - ENS Lyon - UCBL - CNRS - Inria - LIP, Yannick Zakowski Inria
14:00 - 15:30
Session 3CPP at Marco Polo
Chair(s): Yasuhiko Minamide Tokyo Institute of Technology
14:00
30m
Talk
An Isabelle formalization of co-rewrite pairs for non-reachability in conditional rewriting
CPP
Dohan Kim University of Innsbruck, Teppei Saito Japan Advanced Institute of Science and Technology, Japan, René Thiemann University of Innsbruck, Akihisa Yamada National Institute of Informatics
14:30
30m
Talk
Intrinsically Correct Sorting in Cubical Agda
CPP
Cass Alexandru RPTU Kaiserslautern-Landau, Vikraman Choudhury Università di Bologna & Inria OLAS, Jurriaan Rot Radboud University Nijmegen, Niels van der Weide Radboud University
15:00
30m
Talk
Formalizing Simultaneous Critical Pairs for Confluence of Left-Linear Rewrite Systems
CPP
Christina Kirk University of Innsbruck, Aart Middeldorp University of Innsbruck
16:00 - 17:30
Session 4CPP at Marco Polo
16:00
30m
Talk
Formalized Burrows-Wheeler Transform
CPP
Louis Cheung University of Melbourne, Alistair Moffat The University of Melbourne, Christine Rizkallah University of Melbourne
16:30
30m
Talk
Verified and Efficient Matching of Regular Expressions with Lookaroundremote presentation
CPP
Agnishom Chattopadhyay Rice University, Wu Angela Li Rice University, Konstantinos Mamouras Rice University
17:00
30m
Talk
Further Tackling Post Correspondence Problem and Proof Generation
CPP
Akihiro Omori Department of Mathematical and Computing Science, Tokyo Institute of Technology, Yasuhiko Minamide Tokyo Institute of Technology

Tue 21 Jan

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

09:00 - 10:30
Session 5CPP at Marco Polo
Chair(s): Sandrine Blazy University of Rennes
09:00
60m
Keynote
CRIS: The power of imagination in specification and verification
CPP
A: Chung-Kil Hur Seoul National University
10:00
30m
Talk
The Nextgen Modality: A Modality for Non-Frame-Preserving Updates in Separation Logicdistinguished paper
CPP
Simon Friis Vindum Aarhus University, Aina Linn Georges Max Planck Institute for Software Systems (MPI-SWS), Lars Birkedal Aarhus University
11:00 - 12:30
Session 6CPP at Marco Polo
11:00
30m
Talk
Leakage-Free Probabilistic Jasmin Programs
CPP
Denis Firsov Tallinn University of Technology, Tiago Oliveira SandboxAQ, José Bacelar Almeira University of Minho & INESC TEC, Dominique Unruh RWTH Aachen
11:30
30m
Talk
Formally verified hardening of C programs against hardware fault injection
CPP
Basile Pesin Ecole Nationale de l'Aviation Civile (ENAC), Sylvain Boulmé Université Grenoble Alpes - CNRS - Grenoble INP - Verimag, David Monniaux CNRS, Marie-Laure Potet Univ. Grenoble Alpes, CNRS, Grenoble INP, VERIMAG
Pre-print
12:00
30m
Talk
CertiCoq-Wasm: A verified WebAssembly backend for CertiCoq
CPP
Wolfgang Meier Aarhus University, Martin Jensen Aarhus University, Jean Pichon-Pharabod Aarhus University, Bas Spitters Aarhus University
14:00 - 15:30
Session 7CPP at Marco Polo
14:00
30m
Talk
Nominal Matching Logic With Fixpoints
CPP
James Cheney University of Edinburgh, Maribel Fernandez King's College London, Mircea Sebe UIUC
14:30
30m
Talk
Tactic Script Optimisation for Aesop
CPP
Jannis Limperg University of Munich (LMU)
15:00
30m
Talk
An Isabelle/HOL Framework for Synthetic Completeness Proofs
CPP
Asta Halkjær From University of Copenhagen
16:00 - 17:30
Session 8CPP at Marco Polo
16:00
30m
Talk
Formalization of Differential Privacy in Isabelle/HOL
CPP
Tetsuya Sato Tokyo Institute of Technology, Yasuhiko Minamide Tokyo Institute of Technology
16:30
30m
Talk
A CHERI C Memory Model for Verified Temporal Safety
CPP
Vadim Zaliva University of Cambridge, UK, Kayvan Memarian University of Cambridge, Brian Campbell University of Edinburgh, Ricardo Almeida University of Edinburgh, Nathaniel Filardo University of Cambridge, Ian Stark The University of Edinburgh, Peter Sewell University of Cambridge
17:00
30m
Talk
Formalizing the One-way to Hiding Theorem
CPP
Katharina Heidler Technical University Munich, Dominique Unruh RWTH Aachen

Wed 22 Jan

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

10:40 - 12:00
Automata and Temporal PropertiesPOPL at Marco Polo
10:40
20m
Talk
Coinductive Proofs for Temporal Hyperliveness
POPL
Arthur Correnson CISPA Helmholtz Center for Information Security, Bernd Finkbeiner CISPA Helmholtz Center for Information Security
11:00
20m
Talk
Derivative-Guided Symbolic Execution
POPL
Yongwei Yuan Purdue University, Zhe Zhou Purdue University, Julia Belyakova Purdue University, Suresh Jagannathan Purdue University
11:20
20m
Talk
Symbolic Automata: omega-Regularity Modulo Theories
POPL
Margus Veanes Microsoft Research, Thomas Ball Microsoft Research, Gabriel Ebner Microsoft Research, Ekaterina Zhuchko Tallinn University of Technology
11:40
20m
Talk
Translation of Temporal Logic for Efficient Infinite-State Reactive Synthesis
POPL
Philippe Heim CISPA Helmholtz Center for Information Security, Rayna Dimitrova CISPA Helmholtz Center for Information Security
Pre-print
13:20 - 14:20
Quantum Computing 1POPL at Marco Polo
13:20
20m
Talk
Linear and non-linear relational analyses for Quantum Program Optimization
POPL
Matthew Amy Simon Fraser University, Joseph Lunderville Simon Fraser University
13:40
20m
Talk
Automating equational proofs in Dirac notation
POPL
Yingte Xu MPI-SP and Institute of Software, Chinese Academy of Sciences, Gilles Barthe MPI-SP; IMDEA Software Institute, Li Zhou Institute of Software, Chinese Academy of Sciences
14:00
20m
Talk
Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages
POPL
Andrea Colledan University of Bologna & INRIA Sophia Antipolis, Ugo Dal Lago University of Bologna & INRIA Sophia Antipolis
15:00 - 16:20
Probabilistic Programming 1POPL at Marco Polo
15:00
20m
Talk
A quantitative probabilistic relational Hoare logic
POPL
Martin Avanzini Inria, Gilles Barthe MPI-SP; IMDEA Software Institute, Benjamin Gregoire INRIA, Davide Davoli Université Côte d’Azur, Inria
15:20
20m
Talk
Approximate Relational Reasoning for Higher-Order Probabilistic Programs
POPL
Philipp G. Haselwarter Aarhus University, Kwing Hei Li Aarhus University, Alejandro Aguirre Aarhus University, Simon Oddershede Gregersen New York University, Joseph Tassarotti New York University, Lars Birkedal Aarhus University
Pre-print
15:40
20m
Talk
Compositional imprecise probability: a solution from graded monads and Markov categories
POPL
Jack Liell-Cock University of Oxford, Sam Staton University of Oxford
16:00
20m
Talk
Sound and Complete Proof Rules for Probabilistic Termination
POPL
17:00 - 18:00
TOPLASPOPL at Marco Polo

Thu 23 Jan

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

10:40 - 12:00
Probabilistic Programming 2POPL at Marco Polo
10:40
20m
Talk
Inference Plans for Hybrid Particle Filtering
POPL
Ellie Y. Cheng MIT, Eric Atkinson , Guillaume Baudart Inria, Louis Mandel IBM Research, USA, Michael Carbin Massachusetts Institute of Technology
11:00
20m
Talk
Guaranteed Bounds on Posterior Distributions of Discrete Probabilistic Programs with Loops
POPL
Fabian Zaiser University of Oxford, Andrzej Murawski University of Oxford, C.-H. Luke Ong NTU
Pre-print
11:20
20m
Talk
Modelling Recursion and Probabilistic Choice in Guarded Type Theory
POPL
Philipp Stassen Aarhus University, Rasmus Ejlers Møgelberg IT University of Copenhagen, Maaike Annebet Zwart IT University of Copenhagen, Alejandro Aguirre Aarhus University, Lars Birkedal Aarhus University
11:40
20m
Talk
Bluebell: An Alliance of Relational Lifting and Independence For Probabilistic Reasoning
POPL
Jialu Bao Cornell University, Emanuele D'Osualdo University of Konstanz, Azadeh Farzan University of Toronto
13:20 - 14:20
Decision ProceduresPOPL at Marco Polo
13:20
20m
Talk
The Decision Problem for Regular First Order Theories
POPL
Umang Mathur National University of Singapore, David Mestel Maastricht University, Mahesh Viswanathan University of Illinois at Urbana-Champaign
13:40
20m
Talk
A Primal-Dual Perspective on Program Verification Algorithms
POPL
Takeshi Tsukada Chiba University, Hiroshi Unno Tohoku University, Oded Padon Weizmann Institute of Science, Sharon Shoham Tel Aviv University
14:00
20m
Talk
Dis/Equality Graphs
POPL
George Zakhour University of St. Gallen, Pascal Weisenburger University of St. Gallen, Jahrim Gabriele Cesario University of St. Gallen, Guido Salvaneschi University of St. Gallen
17:00 - 17:40
Quantum Computing 2POPL at Marco Polo
17:00
20m
Talk
Qurts: Automatic Quantum Uncomputation by Affine Types with Lifetime
POPL
Kengo Hirata University of Edinburgh, Chris Heunen University of Edinburgh
17:20
20m
Talk
Verifying Quantum Circuits with Level-Synchronized Tree Automata
POPL
Parosh Aziz Abdulla Uppsala University, Sweden, Yo-Ga Chen Academia Sinica, Yu-Fang Chen Academia Sinica, Lukáš Holík Brno University of Technology, Ondřej Lengál Brno University of Technology, Jyun-Ao Lin National Taipei University of Technology, Fang-Yi Lo Academia Sinica, Wei-Lun Tsai Academia Sinica

Fri 24 Jan

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

10:40 - 12:00
Synthesis and CompilationPOPL at Marco Polo
10:40
20m
Talk
MimIR: An Extensible and Type-Safe Intermediate Representation for the DSL Age
POPL
Roland Leißa University of Mannheim, School of Business Informatics and Mathematics, Marcel Ullrich Saarland University, Joachim Meyer Compiler Design Lab; Saarland Informatics Campus; Saarland University, Sebastian Hack Saarland University, Saarland Informatics Campus
11:00
20m
Talk
Simple Linear Loops: Algebraic Invariants and Applications
POPL
Rida Ait El Manssour CNRS & IRIF, Paris, George Kenison Liverpool John Moores University, Mahsa Shirmohammadi CNRS & IRIF, Paris, Anton Varonka TU Wien
11:20
20m
Talk
Automated Program Refinement: Guide and Verify Code Large Language Model with Refinement Calculus
POPL
Yufan Cai National University of Singapore, Zhe Hou Griffith University, David Sanan Nanyang Technological University, Singapore, Xiaokun Luan Peking University, Yun Lin Shanghai Jiao Tong University, Jun Sun Singapore Management University, Jin Song Dong National University of Singapore
11:40
20m
Talk
Tail Modulo Cons, OCaml, and Relational Separation Logic
POPL
Clément Allain INRIA, Frédéric Bour Tarides, Basile Clément OCamlPro, François Pottier Inria, Gabriel Scherer Université Paris Cité - Inria - CNRS
13:20 - 14:20
Verification 2POPL at Marco Polo
13:20
20m
Talk
Archmage and CompCertCast: End-to-End Verification Supporting Integer-Pointer Casting
POPL
Yonghyun Kim Seoul National University, South Korea, Minki Cho Seoul National University, Jaehyung Lee Seoul National University, Jinwoo Kim Seoul National University, Taeyoung Yoon Seoul National University, Youngju Song MPI-SWS, Chung-Kil Hur Seoul National University
13:40
20m
Research paper
Formalising Graph Algorithms with Coinduction
POPL
Donnacha Oisín Kidney Imperial College London, Nicolas Wu Imperial College London
Pre-print
14:00
20m
Talk
VeriRT: An End-To-End Verification Framework for Real-Time Distributed Systems
POPL
Yoonseung Kim Yale University, Sung-Hwan Lee Seoul National University, Yonghyun Kim Seoul National University, South Korea, Chung-Kil Hur Seoul National University
15:00 - 16:20
Concurrency 2POPL at Marco Polo
15:00
20m
Talk
Flo: a Semantic Foundation for Progressive Stream Processing
POPL
Shadaj Laddad University of California at Berkeley, Alvin Cheung University of California at Berkeley, Joseph M. Hellerstein UC Berkeley, Mae Milano Princeton University
Pre-print
15:20
20m
Talk
Top-Down or Bottom-Up? Complexity Analyses of Synchronous Multiparty Session Types
POPL
Thien Udomsrirungruang University of Oxford, Nobuko Yoshida University of Oxford
15:40
20m
Talk
Semantic Logical Relations for Timed Message-Passing Protocols
POPL
Yue Yao Carnegie Mellon University, Grant Iraci University at Buffalo, Cheng-En Chuang University at Buffalo, Stephanie Balzer Carnegie Mellon University, Lukasz Ziarek University at Buffalo
16:00
20m
Talk
Reachability Analysis of the Domain Name System
POPL
Dhruv Nevatia ETH Zurich, Si Liu ETH Zurich, David Basin ETH Zurich
17:00 - 18:00
Speculative ExecutionPOPL at Marco Polo
17:00
20m
Talk
Do You Even Lift? Strengthening Compiler Security Guarantees Against Spectre Attacks
POPL
Xaver Fabian CISPA, Marco Patrignani University of Trento, Marco Guarnieri IMDEA Software Institute, Michael Backes Cispa Helmholtz Center for Information Security
17:20
20m
Talk
Preservation of speculative constant-time by compilation
POPL
Santiago Arranz Olmos Max Planck Institute for Security and Privacy, Gilles Barthe MPI-SP; IMDEA Software Institute, Lionel Blatter Max Planck Institute for Security and Privacy, Benjamin Gregoire INRIA, Vincent Laporte Inria
17:40
20m
Talk
SNIP: Speculative Execution and Non-Interference Preservation for Compiler Transformations
POPL
Sören van der Wall PhD Student, Roland Meyer TU Braunschweig

Mon 20 Jan

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

Room9:003010:003011:003012:003013:003014:003015:003016:003017:0030
Marco Polo

Tue 21 Jan

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

Room9:003010:003011:003012:003013:003014:003015:003016:003017:0030
Marco Polo

Wed 22 Jan

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

Thu 23 Jan

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

Fri 24 Jan

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