Schedule

This is a working draft for the scientific program on July 16-17, 2026. Talk slots are provisionally planned as 35 minutes including questions and changeover, except where noted.

Thursday, July 16

13:00 - 13:30 Arrival and registration
13:30 - 13:45 Welcome
13:45 - 14:30 Non Standard Axiomatic Semantics
Patrick Cousot Courant Institute, New York University
14:30 - 15:05 Alternatives to Iterations with Widening: Policy Iteration and Others
David Monniaux CNRS / Verimag
15:05 - 15:40 Experience Designing a Static Analyzer by Abstract Interpretation with MOPSA
Antoine Miné Sorbonne Université
15:40 - 16:10 Coffee break
16:10 - 16:45 Termination Resilience Static Analysis
Caterina Urban Inria & ENS | PSL
16:45 - 17:20 Who Guards the Guards? Testing Program Analyzers
Anastasia Isychev TU Wien
17:20 - 17:55 Automating Amortised Resource Analysis of Self-Adjusting and Probabilistic Data Structures
Florian Zuleger TU München
17:55 - 18:00 Closing

Friday, July 17

09:00 - 09:35 Interactive Proof Systems for Automated Reasoning
Javier Esparza Technical University of Munich
09:35 - 10:10 Automata and Logics for Asynchronous Hyperproperties
Markus Müller-Olm University of Münster
10:10 - 10:45 Hyperproperties beyond k-Hypersafety
Bernd Finkbeiner CISPA Helmholtz Center for Information Security and Technical University of Munich
10:45 - 11:15 Coffee break
11:15 - 11:50 Quantum Advantage: Proven, Believed, or Demonstrated?
Yanbin Chen TUM-I2
11:50 - 12:25 A Journey through LiSA and its Frontends
Vincenzo Arceri University of Parma
12:25 - 12:45 JLiSA: from zero to podium at SV-COMP
Pietro Ferrara Ca' Foscari University of Venice
12:45 - 14:35 Lunch
14:35 - 14:55 Revue
Helmut Seidl
14:55 - 15:15 Anecdotes
Pietro Ferrara and Vesal Vojdani
15:15 - 15:50 Incremental Static Analysis for Biological Models
Rebecca Ghidini École Normale Supérieure (Paris)
15:50 - 16:25 Lost in Translation: Formal Methods vs. Industrial Reality
Andrea Flexeder Robert Bosch GmbH
16:25 - 16:55 Coffee break
16:55 - 17:30 Verification of Earley's Algorithm, Including Time Bounds
Tobias Nipkow Technical University of Munich
17:30 - 18:15 Roundtable and discussion
18:15 - 18:30 Closing