Continuing the tradition of previous years, POPL 2026 will include a program of tutorials covering topics relevant to the POPL community. Please read the call for tutorials if you’re interested in presenting a tutorial on the tool or topic of your choice.
This program is tentative and subject to change.
Sun 11 JanDisplayed time zone: Brussels, Copenhagen, Madrid, Paris change
09:00 - 10:30 | |||
09:00 90mTutorial | Creusot: Formal verification of Rust programs Tutorials Li-yao Xia LMF, Inria, Université Paris-Saclay, Jacques-Henri Jourdan CNR, LMF, 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 | ||
09:00 - 10:30 | |||
09:00 90mTutorial | 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 | |||
11:00 90mTutorial | Creusot: Formal verification of Rust programs Tutorials Li-yao Xia LMF, Inria, Université Paris-Saclay, Jacques-Henri Jourdan CNR, LMF, 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 | ||
11:00 - 12:30 | |||
11:00 90mTutorial | 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 | ||
14:00 - 15:30 | |||
14:00 90mTutorial | Verifying Probabilistic Programs Using Separation Logic Tutorials Alejandro Aguirre Aarhus University, Simon Oddershede Gregersen New York University, Philipp G. Haselwarter Aarhus University | ||
14:00 - 15:30 | |||
14:00 90mTutorial | 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 | |||
16:00 90mTutorial | Verifying Probabilistic Programs Using Separation Logic Tutorials Alejandro Aguirre Aarhus University, Simon Oddershede Gregersen New York University, Philipp G. Haselwarter Aarhus University | ||
16:00 - 17:30 | |||
16:00 90mTutorial | Discrete and Continuous Models for Concurrent Systems: From Petri Nets to Directed Spaces Tutorials Uli Fahrenberg Université Paris-Saclay, CNRS, ENS Paris-Saclay, LMF | ||
Mon 12 JanDisplayed time zone: Brussels, Copenhagen, Madrid, Paris change
09:00 - 10:30 | |||
09:00 90mTutorial | 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 , Adharsh Kamath UIUC | ||
11:00 - 12:30 | |||
11:00 90mTutorial | 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 , Adharsh Kamath UIUC | ||
14:00 - 15:30 | |||
14:00 90mTutorial | 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 | |||
14:00 90mTutorial | Veil: Automated and Interactive Verification of Transition Systems Tutorials | ||
16:00 - 17:30 | |||
16:00 90mTutorial | 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 | |||
16:00 90mTutorial | Veil: Automated and Interactive Verification of Transition Systems Tutorials | ||
Tue 13 JanDisplayed time zone: Brussels, Copenhagen, Madrid, Paris change
09:00 - 10:30 | |||
09:00 90mTutorial | Analyzing Shell Scripts Tutorials Michael Greenberg Stevens Institute of Technology, Konstantinos Kallas University of California, Los Angeles, Nikos Vasilakis Brown University | ||
11:00 - 12:30 | |||
11:00 90mTutorial | Analyzing Shell Scripts Tutorials Michael Greenberg Stevens Institute of Technology, Konstantinos Kallas University of California, Los Angeles, Nikos Vasilakis Brown University | ||
14:00 - 15:30 | |||
14:00 90mTutorial | Is Program Synthesis Soluble in Large Language Models? Tutorials Nathanaël Fijalkow CNRS, LaBRI, University of Bordeaux | ||
16:00 - 17:30 | |||
16:00 90mTutorial | Is Program Synthesis Soluble in Large Language Models? Tutorials Nathanaël Fijalkow CNRS, LaBRI, University of Bordeaux | ||
Unscheduled Events
| Not scheduled Talk | test1 Tutorials Yannick Zakowski Inria | ||
| Not scheduled Talk | test2 Tutorials |
List of Tutorials
Call For Tutorials
The 53rd ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2026) will be held in Rennes, France.
POPL provides a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation, and verification of programming languages, programming systems, and programming abstractions.
Tutorials for POPL 2026 are solicited on any topic relevant to the POPL community. We particularly encourage submissions of introductory tutorials that make the research presented at POPL more accessible to the participants.
Tutorials will be held on Jan 11–13, 2026. The expected length of a tutorial is 3 hours, including questions and discussion (Q&A).
Submission details
- Deadline for submission: October 10th, 2025
- Notification of acceptance: October 24th, 2025
A tutorial proposal should provide the following information:
- Tutorial title
- Presenter(s), affiliation(s), and contact information
- 1-3 page description (for evaluation). This should include the objectives, topics to be covered, presentation approach, target audience, prerequisite knowledge, and if the tutorial was previously held, the location (i.e. which conference), date, and number of attendees if available.
- 1-2 paragraph abstract suitable for tutorial publicity.
- 1-paragraph biography suitable for tutorial publicity.
Proposals must be submitted by email to Robert Rand (rand@uchicago.edu) and Alan Schmitt (alan.schmitt@inria.fr) with the subject line “POPL 2026 Tutorial Proposal: [tutorial name]”. The proposal should be attached as a PDF, docx, or txt file.
Further information
Any questions regarding POPL 2026 tutorials should be addressed to the workshops chairs, Robert Rand (rand@uchicago.edu) and Alan Schmitt (alan.schmitt@inria.fr).