POPL 2026
Sun 11 - Sat 17 January 2026 Rennes, France

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

Sun 11 Jan

Displayed time zone: Brussels, Copenhagen, Madrid, Paris change

09:00 - 10:30
KeynoteDafny at Horizons
09:00
12m
Day opening
Day opening
Dafny
Stefan Zetzsche Amazon Web Services, Yannick Moy ANSSI
09:12
60m
Keynote
Software Verification meets Real-World Cryptography
Dafny
Karthikeyan Bhargavan Cryspen, France
10:12
18m
Talk
The Design of an Interactive Proof Mode for Dafny
Dafny
Ștefan Ciobâcă Alexandru Ioan Cuza University of Iasi, K. Rustan M. Leino Amazon, Ștefan Mercaș Alexandru Ioan Cuza University, Iasi, Romania, Roxana-Mihaela Timon Alexandru Ioan Cuza University, Iasi, Romania
09:00 - 10:30
Creusot: Formal verification of Rust programsTutorials at Salle 12
09:00
90m
Tutorial
Creusot: Formal verification of Rust programs
Tutorials
Li-yao Xia LMF, Inria, Université Paris-Saclay, Jacques-Henri Jourdan LMF, CNRS, Université Paris-Saclay, Arnaud Golfouse Université Paris-Saclay, CNRS, ENS Paris-Saclay, Inria, Laboratoire des méthodes formelles, 91190, Gif-sur-Yvette, France, Vincent Lafeychine Université Paris-Saclay, CNRS, ENS Paris-Saclay, INRIA, Laboratoire Méthodes Formelles, 91190, Gif-sur-Yvette, France.
Media Attached
09:00 - 10:30
First SessionLAFI at Salle 13
Chair(s): Alexander K. Lew Yale University
09:00
5m
Day opening
Welcome
LAFI
Hugo Paquet Inria, École Normale Supérieure, Alexander K. Lew Yale University
09:07
20m
Industry talk
Basis — A Programming Languages Take on Principled Foundations for AI
LAFI
09:29
10m
Talk
Towards an Equational Calculus of Interventions
LAFI
Shubh Agrawal Northeastern University, Jialu Bao Northeastern University, Steven Holtzen Northeastern University
Pre-print
09:41
10m
Talk
Typed Abstractions for Causal Probabilistic Programming
LAFI
Theo Wang University of Cambridge, University of Oxford, Dario Stein University of Oxford, Eli Bingham Broad Institute, Jack Feser Basis, Ohad Kammar University of Edinburgh, Michael Lee University of Cambridge, UK, Jeremy Yallop University of Cambridge
File Attached
09:53
10m
Talk
A Design for Massively Parallel Gibbs Sampling on the GPU via Static and Dynamic Analysis of Probabilistic Programs
LAFI
Matin Ghavami Massachusetts Institute of Technology, Martin C. Rinard Massachusetts Institute of Technology, Vikash Mansinghka Massachusetts Institute of Technology
10:05
10m
Talk
A Design Proposal for GraPPL: Probabilistic Programming with Low-Level, High-Performance GPU Programmable Inference
LAFI
Karen Chung Massachusetts Institute of Technology, Elias Rojas Collins MIT, McCoy Reynolds Becker MIT, Mathieu Huot MIT, Vikash Mansinghka Massachusetts Institute of Technology
09:00 - 10:30
BINSEC: Adapting Symbolic Execution for Binary-level SecurityTutorials at Salle 14
09:00
90m
Tutorial
BINSEC: Adapting Symbolic Execution for Binary-level Security
Tutorials
Sébastien Bardin CEA LIST, University Paris-Saclay, Frédéric Recoules CEA, List, Yanis Sellami CEA, List, Univ. Grenoble Alpes
09:00 - 10:00
KeynotePriSC at Salle 19
Chair(s): Marco Vassena Utrecht University
09:00
5m
Day opening
Day opening
PriSC

09:05
55m
Keynote
The V8 Sandbox: From Compiler Correctness to Runtime Containment
PriSC
10:00 - 10:30
Information Flow ControlPriSC at Salle 19
Chair(s): David Monniaux Université Grenoble Alpes - CNRS - Grenoble INP - Verimag
10:30 - 11:00
10:30
30m
Coffee break
Break
POPL Catering

11:00 - 12:30
Development of Auto-Active VerifiersDafny at Horizons
11:00
18m
Talk
Diagnostics in Probabilistic Program Verification
Dafny
Philipp Schröer RWTH Aachen University, Darion Haase RWTH Aachen University, Joost-Pieter Katoen RWTH Aachen University
11:18
18m
Talk
Explicit Abstraction Barrier for Autoactive Verification
Dafny
Paul Patault Université Paris-Saclay - Laboratoire de Méthodes Formelles
Pre-print
11:36
18m
Talk
Managing the Proof Context in SPARK
Dafny
Claire Dross AdaCore, Joffrey Huguet AdaCore, Johannes Kanig AdaCore
File Attached
11:54
18m
Talk
Tunable Automation in Automated Program Verification
Dafny
Alexander Bai New York University, Chris Hawblitzel Microsoft Research, Andrea Lattuada VMware Research
Pre-print
12:12
18m
Talk
Velvet: A Multi-Modal Verifier for Effectful Programs
Dafny
Vladimir Gladshtein , George Pîrlea National University of Singapore, Qiyuan Zhao National University of Singapore, Vitaly Kurin Neapolis University Pafos, Ilya Sergey National University of Singapore
Pre-print
11:00 - 12:30
Creusot: Formal verification of Rust programsTutorials at Salle 12
11:00
90m
Tutorial
Creusot: Formal verification of Rust programs
Tutorials
Li-yao Xia LMF, Inria, Université Paris-Saclay, Jacques-Henri Jourdan LMF, CNRS, Université Paris-Saclay, Arnaud Golfouse Université Paris-Saclay, CNRS, ENS Paris-Saclay, Inria, Laboratoire des méthodes formelles, 91190, Gif-sur-Yvette, France, Vincent Lafeychine Université Paris-Saclay, CNRS, ENS Paris-Saclay, INRIA, Laboratoire Méthodes Formelles, 91190, Gif-sur-Yvette, France.
Media Attached
11:00 - 12:30
Second SessionLAFI at Salle 13
Chair(s): Hugo Paquet Inria, École Normale Supérieure
11:00
55m
Keynote
A Welcome to Causal Probabilistic Programming
LAFI
11:56
10m
Talk
Verifying Sampling Algorithms via Distributional Invariants
LAFI
Daniel Zilken , Tobias Winkler RWTH Aachen University, Kevin Batz RWTH Aachen University, Joost-Pieter Katoen RWTH Aachen University
Media Attached File Attached
12:08
10m
Talk
Sequential Monte Carlo Program Synthesis with Refinement Proposals
LAFI
Maddy Bowers Massachusetts Institute of Technology, Mauricio Barba da Costa MIT, Xiaoyan Wang Massachusetts Institute of Technology, Joshua B. Tenenbaum Massachusetts Institute of Technology, Vikash Mansinghka Massachusetts Institute of Technology, Armando Solar-Lezama Massachusetts Institute of Technology, Alexander K. Lew Yale University
12:20
10m
Talk
A Word Sampler for Well-Typed Functions
LAFI
Pre-print File Attached
11:00 - 12:30
BINSEC: Adapting Symbolic Execution for Binary-level SecurityTutorials at Salle 14
11:00
90m
Tutorial
BINSEC: Adapting Symbolic Execution for Binary-level Security
Tutorials
Sébastien Bardin CEA LIST, University Paris-Saclay, Frédéric Recoules CEA, List, Yanis Sellami CEA, List, Univ. Grenoble Alpes
11:00 - 12:30
Secure Compilation & VerificationPriSC at Salle 19
Chair(s): David Monniaux Université Grenoble Alpes - CNRS - Grenoble INP - Verimag
11:00
18m
Talk
Mind the Boundary: Detecting Undefined Behavior Across Rust’s FFI
PriSC
11:18
18m
Talk
Specifying ABIs with Realizability and Type-Preserving Compilation
PriSC
Brianna Marshall Northeastern University, Ryan Doenges Boston College, Owen Duckham Northeastern University, Ari Prakash Northeastern University, Maxime Legoupil Aarhus University, Elan Semenova Northeastern University, Lars Birkedal Aarhus University, Amal Ahmed Northeastern University, USA
11:36
18m
Talk
Towards formally secure compilation of verified F* programs against unverified ML contexts
PriSC
Cezar-Constantin Andrici MPI-SP, Danel Ahman University of Ljubljana, Cătălin Hriţcu MPI-SP, Guido Martínez Microsoft Research, Abigail Pribisova MPI-SP and MPI-SWS, Exequiel Rivas Tallinn University of Technology; Ahrefs, Théo Winterhalter INRIA
11:54
18m
Talk
Blame-aware Recomposition for Formally Secure Low-level Compiler Backends
PriSC
12:12
18m
Talk
WP-Preserving Compilation -- Preserving Weakest Preconditions For End-to-End Verification
PriSC
Carmine Abate Barkhausen Institute, Dresden, Mohamed Elsheikh Barkhausen Institute, Dresden, Kleio Liotati Barkhausen Institute, Dresden, Frantisek Farka Barkhausen Institute, Dresden, Sebastian Ertel Barkhausen Institute, Dresden
12:30 - 14:00
12:30
90m
Lunch
Lunch
POPL Catering

14:00 - 15:30
Applications and Lessons LearnedDafny at Horizons
14:00
18m
Talk
Lessons from Building an Auto-Active Verifier in Lean
Dafny
George Pîrlea National University of Singapore, Vladimir Gladshtein , Qiyuan Zhao National University of Singapore, Ilya Sergey National University of Singapore
Pre-print
14:18
18m
Talk
Formal Verification of Minimax Algorithms
Dafny
Wieger Wesselink Eindhoven University of Technology, Kees Huizing Eindhoven University of Technology, Huub van de Wetering Eindhoven University of Technology
File Attached
14:36
18m
Talk
Teaching Automata Theory and Formal Languages with Dafny
Dafny
Pre-print
14:54
18m
Talk
Verification of E-Voting Algorithms in Dafny
Dafny
Robert Büttner University of Regensburg, Fabian Franz Dießl University of Regensburg, Patrick Janoschek University of Regensburg, Ivana Kostadinovic University of Regensburg, Henrik Oback University of Regensburg, Kilian Voß University of Regensburg, Franziska Alber University of Regensburg, Roland Herrmann University of Regensburg, Sibylle Möhle University of Regensburg, Philipp Rümmer University of Regensburg and Uppsala University
Pre-print
15:12
18m
Talk
A Correct-by-Construction Checker for Validation of Railway Data
Dafny
Benoît Boyer Mitsubishi Electric R&D Centre Europe, Rennes, France, Noé Canva Inria Saclay & Université Paris-Saclay, Matteo Manighetti IRIF, Université Paris Cité, Claude Marché Inria Saclay & Université Paris-Saclay
Link to publication
14:00 - 15:30
Verifying Probabilistic Programs Using Separation LogicTutorials at Salle 12
14:00
90m
Tutorial
Verifying Probabilistic Programs Using Separation Logic
Tutorials
Alejandro Aguirre Aarhus University, Simon Oddershede Gregersen CISPA Helmholtz Center for Information Security, Philipp G. Haselwarter Aarhus University
Link to publication
14:00 - 15:30
Third SessionLAFI at Salle 13
Chair(s): Cameron Freer Massachusetts Institute of Technology
14:00
10m
Talk
Towards Compiling Higher-Order Programs to Bayesian Networks
LAFI
Claudia Faggian CNRS, Université Paris Cité, Gabriele Vanoni IRIF, Université Paris Cité
14:12
10m
Talk
On Contextual Distances in Randomized Programming: Amplification and Lower Bounds
LAFI
14:24
10m
Talk
Nominal Semantics for First-class Automatic Differentiation
LAFI
Jack Czenszak Yale University, Alexander K. Lew Yale University
14:36
10m
Talk
Semantic Foundations for Laziness in Discrete Probabilistic Programming
LAFI
Simon Castellan University of Rennes; Inria; CNRS; IRISA, Tom Hirschowitz Univ. Grenoble Alpes, Univ. Savoie Mont Blanc, CNRS, LAMA, 73000 Chambéry, Hugo Paquet Inria, École Normale Supérieure
14:48
10m
Talk
Incremental Density Computation for Efficient Programmable Inference
LAFI
Fabian Zaiser MIT, Vikash Mansinghka Massachusetts Institute of Technology, Alexander K. Lew Yale University
15:00
10m
Talk
Generating Functions Meet Occupation Measures: Invariant Synthesis for Probabilistic Loops
LAFI
Kevin Batz , Adrian Gallus RWTH Aachen University, Darion Haase RWTH Aachen University, Benjamin Lucien Kaminski Saarland University; University College London, Joost-Pieter Katoen RWTH Aachen University, Lutz Klinkenberg RWTH Aachen University, Tobias Winkler RWTH Aachen University
15:12
10m
Talk
Probabilistic Programming Meets Automata Theory: Exact Inference using Weighted Automata
LAFI
Dominik Geißler Technische Universität Berlin, Tobias Winkler RWTH Aachen University
File Attached
14:00 - 15:30
Discrete and continuous models for concurrent systemsTutorials at Salle 14
14:00
90m
Tutorial
Discrete and Continuous Models for Concurrent Systems: From Petri Nets to Directed Spaces
Tutorials
Uli Fahrenberg Université Paris-Saclay, CNRS, ENS Paris-Saclay, LMF
14:00 - 15:30
Timing Side ChannelsPriSC at Salle 19
Chair(s): Cătălin Hriţcu MPI-SP
14:00
18m
Talk
Efficient Dependency Resolution in IFC-aware Decentralized Programming
PriSC
Steffan Sølvsten Aarhus University, Aslan Askarov Aarhus University
14:18
18m
Talk
Tooling Design and Lessons Learned from Systematic Evaluations of the Preservation of Low-level Security Properties by Compilers with BinSec
PriSC
Yanis Sellami CEA, List, Univ. Grenoble Alpes, Frédéric Recoules CEA, List, Sébastien Bardin CEA LIST, University Paris-Saclay
14:36
18m
Talk
Decompiling for Constant-Time Analysis
PriSC
Sören van der Wall TU Braunschweig, 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, Youcef Bouzid , Zhiyuan Zhang
14:54
18m
Talk
Modular Verification of Probabilistic Constant-Time
PriSC
Xingyu Xie MPI-SP
15:12
18m
Talk
GnuZero: A Compiler-Based Zeroization Static Detection Tool for the Masses
PriSC
Pierrick Philippe Univ Rennes, CNRS, IRISA, Mohamed Sabt Univ Rennes, CNRS, IRISA, Pierre-Alain Fouque Univ Rennes, CNRS, IRISA
15:30 - 16:00
15:30
30m
Coffee break
Break
POPL Catering

