Program
SPIN 2026 is co-located with ETAPS 2026. Session rooms and any updates after the initial publication of this schedule are given on the ETAPS website. Paper presentations are 30 minutes and invited talks are 60 minutes, including questions.
| Time | Wednesday, 15 April | Thursday, 16 April |
|---|---|---|
| 09:00–10:00 | ETAPS Invited Talk | ETAPS Invited Talk |
| 10:00–10:30 | Coffee break | Coffee break |
| 10:30–12:30 | Invited speaker: Eva Darulova (Working) Principles and (Open) Challenges in Automated Floating-Point Verification Shijie Lin and Tayssir Touilli: Control Sensitive Reachability Analysis of Upper-Stack Manipulating Binary Code Arend Rensink: Visualising CTL witnesses and counterexamples |
Invited speaker: Sebastian Junges Satisfiability-Modulo-Probabilistic Model Checking: Synthesising Robust & Concise Strategies under Uncertainty Ömer Şakar, Soham Chakraborty, Marieke Huisman and Anton Wijs: Deductive Verification of Weak Memory Programs with View-based Protocols Wander Nauta, Marcus Gerhold and Marieke Huisman: Crash-free Deductive Verifiers |
| 12:30–14:00 | Lunch break | Lunch break |
| 14:00–16:00 | ETAPS invited tutorial | Invited speaker: Laura Kovács Learning and Proving Array Invariants Ravindra Metta, Hrishikesh Karmarkar, Kumar Madhukar, Supratik Chakraborty and Samarjit Chakraborty: Recurrence-seeking Tests for Non-termination |
| 16:00–16:30 | Coffee break | Coffee break |
| 16:30–17:30 | Joanna Delicaris, Erika Abraham and Anne Remke: Minimum Reachability Probabilities in Rectangular Automata with Random Clocks Shounak Saha and Arpit Sharma: Model Checking of State Based Randomized Systems using Probabilistic Process Algebraic Tools |
Accepted papers
- Shijie Lin and Tayssir Touilli: Control Sensitive Reachability Analysis of Upper-Stack Manipulating Binary Code
- Arend Rensink: Visualising CTL witnesses and counterexamples
- Joanna Delicaris, Erika Abraham and Anne Remke: Minimum Reachability Probabilities in Rectangular Automata with Random Clocks
- Shounak Saha and Arpit Sharma: Model Checking of State Based Randomized Systems using Probabilistic Process Algebraic Tools
- Ömer Şakar, Soham Chakraborty, Marieke Huisman and Anton Wijs: Deductive Verification of Weak Memory Programs with View-based Protocols
- Wander Nauta, Marcus Gerhold and Marieke Huisman: Crash-free Deductive Verifiers
- Ravindra Metta, Hrishikesh Karmarkar, Kumar Madhukar, Supratik Chakraborty and Samarjit Chakraborty: Recurrence-seeking Tests for Non-termination