16:00 - 18:00
LLMs in Auto-Active VerificationDafny at Horizons
16:00
18m
Talk
ATLAS: Automated Toolkit for Large-Scale Verified Code Synthesis
Dafny
Mantas Bakšys University of Cambridge, Stefan Zetzsche Amazon Web Services, Olivier Bouissou Amazon Web Services, Soonho Kong Amazon Web Services, Remi Delmas Amazon Web Services
Pre-print
16:18
18m
Talk
A benchmark for vericoding: formally verified program synthesis
Dafny
Sergiu Bursuc Beneficial AI Foundation, Theodore Ehrenborg Beneficial AI Foundation, Shaowei Lin Beneficial AI Foundation, Lăcrămioara Aștefănoaei Beneficial AI Foundation, Ionel Emilian Chiosa MIT, Jure Kukovec Beneficial AI Foundation, Alok Singh Beneficial AI Foundation, Oliver Butterley Beneficial AI Foundation, Adem Bizid MIT, Quinn Dougherty Beneficial AI Foundation, Miranda Zhao MIT, Max Tan MIT, Max Tegmark Massachusetts Institute of Technology
Pre-print File Attached
16:36
18m
Talk
DafnyPro: LLM-Assisted Automated Verification for Dafny Programs
Dafny
Debangshu Banerjee UIUC, Olivier Bouissou Amazon Web Services, Stefan Zetzsche Amazon Web Services
16:54
18m
Talk
MiniF2F-Dafny: LLM-Guided Mathematical Theorem Proving via Auto-Active Verification
Dafny
Mantas Bakšys University of Cambridge, Stefan Zetzsche Amazon Web Services, Olivier Bouissou Amazon Web Services
Pre-print
17:12
18m
Talk
Specification-Guided Repair of Arithmetic Errors in Dafny Programs using LLMs
Dafny
Valentina Wu Faculdade de Engenharia, Universidade do Porto, Alexandra Mendes Faculty of Engineering, University of Porto & INESC TEC, Alexandre Abreu INESC TEC, Faculdade de Engenharia, Universidade do Porto
17:30
18m
Talk
Toward Automated, Contamination-free Dafny Benchmark Generation
Dafny
Changjie Wang KTH Royal Institute of Technology, Mariano Scazzariello RISE Research Institutes of Sweden, Dejan Kostic KTH Royal Institute of Technology, Marco Chiesa KTH Royal Institute of Technology
Pre-print
17:48
12m
Day closing
Day closing
Dafny
Stefan Zetzsche Amazon Web Services, Yannick Moy ANSSI
16:00 - 17:30
Verifying Probabilistic Programs Using Separation LogicTutorials at Salle 12
16:00
90m
Tutorial
Verifying Probabilistic Programs Using Separation Logic
Tutorials
Alejandro Aguirre Aarhus University, Simon Oddershede Gregersen CISPA Helmholtz Center for Information Security, Philipp G. Haselwarter Aarhus University
Link to publication
16:00 - 18:00
Fourth SessionLAFI at Salle 13
Chair(s): Guillaume Baudart Inria
16:00
10m
Talk
Multi-Agent Systems for Traceable Bayesian Workflow
LAFI
Xianda Sun University of Cambridge, Andrew D. Gordon Cogna and University of Edinburgh, Hong Ge University of Cambridge
File Attached
16:12
10m
Talk
Grammar-Constrained LLM Generation for Reliable and Efficient Probabilistic Program Synthesis
LAFI
Madhav Kanda University of Illinois Urbana-Champaign, Shubham Ugare Meta, Sasa Misailovic University of Illinois at Urbana-Champaign
16:24
10m
Talk
Language-Model Probabilistic Programming for Improving Autoformalization via Cycle Consistency and Incremental Type-Checking
LAFI
Mauricio Barba da Costa MIT, Fabian Zaiser MIT, Katherine Collins MIT, Romir Patel MIT, Timothy O'Donnell , Alexander K. Lew Yale University, Joshua B. Tenenbaum Massachusetts Institute of Technology, Vikash K. Mansinghka Massachusetts Institute of Technology, Cameron Freer Massachusetts Institute of Technology
16:35
80m
Poster
Poster Session
LAFI

16:00 - 17:30
Discrete and continuous models for concurrent systemsTutorials at Salle 14
16:00
90m
Tutorial
Discrete and Continuous Models for Concurrent Systems: From Petri Nets to Directed Spaces
Tutorials
Uli Fahrenberg Université Paris-Saclay, CNRS, ENS Paris-Saclay, LMF
16:00 - 17:30
Hardware SecurityPriSC at Salle 19
Chair(s): Jérémy Thibault EPFL
16:00
18m
Talk
FSLH: Flexible Mechanized Speculative Load Hardening
PriSC
Jonathan Baumann MPI-SP, Roberto Blanco Max Planck Institute for Security and Privacy (MPI-SP), Léon Ducruet Aarhus University, Sebastian Harwig MPI-SP and Ruhr University Bochum, Cătălin Hriţcu MPI-SP
16:18
18m
Talk
Towards Robust Secure Compilation in Presence of Speculative Execution
PriSC
Léopold Clément Télécom Paris, Ulrich Kühne Télécom Paris, Florian Brandner Télécom Paris, Renaud Pacalet Télécom Paris
16:36
18m
Talk
Compiling countermeasures against fault attacks with “Tracing LLVM”
PriSC
Sébastien Michelland Université Grenoble-Alpes - Grenoble INP - LCIS, Christophe Deleuze Université Grenoble-Alpes - Grenoble INP - LCIS, Laure Gonnord Université Grenoble-Alpes - Grenoble INP - LCIS
File Attached
16:54
18m
Talk
Modular and automatic formal verification of a RISC-V processor with security mechanisms
PriSC
Pierre Wilke CentraleSupélec, Cyprien Jules CentraleSupélec, Inria, CNRS, Univ. Rennes, Guillaume Hiet CentraleSupélec, Inria, CNRS, Univ. Rennes
17:12
18m
Talk
Fun with flags: How Compilers Break and Fix Constant-Time Code
PriSC
Antoine Geimer Univ. Lille, CNRS, Inria, Clémentine Maurice Univ. Lille, Inria, CNRS
17:30 - 18:00
Lightning TalksPriSC at Salle 19
Chair(s): Lesly-Ann Daniel EURECOM
17:30
25m
Talk
Lightning Talks
PriSC

17:55
5m
Day closing
Day closing
PriSC

Mon 12 Jan

Displayed time zone: Brussels, Copenhagen, Madrid, Paris change

09:00 - 10:30
Keynote 1 and Paper 1CPP at Belvédère
Chair(s): Nicolas Tabareau Inria
09:00
60m
Keynote
How can Machine Learning Help Formal Proving ?
CPP
K: Amaury Hayat Ecole nationale des Ponts et Chaussées
10:08
22m
Talk
Higher order differential calculus in Mathlibdistinguished paper
CPP
Sebastien Gouezel CNRS and Rennes University
09:00 - 10:30
Session 1PLanQC at Salle 14
09:00
10m
Talk
Opening AddressTalk
PLanQC
File Attached
09:10
20m
Talk
Traq: Estimating the Quantum Cost of Classical ProgramsTalk
PLanQC
Anurudh Peduri Ruhr University Bochum, Jam Kabeer Ali Khan Standard Chartered Bank; Max Planck Institute for Security and Privacy (MPI-SP), Gilles Barthe MPI-SP; IMDEA Software Institute, Michael Walter Ruhr-Universität Bochum
File Attached
09:30
20m
Talk
Programming Abstractions for Quantum Linear AlgebraTalk
PLanQC
Charles Yuan University of Wisconsin–Madison
File Attached
09:50
20m
Talk
Verifying Repeat-Until-Success Circuits with AutoQTalk
PLanQC
Jyun-Ao Lin National Taipei University of Technology, Yu-Fang Chen Academia Sinica, Jakub Havlík Brno University of Technology, Ondřej Lengál Brno University of Technology, Fang-Yi Lo Academia Sinica, Wei-Lun Tsai Academia Sinica
File Attached
10:10
20m
Talk
VC-Qiskit: Automated–Interactive Verification of Qiskit Passes with Minimal IntrusionTalk
PLanQC
Xiaoquan Xu , Li Zhou Institute of Software at Chinese Academy of Sciences, Mingsheng Ying Institute of Software at Chinese Academy of Sciences; Tsinghua University
09:00 - 10:30
Syntactically and Semantically Constraining LLMsTutorials at Salle 20
09:00
90m
Tutorial
Syntactically and Semantically Constraining LLMs with Guarantees using Structured LLM Generation
Tutorials
Sasa Misailovic University of Illinois at Urbana-Champaign, Gagandeep Singh University of Illinois at Urbana-Champaign; VMware Research, Shubham Ugare Meta, Debangshu Banerjee UIUC, Tarun Suresh University of Illinois, Urbana-Champaign, Adharsh Kamath University of Illinois at Urbana-Champaign
10:30 - 11:00
10:30
30m
Coffee break
Break
POPL Catering

11:00 - 12:30
Analysis 2VMCAI at Horizons
Chair(s): Benoît Montagu Inria
11:00
30m
Talk
Data Race Detection by Digest-Driven Abstract Interpretation
VMCAI
Michael Schwarz National University of Singapore, Julian Erhard TU Munich; LMU Munich
Pre-print
11:30
30m
Talk
Termination Resilience Static Analysis
VMCAI
Naïm Moussaoui Remil Inria & ENS | PSL, Paris, France, Caterina Urban Inria Paris - ENS - Université PSL
12:00
30m
Talk
Forward Symbolic Execution for Trustworthy Automation of Binary Code Verification
VMCAI
Andreas Lindner Uppsala universitet, Karl Palmskog KTH Royal Institute of Technology, Scott Constable Intel Corporation, Mads Dam KTH, Roberto Guanciale KTH Royal Institute of Technology, Hamed Nemati KTH Royal Institute of Technology
11:00 - 12:30
PADL M2PADL at Salle 12
Chair(s): Giuseppe Mazzotta University of Calabria
11:00
30m
Talk
An efficient compiler for the IDP-Z3 knowledge base system
PADL
Wout Piessens KU Leuven, Belgium, Simon Vandevelde KU Leuven, Belgium, Joost Vennekens KU Leuven, Tom Schrijvers KU Leuven
11:30
30m
Talk
Multi-Configurable Search Rules in Prolog and Application to Testing
PADL
Daniela Ferreiro Technical University of Madrid and IMDEA Software Institute, José Morales IMDEA Software Institute, Pedro López-García IMDEA Software Institute, Manuel Hermenegildo Technical University of Madrid (UPM) and IMDEA Software Institute
12:00
30m
Talk
Using Prolog to Translate Set Theory and B to SAT
PADL
11:00 - 12:30
Session 1TPSA at Salle 13
11:00
45m
Keynote
Building the Cloud with Continuous Assurances using Static Analysis
TPSA
Subarno Banerjee Amazon Web Services
11:45
22m
Talk
Tracking Dynamically Bound Variable Dependencies
TPSA
12:07
23m
Talk
Gradually Retrofitting Assurance into Systems Software: A Separation-Logic Approach
TPSA
Rini Banerjee University of Cambridge, Zain K Aamer University of Pennsylvania, Hiroyuki Katsura University of Cambridge, David Kaloper-Meršinjak University of Cambridge, Dimitrios J. Economou University of Cambridge, Kayvan Memarian University of Cambridge, Dhruv Makwana University of Cambridge, Neel Krishnaswami University of Cambridge, Benjamin C. Pierce University of Pennsylvania, Christopher Pulte University of Cambridge, Peter Sewell University of Cambridge
11:00 - 12:30
Session 2PLanQC at Salle 14
11:00
45m
Keynote
Democratizing quantum formal verification: the path-sum wayKeynote
PLanQC
Christopĥe Chareton CEA, LIST, France
11:45
20m
Talk
One rig to control them allTalk
PLanQC
Chris Heunen University of Edinburgh, Robin Kaarsgaard University of Southern Denmark, Louis Lemonnier University of Edinburgh
File Attached
12:05
20m
Talk
Quantum Coherence Spaces Revisited: A von Neumann (Co)Algebraic ApproachTalk
PLanQC
Thea Li Inria, LMF, ENS Paris-Saclay, Université Paris-Saclay, Vladimir Zamdzhiev Inria
File Attached
11:00 - 12:30
Syntactically and Semantically Constraining LLMsTutorials at Salle 20
11:00
90m
Tutorial
Syntactically and Semantically Constraining LLMs with Guarantees using Structured LLM Generation
Tutorials
Sasa Misailovic University of Illinois at Urbana-Champaign, Gagandeep Singh University of Illinois at Urbana-Champaign; VMware Research, Shubham Ugare Meta, Debangshu Banerjee UIUC, Tarun Suresh University of Illinois, Urbana-Champaign, Adharsh Kamath University of Illinois at Urbana-Champaign
12:30 - 14:00
12:30
90m
Lunch
Lunch
POPL Catering

13:50 - 15:30
Session 3PLanQC at Salle 14
13:50
20m
Talk
A Graded Modal Type Theory for Pulse SchedulesTalk
PLanQC
Robin Adams Chalmers University of Technology, Gothenburg University, Sweden, Jean-Philippe Bernardy Chalmers University of Technology, Gothenburg University, Sweden, Lorenzo Perticone Chalmers University of Technology, Gothenburg University, Sweden, Jeremy Pope Chalmers University of Technology, Gothenburg University, Sweden
File Attached
14:10
20m
Talk
Efficient Parallel Compilation and Profiling of Quantum Circuits at Large ScalesTalk
PLanQC
Jane Moore Queen's University Belfast, Michael Hart Queen's University Belfast, John McAllister Queen's University Belfast
File Attached
14:30
20m
Talk
A Unified Assertion-Based Framework for Classical-Quantum Program VerificationTalk
PLanQC
File Attached
14:50
20m
Talk
A Pulse-Level DSL for Real-Time Quantum Control with Hardware Compilation and EmulationRemote
PLanQC
Yu-Hsuan Wu Academia Sinica, Yue Shi Princeton University, Junyi Liu University of Maryland, Yuxiang Peng Purdue University
File Attached
15:10
20m
Talk
Quantum Assertion Testing Without Mid-Circuit Measurement: Strategies and Lower BoundsRemote
PLanQC
Shengyuan Yang University of Wisconsin-Madison, Charles Yuan University of Wisconsin–Madison
File Attached
14:00 - 15:30
Proof assistantsCPP at Belvédère
Chair(s): Sophie Tourret Inria and Max Planck Institute for Informatics
14:00
22m
Talk
A Certifying Proof Assistant for Synthetic Mathematics in Lean
CPP
Wojciech Nawrocki Carnegie Mellon University, Joseph Hua Carnegie Mellon University, Mario Carneiro Chalmers University of Technology, Yiming Xu LMU Munich, Spencer Woolfson Carnegie Mellon University, Shuge Rong Carnegie Mellon University, Sina Hazratpour Johns Hopkins University, Steve Awodey Carnegie Mellon University
14:22
22m
Talk
Adding Sorts to an Isabelle Formalization of Superposition
CPP
Balazs Toth Ludwig-Maximilians-Universität München, Martin Desharnais Ludwig-Maximilians-Universität München, Jasmin Blanchette Ludwig-Maximilians-Universität München
14:45
22m
Talk
A Lambda-Superposition Tactic for Isabelle/HOL
CPP
Massin Guerdi Ludwig-Maximilians-Universität München
15:07
22m
Talk
Certifying the decidability of the word problem in monoids at large
CPP
Reinis Cirpons St Andrews University, Florent Hivert Univ. Paris-Saclay, LISN, LMF, CNRS, INRIA, Assia Mahboubi INRIA, Guillaume Melquiond Université Paris-Saclay - CNRS - ENS Paris-Saclay - Inria, James Mitchell St Andrews University, Finn Smith St Andrews University
14:00 - 15:30
Artificial InteligenceVMCAI at Horizons
Chair(s): Yu-Fang Chen Academia Sinica
14:00
60m
Keynote
Understanding Transformers through the Lens of Logic and Automata
VMCAI
Anthony Widjaja Lin TU Kaiserslautern; MPI-SWS
15:00
30m
Talk
Proof Minimization in Neural Network Verification
VMCAI
Omri Isac The Hebrew University of Jerusalem, Idan Refaeli Hebrew University of Jerusalem, Haoze Wu Stanford University, Clark Barrett Stanford University, Guy Katz The Hebrew University of Jerusalem
14:00 - 15:30
PADL M3PADL at Salle 12
Chair(s): Michael Leuschel HHU
14:00
30m
Talk
Property-Based Testing for Asynchronous Functional Reactive Programming Using Linear Temporal Logic
PADL
Christian Emil Nielsen IT University of Copenhagen, Mathias Faber Kristiansen IT University of Copenhagen, Patrick Bahr IT University of Copenhagen
14:30
30m
Talk
Graph Rewriting Language as a Platform for Quantum Diagrammatic Calculi
PADL
Kayo Tei Waseda University, Haruto Mishina Waseda University, Naoki Yamamoto Waseda University, Kazunori Ueda Waseda University
15:00
30m
Talk
Solving hard combinatorial optimization problems with PyQASP
PADL
Damiano Azzolini University of Ferrara, Nicola Leone University of Calabria, Italy, Giuseppe Mazzotta University of Calabria, Fracesco Ricca University of Calabria
14:00 - 15:30
Session 2TPSA at Salle 13
14:00
22m
Talk
Soteria Rust: Efficient Symbolic Execution for Rust
TPSA
Opale Sjöstedt Imperial College London, Sacha-Élie Ayoun Imperial College London, Azalea Raad Imperial College London
14:22
22m
Talk
Towards automatic functional correctness in the Mopsa static analyzer
TPSA
Milla Valnet Sorbonne Université, Raphaël Monat Inria and University of Lille, Antoine Miné Sorbonne Université
14:45
22m
Talk
An LLVM frontend for Infer for Swift analysis
TPSA
15:07
22m
Talk
Specialisation: Context-Dependent Reasoning in Incorrectness Separation Logic
TPSA
Raquel Fernandes da Silva Imperial College London, Sacha-Élie Ayoun Imperial College London, Azalea Raad Imperial College London, David Pichardie Meta
14:00 - 15:30
A Guided Tour through Oxidized OCamlTutorials at Salle 19
14:00
90m
Tutorial
A Guided Tour through Oxidized OCaml
Tutorials
Gavin Gray Brown University, Anil Madhavapeddy University of Cambridge, UK, KC Sivaramakrishnan IIT Madras and Tarides, Will Crichton Brown University, Shriram Krishnamurthi Brown University, Chris Casinghino Jane Street, Richard A. Eisenberg Jane Street
14:00 - 15:30
Veil: Automated and Interactive Verification of Transition SystemsTutorials at Salle 20
14:00
90m
Tutorial
Veil: Automated and Interactive Verification of Transition Systems
Tutorials
George Pîrlea National University of Singapore, Qiyuan Zhao National University of Singapore
15:30 - 16:00
15:30
30m
Coffee break
Break
POPL Catering

16:00 - 17:30
CompilersCPP at Belvédère
Chair(s): Matthieu Sozeau Inria
16:00
22m
Talk
Mechanized Dominator Tree Certificationdistinguished paper
CPP
Jean-Christophe Léchenet Université Côte d’Azur, Inria
DOI Pre-print
16:22
22m
Talk
Brack: A Verified Compiler for Scheme via CakeML
CPP
Pascal Lasnier University of Cambridge, Jeremy Yallop University of Cambridge, Magnus O. Myreen Chalmers University of Technology
16:45
22m
Talk
Verified VCG and Verified Compiler for Dafny
CPP
Daniel Nezamabadi ETH Zurich, Magnus O. Myreen Chalmers University of Technology, Yong Kiam Tan Institute for Infocomm Research, A*STAR
17:07
22m
Talk
Foundational Verification of Running-Time Bounds for Interactive Programs
CPP
Thomas Carotti MIT, Andy Tockman Massachussetts Institute of Technology, Pratap Singh CMU, Andres Erbsen Google, Samuel Gruetter ETH Zurich, Adam Chlipala Massachusetts Institute of Technology
16:00 - 17:30
Models 1VMCAI at Horizons
Chair(s): Mihaela Sighireanu University Paris-Saclay, ENS Paris-Saclay, CNRS, LMF
16:00
30m
Talk
Verification of Generic VHDL Designs and Their Translation to Rocq
VMCAI
Ocan Sankur University of Rennes, France / Inria, France / CNRS, France / IRISA, France, Benoît Boyer Mitsubishi Electric R&D Centre Europe, Rennes, France, Florian Faissole Mitsubishi Electric R&D Centre Europe
16:30
30m
Talk
A Formal Executable Semantics of PROMELA
VMCAI
Byoungho Son POSTECH, Kyungmin Bae POSTECH
17:00
30m
Talk
Efficient Discovery of Actual Causality in Stochastic Systems
VMCAI
Arshia Rafieioskouei Michigan State University, Kenneth Rogale Michigan State University, Borzoo Bonakdarpour Michigan State University
16:00 - 17:30
PADL M4PADL at Salle 12
Chair(s): Nada Amin Harvard University, Joaquín Arias Universidad Rey Juan Carlos
16:00
30m
Talk
Declarative Debugging for Modern Networks
PADL
Anduo Wang Temple University, USA, Matthew Caesar UIUC
16:30
30m
Talk
Interpretable Configuration Optimization for Static Program Verification via Rule-Based and Counterfactual Reasoning
PADL
Jaeseong Lee The University of Texas at Dallas, Sopam Dasgupta The University of Texas at Dallas, Gopal Gupta The University of Texas at Dallas, Shiyi Wei University of Texas at Dallas
17:00
30m
Talk
REGAL: Extracting implicit rules in text using LLMs with logic program feedback
PADL
Abhiramon Rajasekharan The University of Texas at Dallas, Gopal Gupta The University of Texas at Dallas
16:00 - 17:30
Session 3TPSA at Salle 13
16:00
22m
Talk
How to identify security vulnerabilities in Node.js packages?
TPSA
José Fragoso Santos INESC-ID; Instituto Superior Técnico - University of Lisbon, Filipe Marques INESC-ID; Instituto Superior Técnico - University of Lisbon, André Nascimento INESC-ID; Instituto Superior Técnico - University of Lisbon
16:22
22m
Talk
Modeling Incorrectness and Unknown Functions with Angelic and Demonic Nondeterminism
TPSA
Noam Zilberstein Cornell University
16:45
22m
Talk
A logic for all reasons
TPSA
Flavio Ascari University of Konstanz, Roberto Bruni University of Pisa, Lorenzo Gazzella Università di Pisa, Roberta Gori Diaprtimento di Informatica, Universita' di Pisa, Italy
17:07
22m
Talk
AMPLE: Fine-grained File Access Policies for Server Applications
TPSA
Seyedhamed Ghavamnia Bloomberg, Julien Vanegue Imperial College London; Bloomberg
16:00 - 17:30
Session 4PLanQC at Salle 14
16:00
30m
Poster SessionPoster
PLanQC

16:30
20m
Talk
Compiling Quantum Lambda-Terms into Circuits via the Geometry of InteractionTalk
PLanQC
Kostia Chardonnet Université de Lorraine, CNRS, Inria, LORIA, Ugo Dal Lago University of Bologna; Centre Inria d’Université Côte d’Azur, Naohiko Hoshino Sojo University, Paolo Pistone Université Claude Bernard Lyon 1
File Attached
16:50
20m
Talk
Towards a Hierarchical Quantum Circuit LanguageTalk
PLanQC
William Schober Università della Svizzera italiana, Scott Wesley Dalhousie University
File Attached
17:10
20m
Talk
Denotational semantics for stabiliser quantum programsTalk
PLanQC
Robert I. Booth University of Oxford, Cole Comfort INRIA Paris-Saclay
File Attached
16:00 - 17:30
A Guided Tour through Oxidized OCamlTutorials at Salle 19
16:00
90m
Tutorial
A Guided Tour through Oxidized OCaml
Tutorials
Gavin Gray Brown University, Anil Madhavapeddy University of Cambridge, UK, KC Sivaramakrishnan IIT Madras and Tarides, Will Crichton Brown University, Shriram Krishnamurthi Brown University, Chris Casinghino Jane Street, Richard A. Eisenberg Jane Street
16:00 - 17:30
Veil: Automated and Interactive Verification of Transition SystemsTutorials at Salle 20
16:00
90m
Tutorial
Veil: Automated and Interactive Verification of Transition Systems
Tutorials
George Pîrlea National University of Singapore, Qiyuan Zhao National University of Singapore
17:30 - 17:45
Award Ceremony and MiscellaneousVMCAI at Horizons

Tue 13 Jan

Displayed time zone: Brussels, Copenhagen, Madrid, Paris change

09:00 - 10:30
Keynote 2 and Paper 2CPP at Belvédère
Chair(s): Nikhil Swamy Microsoft Research
09:00
60m
Keynote
Specification, Semantics, and Verification of Quantum Programs
CPP
Jennifer Paykin University of Vermont
10:00
30m
Meeting
Business Meeting
CPP
Nikhil Swamy Microsoft Research, Nicolas Tabareau Inria
09:00 - 10:30
Analysis 3VMCAI at Horizons
Chair(s): Ondřej Lengál Brno University of Technology
09:00
60m
Keynote
TypedC: Spatial Memory Safety for Low Level Programs by Abstract Interpretation
VMCAI
Mihaela Sighireanu University Paris-Saclay, ENS Paris-Saclay, CNRS, LMF
10:00
30m
Talk
Input-based Three-Valued Abstraction Refinement
VMCAI
Jan Onderka University of Freiburg, Stefan Ratschan The Czech Academy of Sciences
09:00 - 10:30
PADL Keynote (Dale Miller)PADL at Salle 12
09:30
60m
Keynote
A positive perspective on term representation (Invited Talk)
PADL
Dale Miller INRIA Saclay and LIX/Institut Polytechnique de Paris
09:00 - 10:30
Session 1RTFM at Salle 13
09:00
10m
Day opening
Welcome from the Organizers
RTFM
Amal Ahmed Northeastern University, USA, Derek Dreyer MPI-SWS, Ilya Sergey National University of Singapore
09:10
40m
Talk
On long-term research vision
RTFM
Peter Sewell University of Cambridge
09:50
40m
Talk
On transitioning from academia to industry
RTFM
09:00 - 10:30
Analyzing Shell ScriptsTutorials at Salle 14
09:00
90m
Tutorial
Analyzing Shell Scripts
Tutorials
Michael Greenberg Stevens Institute of Technology, Konstantinos Kallas University of California, Los Angeles, Nikos Vasilakis Brown University, Evangelos Lamprou Brown University, USA
09:00 - 10:30
Types and logicsPEPM at Salle 19
Chair(s): Yukiyoshi Kameyama University of Tsukuba
09:00
5m
Day opening
Welcome
PEPM
Yukiyoshi Kameyama University of Tsukuba, Ningning Xie University of Toronto
09:05
30m
Research paper
Hole Refinements for Polymorphic Type-and-Example Driven Synthesis
PEPM
Niek Mulleners Utrecht University, Johan Jeuring Utrecht University, Wouter Swierstra Utrecht University, Netherlands
DOI
09:35
30m
Research paper
Inferring Typing Rules for Contextual Sugars
PEPM
Tailai Yu Peking University, Zhichao Guan Peking University, Di Wang Peking University, Zhenjiang Hu Peking University
DOI
10:05
15m
Short-paper
S4 modal sequent calculus as intermediate logic and intermediate language (Short Paper)
PEPM
Jean Caspar École normale supérieure – PSL, INRIA, LS2N, CNRS, Guillaume Munch-Maccagnoni INRIA
File Attached
10:20
15m
Short-paper
Epistemic Logic for Polyglots (Short Paper)
PEPM
Luis Garcia , Chris Martens Northeastern University
File Attached
09:00 - 10:30
Session 1PLMW @ POPL at Salle 20
09:00
10m
Day opening
Opening
PLMW @ POPL
Andrew K. Hirsch University at Buffalo, SUNY, Yannick Forster INRIA, Jenna DiVincenzo (Wise) Purdue University
09:10
10m
Talk
SIGPLAN CARES Introduction
PLMW @ POPL
Stephanie Weirich University of Pennsylvania
09:20
20m
Talk
The Art of Living Abroad (and Finding a Good Baguette in New York)
PLMW @ POPL
Alexandre Moine New York University
09:40
50m
Other
Icebreaker
PLMW @ POPL

10:30 - 11:00
10:30
30m
Coffee break
Break
POPL Catering

11:00 - 12:50
MetatheoryCPP at Belvédère
Chair(s): Cyril Cohen Inria, CNRS, ENS Lyon, UCBL, LIP
11:00
22m
Talk
Can we formalise type theory intrinsically without any compromise? A case study in Cubical Agda
CPP
Liang-Ting Chen Academia Sinica, Fredrik Nordvall Forsberg University of Strathclyde, Tzu-Chun Tsai Academia Sinica
DOI Pre-print
11:22
22m
Talk
Formalization of a Proof Calculus for Incremental Linearization for Satisfiability Modulo Nonlinear Arithmetic and Transcendental Functions
CPP
Tomaz Mascarenhas Universidade Federal de Minas Gerais, Harun Khan Stanford University, Abdalrhman Mohamed Stanford University, Andrew Reynolds University of Iowa, Haniel Barbosa Universidade Federal de Minas Gerais, Clark Barrett Stanford University, Cesare Tinelli University of Iowa
11:44
22m
Talk
Mechanizing Synthetic Tait Computability in Istari
CPP
Runming Li Carnegie Mellon University, Yue Yao Carnegie Mellon University, Robert Harper Carnegie Mellon University
DOI
12:06
22m
Talk
Building Blocks for Step-Indexed Program Logics
CPP
Thomas Somers Radboud University Nijmegen, Jonas Kastberg Hinrichsen Aalborg University, Lennard Gäher MPI-SWS, Robbert Krebbers Radboud University Nijmegen
12:28
22m
Talk
A Rose Tree is Blooming (Proof Pearl)
CPP
Joomy Korkut Bloomberg
DOI Pre-print
11:00 - 12:30
SolversVMCAI at Horizons
Chair(s): Borzoo Bonakdarpour Michigan State University
11:00
30m
Talk
Multi-variable Quantification of BDDs in External Memory using Nested Sweeping
VMCAI
Steffan Sølvsten Aarhus University, Jaco van de Pol Aarhus University
11:30
30m
Talk
Producing Shorter Congruence Closure Proofs in a State-of-the-Art SMT Solver
VMCAI
Bruno Andreotti Universidade Federal de Minas Gerais, Haniel Barbosa Universidade Federal de Minas Gerais
12:00
30m
Talk
SAT-Based Synthesis of Minimal Deterministic Real-Time Automata via 3DRTA Representation
VMCAI
Junjie Meng School of Computer Science and Technology, Tongji University, Jie An Institute of Software Chinese Academy of Sciences, Yong Li Institute of Software, Chinese Academy of Sciences, Andrea Turrini Institute of Software, Chinese Academy of Sciences, Miaomiao Zhang School of Computer Science and Technology, Tongji University
11:00 - 12:30
Session 2RTFM at Salle 13
11:00
30m
Talk
On building a successful research group
RTFM
Stephanie Weirich University of Pennsylvania
11:30
60m
Panel
Panel: Promotion and tenure
RTFM
P: Amal Ahmed Northeastern University, USA, P: Lars Birkedal Aarhus University, P: Ilya Sergey National University of Singapore, P: Nicolas Wu Imperial College London, P: Steve Zdancewic University of Pennsylvania, M: Derek Dreyer MPI-SWS
11:00 - 12:30
Analyzing Shell ScriptsTutorials at Salle 14
11:00
90m
Tutorial
Analyzing Shell Scripts
Tutorials
Michael Greenberg Stevens Institute of Technology, Konstantinos Kallas University of California, Los Angeles, Nikos Vasilakis Brown University, Evangelos Lamprou Brown University, USA
11:00 - 12:30
Semantics and applicationsPEPM at Salle 19
Chair(s): Meng Wang University of Bristol
11:00
30m
Research paper
Computation-Tree Semantics: An Algorithmic Approach to Structurally Defined Relations
PEPM
Sean Kristian Remond Harbo Aalborg University, Hans Hüttel Aalborg University
DOI
11:30
30m
Research paper
Towards Lightweight and Efficient Choreographic Cloud Services
PEPM
Alex Ionescu Chalmers University of Technology; University of Gothenburg, Alejandro Russo Chalmers University of Technology; University of Gothenburg
DOI
12:00
15m
Short-paper
Incrementalizing Haskell implementation of Putback-based Bidirectional Transformation Language BiGUL (Short Paper)
PEPM
Masaki Toyoda Hosei University, Soichiro Hidaka Hosei University
File Attached
12:15
15m
Talk
Partial Evaluation as a primitive in modern network troubleshooting (Talk Proposal)
PEPM
Anduo Wang Temple University, USA
11:00 - 12:30
Session 2PLMW @ POPL at Salle 20
11:00
45m
Panel
PLMW Panel
PLMW @ POPL
Alexandre Moine New York University, Simon Spies Jane Street, Umang Mathur National University of Singapore, Jennifer Paykin University of Vermont, Stephen Mell
11:45
45m
Talk
Weak Accept, or: How I Learned to Write Papers and Deal with Reviews
PLMW @ POPL
Alex Kavvos University of Bristol
12:30 - 14:00
12:30
90m
Lunch
Lunch
POPL Catering

14:00 - 15:30
Program verificationCPP at Belvédère
14:00
22m
Talk
Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
CPP
Shuanglong Kan Barkhausen Institute, Dresden, Anthony Widjaja Lin TU Kaiserslautern; MPI-SWS
14:22
22m
Talk
Enhancing Symbolic Execution with Machine-Checked Safety Proofs
CPP
David Trabish Technion, Shachar Itzhaky Technion
Pre-print
14:45
22m
Talk
Layers of Confluence for Actors
CPP
Ludovic Henrio University of Lyon - ENS Lyon - UCBL - CNRS - Inria - LIP, Einar Broch Johnsen University of Oslo, Åsmund Aqissiaq Arild Kløvstad University of Oslo (UiO), Violet Ka I Pun Western Norway University of Applied Sciences, Yannick Zakowski Inria
15:07
22m
Talk
Towards composable proofs of cache coherence protocols
CPP
14:00 - 15:30
Models 2VMCAI at Horizons
Chair(s): Anthony Widjaja Lin TU Kaiserslautern; MPI-SWS
14:00
30m
Talk
Atomic Gliders and Cellular Automata as Language Generators
VMCAI
Dana Fisman Ben-Gurion University, Noa Izsak CISPA Helmholtz Center for Information Security, Germany
14:30
30m
Talk
Reachability in multi-agent transfer systems
VMCAI
Nathalie Bertrand INRIA Rennes, Loic Helouet INRIA, Engel Lefaucheux Université de Lorraine; CNRS; Inria; LORIA, Luca Paparazzo Inria, IRISA, Université de Rennes
15:00
30m
Talk
A Hybrid Meta-Learning Framework for Adaptive Safe Controller Synthesis of Dynamical Models
VMCAI
Rui Guo Zhejiang Sci-Tech University, Yang Li Zhejiang Sci-Tech University, Xiuqing Cao Zhejiang Sci-Tech University, Wang Lin
14:00 - 15:30
Session 3RTFM at Salle 13
14:00
40m
Talk
On grant writing
RTFM
Suresh Jagannathan Purdue University
14:40
50m
Panel
Panel: Visibility and Impact
RTFM
P: Derek Dreyer MPI-SWS, P: Xavier Leroy Collège de France - PSL University, P: Nikhil Swamy Microsoft Research, P: Stephanie Weirich University of Pennsylvania, M: Ilya Sergey National University of Singapore
14:00 - 15:30
Is Program Synthesis Soluble in Large Language Models?Tutorials at Salle 14
14:00
90m
Tutorial
Is Program Synthesis Soluble in Large Language Models?
Tutorials
Nathanaël Fijalkow CNRS, LaBRI, University of Bordeaux
14:00 - 15:30
KeynotePEPM at Salle 19
Chair(s): Ningning Xie University of Toronto
14:00
90m
Keynote
Revisiting the Evolution of Effects (Invited Talk)Keynote
PEPM
Nicolas Wu Imperial College London
DOI
14:00 - 15:30
Session 3PLMW @ POPL at Salle 20
14:00
45m
Talk
An Invitation to Quantum Programming Languages
PLMW @ POPL
Robert Rand University of Chicago
14:45
45m
Talk
Industry Panel
PLMW @ POPL
Nathanaëlle Courant OCamlPro, Chris Casinghino Jane Street, Kiran Gopinathan University College London, Satnam Singh Harmonic
15:30 - 16:00
15:30
30m
Coffee break
Break
POPL Catering

16:00 - 17:30
Separation logicCPP at Belvédère
Chair(s): Thibault Dardinier EPFL
16:00
22m
Talk
A Recipe for Modular Verification of Generic Tree Traversals
CPP
Laila Elbeheiry MPI-SWS, Michael Sammler Institute of Science and Technology Austria, Robbert Krebbers Radboud University Nijmegen, Derek Dreyer MPI-SWS, Deepak Garg MPI-SWS
16:22
22m
Talk
Precise Reasoning about Container-Internal Pointers with Logical Pinningdistinguished paper
CPP
DOI Pre-print
16:45
22m
Talk
Modular Specifications and Implementations of Random Samplers in Higher-Order Separation Logic
CPP
Virgil Marionneau ENS Rennes, Félix Sassus-Bourda ENS Paris Saclay, Alejandro Aguirre Aarhus University, Lars Birkedal Aarhus University
17:07
22m
Talk
Using Ghost Ownership to Verify Union-Find and Persistent Arrays in Rust
CPP
Arnaud Golfouse Université Paris-Saclay, CNRS, ENS Paris-Saclay, Inria, Laboratoire des méthodes formelles, 91190, Gif-sur-Yvette, France, Armaël Guéneau Université Paris-Saclay - CNRS - ENS Paris-Saclay - Inria, Jacques-Henri Jourdan LMF, CNRS, Université Paris-Saclay
16:00 - 17:30
Quantum and Probabilistic VerificationVMCAI at Horizons
Chair(s): Jyun-Ao Lin National Taipei University of Technology
16:00
30m
Talk
Efficiently Verifying Quantum Programs with Few T Gates
VMCAI
Youngchan Cho The University of Chicago, Robert Rand University of Chicago
16:30
30m
Talk
Finding Photonics Circuits via δ-weakening SMT
VMCAI
Marco Lewis Inria, Benoît Valiron Université Paris-Saclay, CNRS, CentraleSupélec, LMF
17:00
30m
Talk
Probabilistic Verification for Modular Network-on-Chip Systems
VMCAI
Nick Waddoups nick.waddoups@usu.edu, Jonah Boe Hill Air Force Base, Utah, Arnd Hartmanns University of Twente, Prabal Basu Utah State University, Sanghamitra Roy Utah State University, Koushik Chakraborty Utah State University, Zhen Zhang Utah State University
16:00 - 17:30
Session 4RTFM at Salle 13
16:00
60m
Panel
Panel: Work-life balance, service, and teaching
RTFM
P: Sebastian Erdweg KIT, P: Robbert Krebbers Radboud University Nijmegen, P: Azalea Raad Imperial College London, P: Sharon Shoham Tel Aviv University, M: Amal Ahmed Northeastern University, USA
16:00 - 17:30
Is Program Synthesis Soluble in Large Language Models?Tutorials at Salle 14
16:00
90m
Tutorial
Is Program Synthesis Soluble in Large Language Models?
Tutorials
Nathanaël Fijalkow CNRS, LaBRI, University of Bordeaux
16:00 - 17:30
Staging and effect handlersPEPM at Salle 19
Chair(s): Sam Lindley University of Edinburgh
16:00
30m
Research paper
Staging Effect Handlers for Modular Search
PEPM
Alexandru Trifanov Independent, Tom Schrijvers KU Leuven
DOI
16:30
15m
Talk
Holey: Staged Execution from Python to SMT (Talk Proposal)
PEPM
Nada Amin Harvard University
16:45
15m
Short-paper
Towards Cumulative Abstract Semantics via Handlers (Short Paper)
PEPM
Cade Lueker University of Colorado Boulder, Andrew Fox University of Colorado Boulder, Bor-Yuh Evan Chang University of Colorado Boulder & Amazon
File Attached
17:00
15m
Short-paper
Retargeting an Abstract Interpreter for a New Language by Partial Evaluation (Short Paper)
PEPM
Jay Lee Seoul National University, Joongwon Ahn Seoul National University, Kwangkeun Yi Seoul National University
File Attached
17:15
10m
Day closing
Closing
PEPM
Yukiyoshi Kameyama University of Tsukuba, Ningning Xie University of Toronto
16:00 - 17:30
Session 4PLMW @ POPL at Salle 20
16:00
45m
Talk
How to Write a Paper
PLMW @ POPL
Nate Foster Cornell University; Jane Street
16:45
45m
Talk
Effects and Call-by-Push-Value
PLMW @ POPL
Paul Blain Levy University of Birmingham
17:30 - 21:30
Jane Street Game NightPOPL at Halle 1
17:30
4h
Social Event
Jane Street Game Night
POPL
Chris Casinghino Jane Street

Wed 14 Jan

Displayed time zone: Brussels, Copenhagen, Madrid, Paris change

08:50 - 09:00
Opening DayPOPL at Nef
08:50
10m
Day opening
Welcome from the general chair
POPL

09:00 - 10:00
Keynote (Mirrored)POPL at Dortoirs
09:00
60m
Keynote
Medium-scale automation for proof assistants
POPL
09:00 - 10:00
KeynotePOPL at Nef
09:00
60m
Keynote
Medium-scale automation for proof assistants
POPL
09:00 - 10:00
Keynote (Mirrored)POPL at Réfectoire
09:00
60m
Keynote
Medium-scale automation for proof assistants
POPL
10:00 - 10:30
10:00
30m
Coffee break
Break
POPL Catering

10:30 - 12:10
Program AnalysisPOPL at Dortoirs
Chair(s): Xavier Rival Inria - CNRS - Ecole Normale Superieure de Paris - PSL University
10:30
25m
Talk
A Modular Static Cost Analysis for GPU Warp-Level Parallelism
POPL
Gregory Blike University of Massachusetts at Boston, Hannah Zicarelli University of Massachusetts at Boston, Udaya Sathiyamoorthy University of Massachusetts at Boston, Julien Lange Royal Holloway University of London, Tiago Cogumbreiro University of Massachusetts at Boston
DOI
10:55
25m
Talk
ChiSA: Static Analysis for Lightweight Chisel Verification
POPL
Jiacai Cui Nanjing University, Qinlin Chen Nanjing University, Zhongsheng Zhan Nanjing University, Tian Tan Nanjing University, Yue Li Nanjing University
DOI
11:20
25m
Talk
Miri: Practical Undefined Behavior Detection for Rust
POPL
Ralf Jung ETH Zurich, Benjamin Kimock Lansweeper NV, Christian Poveda Unaffiliated, Eduardo Sánchez Muñoz Unaffiliated, Oli Scherer Unaffiliated, Qian (Andy) Wang ETH Zurich and Imperial College London
DOI
11:45
25m
Talk
Piecewise Analysis of Probabilistic Programs via k-Induction
POPL
Tengshun Yang Institute of Software at Chinese Academy of Sciences, Shenghua Feng Institute of Software at Chinese Academy of Sciences, Hongfei Fu Shanghai Jiao Tong University, Naijun Zhan Peking University; Zhongguancun Lab, Jingyu Ke Shanghai Jiao Tong University, Shiyang Wu Shanghai Jiao Tong University
DOI
10:30 - 12:10
Functional Programming POPL at Nef
Chair(s): Alex Rice University of Edinburgh
10:30
25m
Talk
Domain-Theoretic Semantics for Functional Logic Programming
POPL
Eddie Jones University of Bristol, Samson Main University of Bristol, Celia Mengyue Li University of Bristol, Jonathan Marriott University of Bristol, Alex Kavvos University of Bristol
DOI
10:55
25m
Talk
Handling Scope Checks: A Comparative Framework for Dynamic Scope Extrusion Checks
POPL
Michael Lee University of Cambridge, UK, Ningning Xie University of Toronto, Oleg Kiselyov Tohoku University, Jeremy Yallop University of Cambridge
DOI
11:20
25m
Talk
Hyperfunctions: Communicating Continuations
POPL
Donnacha Oisín Kidney Imperial College London, Nicolas Wu Imperial College London
DOI Pre-print
11:45
25m
Talk
Lazy Linearity for a Core Functional Language
POPL
Rodrigo Mesquita Well-Typed LLP, Bernardo Toninho Instituto Superior Técnico - University of Lisbon
DOI Pre-print
10:30 - 12:10
Automata 1POPL at Réfectoire
Chair(s): Andreas Pavlogiannis Aarhus University
10:30
25m
Talk
Bounded Treewidth, Multiple Context-Free Grammars, and Downward ClosuresRemote
POPL
C. Aiswarya Chennai Mathematical Institute, Pascal Baumann MPI-SWS, Prakash Saivasan Institute of Mathematical Sciences, Lia Schütze MPI-SWS, Georg Zetzsche MPI-SWS
DOI
10:55
25m
Talk
Formal Verification for JavaScript Regular Expressions: A Proven Mechanized Semantics and Its ApplicationsDistinguished Paper
POPL
Aurèle Barrière EPFL, Victor Deng EPFL; École Normale Supérieure - PSL - CNRS, Clément Pit-Claudel EPFL
DOI Pre-print
11:20
25m
Talk
Network Change Validation with Relational NetKAT
POPL
Han Xu Princeton University, Zachary Kincaid Princeton University, Ratul Mahajan University of Washington, Intentionet, David Walker
DOI
11:45
25m
Talk
Parameterized Verification of Quantum Circuits
POPL
Parosh Aziz Abdulla Uppsala University; Mälardalen University, Yu-Fang Chen Academia Sinica, Michal Hečko Brno University of Technology, Lukáš Holík Brno University of Technology; Aalborg University, Ondřej Lengál Brno University of Technology, Jyun-Ao Lin National Taipei University of Technology, Ramanathan S. Thinniyam Uppsala University
DOI
12:15 - 14:00
12:15
1h45m
Lunch
Lunch
POPL Catering

12:15 - 14:00
Mentoring LunchPOPL Catering at Halle 1
12:15
1h45m
Lunch
Mentoring Lunch
POPL Catering

12:15 - 14:00
PLMW Steering Committee MeetingPLMW @ POPL at Salle 9
12:15
1h45m
Meeting
PLMW Steering Committee Meeting
PLMW @ POPL

14:00 - 15:40
Quantum 1POPL at Dortoirs
Chair(s): Ugo Dal Lago University of Bologna; Centre Inria d’Université Côte d’Azur
14:00
25m
Talk
An Expressive Assertion Language for Quantum Programs
POPL
Bonan Su Tsinghua University, Yuan Feng Tsinghua University, Mingsheng Ying Institute of Software at Chinese Academy of Sciences; Tsinghua University, Li Zhou Institute of Software at Chinese Academy of Sciences
DOI
14:25
25m
Talk
Hadamard-Pi: Equational Quantum Programming
POPL
Wang Fang University of Edinburgh, Chris Heunen University of Edinburgh, Robin Kaarsgaard University of Southern Denmark
DOI
14:50
25m
Talk
Qudit Quantum Programming with Projective Cliffords
POPL
Jennifer Paykin University of Vermont, Sam Winnick Simon Fraser University; University of Waterloo
DOI
15:15
25m
Talk
RapunSL: Untangling Quantum Computing with Separation, Linear Combination and Mixing
POPL
Yusuke Matsushita Kyoto University, Kengo Hirata University of Edinburgh, Ryo Wakizaka Kyoto University, Emanuele D'Osualdo University of Konstanz
DOI Pre-print
14:00 - 15:40
Types 1POPL at Nef
Chair(s): Lionel Parreaux Hong Kong University of Science and Technology
14:00
25m
Talk
Extensible Data Types with Ad-Hoc Polymorphism
POPL
Matthew Toohey University of Toronto, Yanning Chen University of Toronto, Ara Jamalzadeh University of Toronto, Ningning Xie University of Toronto
DOI Pre-print
14:25
25m
Talk
Let Generalization, Polymorphic Recursion, and Variable Minimization in Boolean-Kinded Type Systems
POPL
Joseph Zullo Purdue University
DOI
14:50
25m
Talk
Local Contextual Type Inference
POPL
Xu Xue University of Hong Kong, Chen Cui University of Hong Kong, Shengyi Jiang The University of Hong Kong, Bruno C. d. S. Oliveira University of Hong Kong
DOI
15:15
25m
Talk
Typing Strictness
POPL
Daniel Sainati University of Pennsylvania, Joseph W. Cutler University of Pennsylvania, Benjamin C. Pierce University of Pennsylvania, Stephanie Weirich University of Pennsylvania
DOI
14:00 - 15:40
Concurrency: ModelsPOPL at Réfectoire
Chair(s): Noam Zilberstein Cornell University
14:00
25m
Talk
Arbitration-Free Consistency Is Available (and Vice Versa)
POPL
Hagit Attiya Technion - Israel Institute of Technology, Constantin Enea LIX, CNRS, Ecole Polytechnique, Enrique Román-Calvo University of Freiburg
DOI
14:25
25m
Talk
ArchSem: Reusable Rigorous Semantics of Relaxed Architectures
POPL
Thibaut Pérami University of Cambridge, Thomas Bauereiss University of Cambridge, Brian Campbell University of Edinburgh, Zongyuan Liu Aarhus University, Nils Lauermann University of Cambridge, Alasdair Armstrong University of Cambridge, Peter Sewell University of Cambridge
DOI
14:50
25m
Talk
Consistent Updates for Scalable Microservices
POPL
Devora Chait-Roth New York University, Kedar Namjoshi Nokia Bell Labs, Thomas Wies New York University
DOI
15:15
25m
Talk
Recurrence Sets for Proving Fair Non-termination under Axiomatic Memory Consistency Models
POPL
Thomas Haas TU Braunschweig, Roland Meyer TU Braunschweig, Hernán Ponce de León Huawei Dresden Research Center, Andrés Lomelí Garduño Huawei Dresden Research Center
DOI
15:40 - 16:10
15:40
30m
Coffee break
Break
POPL Catering

16:10 - 17:25
Decision ProceduresPOPL at Dortoirs
Chair(s): Andrés Goens TU Darmstadt
16:10
25m
Talk
Characterizing Sets of Theories That Can Be Disjointly Combined
POPL
Benjamin Przybocki Carnegie Mellon University, Guilherme V. Toledo Bar-Ilan University, Yoni Zohar
DOI
16:35
25m
Talk
Context-Free-Language Reachability for Almost-Commuting Transition Systems
POPL
Nikhil Pimpalkhare Princeton University, Zachary Kincaid Princeton University, Thomas Reps University of Wisconsin-Madison
DOI
17:00
25m
Talk
Determination Problems for Orbit Closures and Matrix Groups
POPL
Rida Ait El Manssour University of Oxford, George Kenison Liverpool John Moores University, Mahsa Shirmohammadi CNRS, Anton Varonka TU Wien, James Worrell University of Oxford
DOI
16:10 - 17:25
Synthesis 1POPL at Nef
Chair(s): Benjamin Delaware Purdue University
16:10
25m
Talk
Accelerating Syntax-Guided Program Synthesis by Optimizing Domain-Specific Languages
POPL
Zhentao Ye Peking University, Ruyi Ji Peking University, Yingfei Xiong Peking University, Xin Zhang Peking University
DOI
16:35
25m
Talk
Inductive Program Synthesis by Meta-Analysis-Guided Hole Filling
POPL
Doyoon Lee Seoul National University, Woosuk Lee Hanyang University, Kwangkeun Yi Seoul National University
DOI
17:00
25m
Talk
Oriented Metrics for Bottom-Up Enumerative Synthesis
POPL
Roland Meyer TU Braunschweig, Jakob Tepe TU Braunschweig
DOI
16:10 - 17:25
Machine LearningPOPL at Réfectoire
Chair(s): Satnam Singh Harmonic
16:10
25m
Talk
ChopChop: A Programmable Framework for Semantically Constraining the Output of Language Models
POPL
Shaan Nagy University of California at San Diego, Timothy Zhou University of California, San Diego, Nadia Polikarpova University of California at San Diego, Loris D'Antoni University of California at San Diego
DOI
16:35
25m
Talk
Compiling to Linear Neurons
POPL
Joey Velez-Ginorio University of Pennsylvania, Nada Amin Harvard University, Konrad Kording University of Pennsylvania, Steve Zdancewic University of Pennsylvania
DOI
17:00
25m
Talk
Fuzzing Guided by Bayesian Program Analysis
POPL
Yifan Zhang Peking University, Xin Zhang Peking University
DOI Pre-print
17:30 - 19:30
POPL Networking ReceptionPOPL at Halle 0
17:30
2h
Social Event
POPL networking reception
POPL

17:30 - 19:30
17:30
2h
Poster
AgdaGDL: A Geometric Deep Learning Framework for Property Certification
Student Research Competition
Mason Lary University at Buffalo, SUNY, Andrew K. Hirsch University at Buffalo, SUNY
17:30
2h
Poster
A Concise Type System for Borrow Inference
Student Research Competition
Tom Divers University of Bristol
17:30
2h
Poster
Language Model for MPI
Student Research Competition
Keith Allen University at Buffalo, SUNY, Andrew K. Hirsch University at Buffalo, SUNY
17:30
2h
Poster
RESpecBench: Rigorous Evaluation of Specification Generation with Automated Verification
Student Research Competition
Barış Bayazıt University of Toronto, Xujie Si University of Toronto
17:30
2h
Poster
Asymptotic Analysis as an Abstract Interpretation
Student Research Competition
Heewon Lee KAIST, Korea, South (The Republic of)
Pre-print
17:30
2h
Poster
A specification for Agda Core’s unification algorithm for generic pattern matching
Student Research Competition
Ewen BROUDIN-CARADEC ENS Paris Saclay, TU Delft, INRIA Saclay, LMF
Pre-print
17:30
2h
Poster
Amortized Analysis of Splay Trees via a Lax Homomorphism
Student Research Competition
Lukas Kebuladze Carnegie Mellon University
Pre-print
17:30
2h
Poster
Handling the Selection Monad, Uniformly
Student Research Competition
Akane Taniguchi Institute of Science Tokyo
17:30
2h
Poster
A Well-behaved Differentiable Logic
Student Research Competition
Jairo Miguel Marulanda-Giraldo University of Southampton
17:30
2h
Poster
Towards Functional Language Runtimes Without Garbage Collection
Student Research Competition
Dustin Juliano Indiana University Indianapolis
17:30
2h
Poster
The Expressiveness of Programs via Descriptive Complexity
Student Research Competition
Ziyue Jin Peking University
17:30
2h
Poster
Ariadne: Automatically Tuning Generator Weights Using Dynamic Sampling
Student Research Competition
Francille Zhuang Purdue University
17:30
2h
Poster
Specialisation: Context-Dependent Reasoning in Incorrectness Separation Logic
Student Research Competition
Raquel Fernandes da Silva Imperial College London, Sacha-Élie Ayoun Imperial College London, Azalea Raad Imperial College London, David Pichardie Meta
17:30
2h
Poster
A Verified Distributed Stream Processing Framework
Student Research Competition
Mathias Rabing Copenhagen University
17:30
2h
Poster
Partial Evaluation + Global Analyser = Separate Analyser
Student Research Competition
Gyuhyeok Oh Seoul National University
17:30
2h
Poster
Bootstrapping a Verified Compiler for an Imperative Language in Rocq
Student Research Competition
17:30
2h
Poster
Formally Verified Optimisations for the Pancake Compiler
Student Research Competition
Minh Do University of New South Wales
17:30
2h
Poster
Expanding Specification Capabilities of a Gradual Verifier with Pure Functions
Student Research Competition
Doruk Alp Mutlu Michigan State University
17:30
2h
Poster
Towards a Mechanised Theory of Fully Featured Compositional Symbolic Execution
Student Research Competition
Shivanandan Tamil Kumaran Imperial College London, Andreas Lööw Royal Holloway, University of London, Philippa Gardner Imperial College London
17:30
2h
Poster
RUXt: Automatic Compositional Type Safety Refutation
Student Research Competition
Pedro Carrott Imperial College London, Sacha-Élie Ayoun Imperial College London, Azalea Raad Imperial College London
17:30
2h
Poster
Save Time and Mechanize
Student Research Competition
George Zakhour University of St. Gallen
17:30
2h
Poster
Region Type System with Bidirectional Multiprompt Delimited Control
Student Research Competition
Alexander Phidias Goetz University of Tübingen
17:30
2h
Poster
Semantic Completeness of Higher-Order Probabilistic Separation Logics
Student Research Competition
Puming Liu New York University Shanghai
17:30
2h
Poster
Decompilation into Interaction Trees
Student Research Competition
Dao Le UNSW Sydney
17:30
2h
Poster
Interactive symbolic execution of concurrent programs in a theorem prover
Student Research Competition
17:30
2h
Poster
Interrupt-Aware Variable Analysis for SSD Firmware
Student Research Competition
Hyeongseo Yoo Seoul National University and Samsung Electronics
17:30
2h
Poster
A theory of lists with combinators for SMT solvers
Student Research Competition
Pierre Goutagny Inria and University of Lille
19:30 - 22:00
Women @ POPL DinnerPOPL at Kraz restaurant
19:30
2h30m
Dinner
Women @ POPL Dinner
POPL

Thu 15 Jan

Displayed time zone: Brussels, Copenhagen, Madrid, Paris change

09:00 - 10:00
Tour of the Historic City CenterPOPL at Rennes Tourist Office
09:00
60m
Social Event
Tour of the Historic City Center
POPL

09:30 - 09:50
Jacobins Convent and its HistoryPOPL at Nef
09:30
20m
Social Event
Jacobins Convent and its History
POPL

09:50 - 10:20
09:50
30m
Coffee break
Break
POPL Catering

10:20 - 12:00
10:20 - 12:00
Concurrency: Testing and VerificationPOPL at Nef
Chair(s): Ramanathan S. Thinniyam Uppsala University
10:20
25m
Talk
(TOPLAS) Will it Fit? Verifying Heap Space Bounds of Concurrent Programs under Garbage Collection
POPL
Alexandre Moine New York University, Arthur Charguéraud Inria, François Pottier Inria
DOI
10:45
25m
Talk
Verifying Almost-Sure Termination for Randomized Distributed Algorithms
POPL
Constantin Enea LIX, CNRS, Ecole Polytechnique, Rupak Majumdar MPI-SWS, Harshit Jitendra Motwani MPI-SWS, V.R. Sathiyanarayana MPI-SWS
DOI
11:10
25m
Talk
Zoo: A Framework for the Verification of Concurrent OCaml 5 Programs using Separation Logic
POPL
Clément Allain INRIA, Gabriel Scherer Université Paris Cité - Inria - CNRS
DOI
11:35
25m
Talk
The Complexity of Testing Message-Passing Concurrency
POPL
Zheng Shi National University of Singapore, Lasse Møldrup Aarhus University, Umang Mathur National University of Singapore, Andreas Pavlogiannis Aarhus University
DOI Pre-print
10:20 - 12:00
Separation LogicPOPL at Réfectoire
Chair(s): Derek Dreyer MPI-SWS
10:20
25m
Talk
A Relational Separation Logic for Effect Handlers
POPL
Paulo Emílio de Vilhena Imperial College London, Simcha van Collem Radboud University Nijmegen, Ines Wright Aarhus University, Robbert Krebbers Radboud University Nijmegen
DOI
10:45
25m
Talk
Bayesian Separation Logic
POPL
Shing Hin Ho Imperial College London, Nicolas Wu Imperial College London, Azalea Raad Imperial College London
DOI Pre-print
11:10
25m
Talk
Cryptis: Cryptographic Reasoning in Separation Logic
POPL
Arthur Azevedo de Amorim Rochester Institute of Technology, Amal Ahmed Northeastern University, USA, Marco Gaboardi Boston University
DOI
11:35
25m
Talk
Separating the Wheat from the Chaff: Understanding (In-)Completeness of Proof Mechanisms for Separation Logic with Inductive Definitions
POPL
Neta Elad Tel Aviv University, Adithya Murali University of Wisconsin, Sharon Shoham Tel Aviv University
DOI
10:30 - 11:00
10:30
30m
Coffee break
Break
POPL Catering

12:00 - 14:00
12:00
2h
Lunch
Lunch
POPL Catering

12:00 - 14:00
POPL Steering Committee MeetingPOPL at Salle 9
12:00
2h
Meeting
POPL steering committee meeting
POPL

12:30 - 14:00
LGBTQ+ LunchPOPL Catering at Salle 14
12:30
90m
Lunch
LGBTQ+ Lunch
POPL Catering

14:00 - 15:40
Category TheoryPOPL at Dortoirs
Chair(s): Kenji Maillard Inria
14:00
25m
Talk
Classical Notions of Computation and the Hasegawa-Thielecke Theorem
POPL
Éléonore Mangel Univ. Paris Cité - CNRS - Inria, Paul-André Melliès Univ. Paris Cité - CNRS - Inria, Guillaume Munch-Maccagnoni INRIA
DOI
14:25
25m
Talk
From Semantics to Syntax: A Type Theory for Comprehension Categories
POPL
Niyousha Najmaei École Polytechnique, Niels van der Weide Radboud University, Benedikt Ahrens Delft University of Technology, Paige Randall North Utrecht University
DOI
14:50
25m
Talk
Higher-Order Behavioural Conformances via Fibrations
POPL
Henning Urbat Friedrich-Alexander-University Erlangen-Nürnberg
DOI
15:15
25m
Talk
What Is a Monoid?
POPL
Paul Blain Levy University of Birmingham, Morgan Rogers University Sorbonne Paris 13
DOI
14:00 - 15:40
Proof AssistantsPOPL at Nef
Chair(s): Dmitriy Traytel University of Copenhagen
14:00
25m
Talk
A Lazy, Concurrent Convertibility Checker
POPL
Nathanaëlle Courant OCamlPro, Xavier Leroy Collège de France - PSL University
DOI
14:25
25m
Talk
Canonicity for Indexed Inductive-Recursive Types
POPL
András Kovács University of Gothenburg and Chalmers University of Technology
DOI
14:50
25m
Talk
Coco: Corecursion with Compositional Heterogeneous Productivity
POPL
Jaewoo Kim Seoul National University, Yeonwoo Nam Seoul National University, Chung-Kil Hur Seoul National University
DOI
15:15
25m
Talk
Towards Pen-and-Paper-Style Equational Reasoning in Interactive Theorem Provers by Equality Saturation
POPL
Marcus Rossel Barkhausen Institut; TU Darmstadt, Rudi Schneider TU Berlin, Thomas Koehler ICube Lab - CNRS - Université de Strasbourg, Michel Steuwer TU Berlin, Andrés Goens TU Darmstadt
DOI Pre-print
14:00 - 15:40
Program Logics and Semantic FrameworksPOPL at Réfectoire
Chair(s): Guillaume Ambal
14:00
25m
Talk
A Logic for the Imprecision of Abstract Interpretations
POPL
Marco Campion Inria Paris - ENS - Université PSL, Mila Dalla Preda University of Verona, Roberto Giacobazzi University of Arizona, Caterina Urban Inria Paris - ENS - Université PSL
DOI
14:25
25m
Talk
Big-Stop Semantics: Small-Step Semantics in a Big-Step Judgment
POPL
David M. Kahn Denison University, Jan Hoffmann Carnegie Mellon University, Runming Li Carnegie Mellon University
DOI
14:50
25m
Talk
JAX Autodiff from a Linear Logic Perspective
POPL
Giulia Giusti ENS Lyon, Michele Pagani ENS Lyon
DOI
15:15
25m
Talk
U-Turn: Enhancing Incorrectness Analysis by Reversing Direction
POPL
Flavio Ascari University of Konstanz, Roberto Bruni University of Pisa, Roberta Gori Diaprtimento di Informatica, Universita' di Pisa, Italy, Azalea Raad Imperial College London
DOI
15:40 - 16:10
15:40
30m
Coffee break
Break
POPL Catering

16:10 - 17:00
Synthesis 2POPL at Dortoirs
Chair(s): Marco Campion Inria Paris - ENS - Université PSL
16:10
25m
Talk
Nice to Meet You: Synthesizing Practical MLIR Abstract Transformers
POPL
Xuanyu Peng University of California at San Diego, Dominic Kennedy University of Utah, Yuyou Fan University of Utah, Ben Greenman University of Utah, USA, John Regehr University of Utah, Loris D'Antoni University of California at San Diego
DOI
16:35
25m
Talk
Parameterized Infinite-State Reactive Synthesis
POPL
Benedikt Maderbacher Graz University of Technology, Roderick Bloem Graz University of Technology
DOI
16:10 - 17:00
Verified CompilationPOPL at Nef
Chair(s): Clément Pit-Claudel EPFL
16:10
25m
Talk
A Family of Sims with Diverging Interests
POPL
Nicolas Chappe CNRS - Verimag
DOI
16:35
25m
Talk
Endangered by the Language But Saved by the Compiler: Robust Safety via Semantic Back-Translation
POPL
Niklas Mück MPI-SWS, Aina Linn Georges Max Planck Institute for Software Systems (MPI-SWS), Derek Dreyer MPI-SWS, Deepak Garg MPI-SWS, Michael Sammler Institute of Science and Technology Austria
DOI Pre-print
16:10 - 17:00
Security and PrivacyPOPL at Réfectoire
Chair(s): Stephanie Weirich University of Pennsylvania
16:10
25m
Talk
Dependent Coeffects for Local Sensitivity Analysis
POPL
Victor Sannier Univ. Lille - CNRS - Inria - Centrale Lille - UMR 9189 CRIStAL, Patrick Baillot Univ. Lille - CNRS - Inria - Centrale Lille - UMR 9189 CRIStAL
DOI
16:35
25m
Talk
Security Reasoning via Substructural Dependency TrackingDistinguished Paper
POPL
Hemant Gouni Carnegie Mellon University, Frank Pfenning Carnegie Mellon University, USA, Jonathan Aldrich Carnegie Mellon University
DOI Pre-print
17:00 - 18:30
PC Chair's Report and Business MeetingPOPL at Nef
17:00
90m
Meeting
PC Chair's Report and Business Meeting
POPL

19:30 - 22:00
POPL PC and SC DinnerPOPL at Monsieur Arthur restaurant
19:30
2h30m
Dinner
POPL PC and SC dinner
POPL

Fri 16 Jan

Displayed time zone: Brussels, Copenhagen, Madrid, Paris change

10:00 - 10:30
10:00
30m
Coffee break
Break
POPL Catering

10:30 - 12:10
Specification and Verification MethodsPOPL at Dortoirs
Chair(s): Ben Greenman University of Utah, USA
10:30
25m
Talk
Abstraction Functions as Types
POPL
Harrison Grodin Carnegie Mellon University, Runming Li Carnegie Mellon University, Robert Harper Carnegie Mellon University
DOI
10:55
25m
Talk
Foundational Multi-Modal Program Verifiers
POPL
Vladimir Gladshtein , George Pîrlea National University of Singapore, Qiyuan Zhao National University of Singapore, Vitaly Kurin Neapolis University Pafos, Ilya Sergey National University of Singapore
DOI
11:20
25m
Talk
Stateful Differential Operators for Incremental Computing
POPL
DOI
11:45
25m
Talk
The Ghosts of Empires: Extracting Modularity from Interleaving-Based Proofs
POPL
Frank Schüssele University of Freiburg, Matthias Zumkeller University of Freiburg, Miriam Lagunes-Rochin University of Freiburg, Dominik Klumpp LIX - CNRS - École Polytechnique; University of Freiburg
DOI
10:30 - 12:10
Concurrency: Types, Logics, and LibrariesPOPL at Nef
Chair(s): Robbert Krebbers Radboud University Nijmegen
10:30
25m
Talk
All for One and One for All: Program Logics for Exploiting Internal Determinism in Parallel ProgramsDistinguished Paper
POPL
Alexandre Moine New York University, Sam Westrick New York University, Joseph Tassarotti New York University
DOI Pre-print
10:55
25m
Talk
A Verified High-Performance Composable Object Library for Remote Direct Memory Access
POPL
Guillaume Ambal , George Hodgkins University of Colorado, Mark Madler University of Colorado, Gregory Chockler University of Surrey, Brijesh Dongol University of Surrey, Joe Izraelevitz University of Colorodo Boulder, Azalea Raad Imperial College London, Viktor Vafeiadis MPI-SWS
DOI
11:20
25m
Talk
DafnyMPI: A Dafny Library for Verifying Message-Passing Concurrent Programs
POPL
Aleksandr Fedchin Tufts University, Antero Mejr Tufts University, Hari Sundar Tufts University, Jeffrey S. Foster Tufts University
DOI
11:45
25m
Talk
TypeDis: A Type System for Disentanglement
POPL
Alexandre Moine New York University, Stephanie Balzer Carnegie Mellon University, Alex Xu Carnegie Mellon University, Sam Westrick New York University
DOI Pre-print
10:30 - 12:10
Types 2POPL at Réfectoire
Chair(s): Amal Ahmed Northeastern University, USA
10:30
25m
Talk
Di- is for Directed: First-Order Directed Type Theory via Dinaturality
POPL
Andrea Laretto Tallinn University of Technology, Fosco Loregian Tallinn University of Technology, Niccolò Veltri IT University of Copenhagen
DOI
10:55
25m
Talk
Quotient PolymorphismDistinguished Paper
POPL
Brandon Hewer , Graham Hutton University of Nottingham
DOI
11:20
25m
Talk
The Simple Essence of Boolean-Algebraic Subtyping: Semantic Soundness for Algebraic Union, Intersection, Negation, and Equi-recursive Types
POPL
Chun Yin Chau HKUST (The Hong Kong University of Science and Technology), Lionel Parreaux Hong Kong University of Science and Technology
DOI
11:45
25m
Talk
Welterweight Go: Boxing, Structural Subtyping, and Generics
POPL
Raymond Hu Queen Mary University of London, Julien Lange Royal Holloway University of London, Bernardo Toninho Instituto Superior Técnico - University of Lisbon, Philip Wadler University of Edinburgh, Robert Griesemer Google, Keith Randall Google
DOI
12:15 - 14:00
12:15
1h45m
Lunch
Lunch
POPL Catering

12:30 - 14:00
12:30
90m
Lunch
URM Lunch
POPL Catering

14:00 - 15:40
Monads and EffectsPOPL at Dortoirs
Chair(s): Henning Urbat Friedrich-Alexander-University Erlangen-Nürnberg
14:00
25m
Talk
An Equational Axiomatization of Dynamic Threads via Algebraic Effects: Presheaves on Finite Relations, Labelled Posets, and Parameterized Algebraic TheoriesDistinguished Paper
POPL
Ohad Kammar University of Edinburgh, Jack Liell-Cock University of Oxford, Sam Lindley University of Edinburgh, Cristina Matache University of Edinburgh, Sam Staton University of Oxford
DOI
14:25
25m
Talk
Handling Higher-Order Effectful Operations with Judgemental Monadic Laws
POPL
Zhixuan Yang Imperial College London, Nicolas Wu Imperial College London
DOI
14:50
25m
Talk
Rows and Capabilities as Modal Effects
POPL
Wenhao Tang The University of Edinburgh, Sam Lindley University of Edinburgh
DOI
15:15
25m
Talk
The Relative Monadic Metalanguage
POPL
Jack Liell-Cock University of Oxford, Zev Shirazi University of Oxford, Sam Staton University of Oxford
DOI
14:00 - 15:40
Probabilistic ProgrammingPOPL at Nef
Chair(s): Michele Pagani ENS Lyon
14:00
25m
Talk
Optimising Density Computations in Probabilistic Programs via Automatic Loop Vectorisation
POPL
Sangho Lim KAIST, Hyoungjin Lim KAIST, Wonyeol Lee POSTECH, Xavier Rival Inria - CNRS - Ecole Normale Superieure de Paris - PSL University, Hongseok Yang KAIST
DOI
14:25
25m
Talk
Probabilistic Concurrent Reasoning in Outcome Logic: Independence, Conditioning, and InvariantsDistinguished Paper
POPL
Noam Zilberstein Cornell University, Alexandra Silva Cornell University, Joseph Tassarotti New York University
DOI
14:50
25m
Talk
Probabilistic Programming with Vectorized Programmable Inference
POPL
McCoy Reynolds Becker MIT, Mathieu Huot MIT, George Matheos Massachusetts Institute of Technology, Xiaoyan Wang Massachusetts Institute of Technology, Karen Chung Massachusetts Institute of Technology, Colin Smith Massachusetts Institute of Technology, Sam Ritchie Massachusetts Institute of Technology, Rif A. Saurous Google, Alexander K. Lew Yale University, Martin C. Rinard Massachusetts Institute of Technology, Vikash K. Mansinghka Massachusetts Institute of Technology
DOI
15:15
25m
Talk
Tropical Mathematics and the Lambda-Calculus II: Tropical Geometry of Probabilistic Programming Languages
POPL
Davide Barbarossa University of Bath, Paolo Pistone Université Claude Bernard Lyon 1
DOI
14:00 - 15:40
Proof Assistants 2POPL at Réfectoire
Chair(s): Matthieu Sozeau Inria
14:00
25m
Talk
AdapTT: Functoriality for Dependent Type Casts
POPL
Arthur Adjedj ENS Paris Saclay, Université Paris-Saclay, Meven Lennon-Bertrand Inria – Université Paris Cité, Thibaut Benjamin Université Paris-Saclay, CNRS, ENS Paris-Saclay, LMF, Kenji Maillard Inria
DOI
14:25
25m
Talk
Algorithmic Conversion with Surjective Pairing: A Syntactic and Untyped Approach
POPL
Yiyun Liu University of Pennsylvania, Stephanie Weirich University of Pennsylvania
DOI
14:50
25m
Talk
Encode the Cake and Eat It Too: Controlling Computation in Type Theory, LocallyDistinguished Paper
POPL
Yann Leray Nantes Université; Inria, Théo Winterhalter INRIA
DOI
15:15
25m
Talk
Normalisation for First-Class Universe LevelsDistinguished PaperRemote
POPL
Nils Anders Danielsson University of Gothenburg, Naïm Camille Favier Chalmers University of Technology and University of Gothenburg, Ondřej Kubánek Chalmers University of Technology
DOI
15:40 - 16:10
15:40
30m
Coffee break
Break
POPL Catering

16:10 - 17:25
Types 3POPL at Dortoirs
Chair(s): Nicolas Wu Imperial College London
16:10
25m
Talk
A Complementary Approach to Incorrectness Typing
POPL
Celia Mengyue Li University of Bristol, Sophie Pull University of Bristol, Steven Ramsay University of Bristol
DOI
16:35
25m
Talk
A Synthetic Reconstruction of Multiparty Session Types
POPL
David Castro-Perez University of Kent, Francisco Ferreira Royal Holloway, University of London, Sung-Shik Jongmans University of Groningen
DOI
17:00
25m
Talk
Bounded Sort Polymorphism with Elimination Constraints
POPL
Johann Rosain ENS Lyon, Tomás Diaz University of Chile, Kenji Maillard Inria, Matthieu Sozeau Inria, Nicolas Tabareau Inria, Éric Tanter University of Chile, Théo Winterhalter INRIA
DOI
16:10 - 17:25
Automata 2POPL at Nef
Chair(s): Umang Mathur National University of Singapore, Singapore
16:10
25m
Talk
Counting and Sampling Traces in Regular Languages
POPL
Alexis de Colnet TU Wien, Kuldeep S. Meel University of Toronto, Umang Mathur National University of Singapore
DOI Pre-print
16:35
25m
Talk
Parametrised Verification of Intel-x86 Programs
POPL
Parosh Aziz Abdulla Uppsala University; Mälardalen University, Mohamed Faouzi Atig Uppsala University, Ahmed Bouajjani Université Paris Cité, K Narayan Kumar Chennai Mathematical Institute, Prakash Saivasan Institute of Mathematical Sciences
DOI
17:00
25m
Talk
General Decidability Results for Systems with Continuous Counters
POPL
A. R. Balasubramanian Technical University of Munich, Matthew Hague Royal Holloway University of London, Rupak Majumdar MPI-SWS, Ramanathan S. Thinniyam Uppsala University, Georg Zetzsche MPI-SWS
DOI
16:10 - 17:25
Quantum 2POPL at Réfectoire
Chair(s): Jennifer Paykin University of Vermont
16:10
25m
Talk
Generating Compilers for Qubit Mapping and Routing
POPL
Abtin Molavi University of Wisconsin-Madison, Amanda Xu University of Wisconsin-Madison, Ethan Cecchetti University of Wisconsin-Madison, Swamit Tannu University of Wisconsin-Madison, Aws Albarghouthi University of Wisconsin-Madison
DOI
16:35
25m
Talk
On Circuit Description Languages, Indexed Monads, and Resource Analysis
POPL
Ken Sakayori University of Tokyo, Andrea Colledan University of Bologna; Centre Inria d’Université Côte d’Azur, Ugo Dal Lago University of Bologna; Centre Inria d’Université Côte d’Azur
DOI
17:00
25m
Talk
Quantum Circuits Are Just a Phase
POPL
Chris Heunen University of Edinburgh, Louis Lemonnier University of Edinburgh, Christopher McNally Massachusetts Institute of Technology, Alex Rice University of Edinburgh
DOI

Sat 17 Jan

Displayed time zone: Brussels, Copenhagen, Madrid, Paris change

09:00 - 10:30
First SessionWITS at Salle 13
09:00
60m
Keynote
Lean4Lean: Mechanizing the Metatheory of Lean
WITS
Mario Carneiro Chalmers University of Technology
10:00
22m
Talk
Observing Definitional Equality
WITS
András Kovács University of Gothenburg and Chalmers University of Technology
09:00 - 10:30
Opening and KeynoteGiacoFest at Salle 19
Chair(s): Mila Dalla Preda University of Verona
09:10
10m
Talk
Opening
GiacoFest

09:20
70m
Talk
Keynote Speech
GiacoFest

10:30 - 11:00
10:30
30m
Coffee break
Break
POPL Catering

11:00 - 12:30
Session 2WITS at Salle 13
11:00
22m
Talk
Decoupling Resolution from Type Inference
WITS
Lionel Parreaux Hong Kong University of Science and Technology
11:22
22m
Talk
First-Class Refinement Types in Scala
WITS
11:45
22m
Talk
Types as grammars
WITS
Gil Silva LASIGE, University of Lisbon, Bernardo Almeida LASIGE, Faculty of Sciences, University of Lisbon, Diana Costa LASIGE, University of Lisbon, Andreia Mordido University of Lisbon, Diogo Poças Instituto de Telecomunicações, University of Lisbon, Vasco T. Vasconcelos LASIGE, University of Lisbon
12:07
22m
Talk
Omnidirectional type inference for ML
WITS
Alistair O'Brien University of Cambridge, Didier Rémy Inria, Gabriel Scherer Université Paris Cité - Inria - CNRS
11:00 - 12:30
Rocq Developer Session and Mechanized Metatheory in RocqRocqPL at Salle 14
Chair(s): François Pottier Inria
11:00
45m
Panel
Session with the Rocq Development Team
RocqPL
P: Matthieu Sozeau Inria, Yann Leray Nantes Université; Inria, Gaetan Gilbert
11:45
15m
Talk
Rocq CARVe-ing: A Library for Substructural Meta-Theory
RocqPL
Daniel Zackon McGill University, Ryan Kavanagh Université du Québec à Montréal, Alberto Momigliano Università degli Studi di Milano, Brigitte Pientka McGill University
File Attached
12:00
15m
Talk
Scalable Type Inference for Intrinsically-Typed Binders
RocqPL
Max Kurze Barkhausen Institut, Clément Pit-Claudel EPFL, Sebastian Ertel Barkhausen Institute, Dresden
12:15
15m
Talk
Sulfur: Substitution Generation using a Logical Framework
RocqPL
Mathis Bouverot-Dupuis INRIA & École Normale Supérieure, Théo Winterhalter INRIA, Kenji Maillard Inria, Kathrin Stark Heriot-Watt University
File Attached
11:00 - 12:30
Short TalksGiacoFest at Salle 19
Chair(s): Marco Campion Inria Paris - ENS - Université PSL, Michele Pasqua University of Verona
11:00
90m
Talk
Short Talks
GiacoFest

12:30 - 14:00
12:30
90m
Lunch
Lunch
POPL Catering

14:00 - 15:30
Rocq Enhancements and ExtensionsRocqPL at Salle 14
14:00
15m
Talk
A systematic approach to "Well-founded recursion done right"
RocqPL
Herman Geuvers Radboud University Nijmegen, Netherlands, Gijs Pennings Eindhoven University of Technology
File Attached
14:15
15m
Talk
Implementing parametricity in Rocq-ELPI
RocqPL
Cyril Cohen Inria, CNRS, ENS Lyon, UCBL, LIP, Vojtěch Štěpančík Inria
14:30
15m
Talk
Enhancing universe polymorphism for Rocq: Algebraic universes, consistency checking and variance inference
RocqPL
Matthieu Sozeau Inria, Marc Bezem University of Bergen
File Attached
14:45
15m
Talk
Nested Inductive Types for Rocq and Lean
RocqPL
Thomas Lamiaux Nantes Université, Inria, Yannick Forster INRIA, Matthieu Sozeau Inria, Nicolas Tabareau Inria
15:00
15m
Talk
Trocq parametricity translations for inductives
RocqPL
File Attached
15:15
15m
Talk
Verifying Synchronous Dataflow Programs with SMTCoq
RocqPL
Basile Pesin Ecole Nationale de l'Aviation Civile (ENAC)
File Attached
15:30 - 16:00
15:30
30m
Coffee break
Break
POPL Catering

16:00 - 18:00
Session 4WITS at Salle 13
16:00
40m
Keynote
Verifying Dependent Type-checkers
WITS
Meven Lennon-Bertrand Inria – Université Paris Cité
17:00
22m
Talk
Type Narrowing the Hard Way
WITS
Ben Greenman University of Utah, Hanwen Guo University of Utah
17:23
2m
Other
Closing
WITS
Niki Vazou IMDEA Software Institute
16:00 - 18:00
Certified Programs and Proofs in RocqRocqPL at Salle 14
16:00
15m
Talk
Abstract VCG: Tie-breaking rules in VCG mechanism design
RocqPL
Zhan JING Shanghai Jiao Tong University, Pierre Jouvelot
16:15
15m
Talk
Formal Assurance for Railway Interlockings: Verifying Z3 SAT Proofs with Tseitin in Rocq
RocqPL
Harry Bryant Swansea University, Andrew Lawrence Siemens Mobility, Monika Seisenberger Swansea University, Anton Setzer Swansea University
File Attached
16:30
15m
Talk
Formalizing a First-order Differentiable Logic with MathComp
RocqPL
Jairo Miguel Marulanda-Giraldo University of Southampton
16:45
15m
Talk
Recursive Mutexes in Separation Logic
RocqPL
Ke Du , William Mansky University of Illinois Chicago, Paolo G. Giarrusso Delft University of Technology, Gregory Malecha Skylabs AI
17:00
15m
Talk
Towards a Mechanization of the ECMAScript (JavaScript) Proposal "Temporal"
RocqPL
Aria B. Eide University of Bergen, Vebjørn S. Øiestad University of Bergen, Mikhail Barash University of Bergen
File Attached
17:15
15m
Talk
Verification of Templated Code in C++
RocqPL
Gregory Malecha Skylabs AI, David Swasey Riverside Research, Simon Hudon SkyLabs AI
17:30
15m
Talk
Lambda JS à la Carte
RocqPL
Kirill Golubev University of Turku, Mikhail Barash University of Bergen, Jaakko Järvi University of Turku
File Attached
Hide past events