Accepted presentations

Presentations are expected to be no more than 9 minutes including questions.


Student Session (A) [Wednesday, 16:00-17:30]

  • (16:00) Henry Sinclair-Banks. Coverability in 2-VASS with One Unary Counter
  • (16:10) Ritam Raha. Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic
  • (16:20) Alexandre Terefenko. Multi-player attack trees
  • (16:30) Muqsit Azeem. Optimistic and Topological Value Iteration for Simple Stochastic Games
  • (16:40) Kush Grover. Guaranteed Trade-Offs in Dynamic Information Flow Tracking Games
  • (16:50) Paul Hannibal. Decidability Results for Petri Games
  • (17:00) David Julien. End-to-end Statistical Model Checking for Parametric ODE Models
  • (17:10) Rajarshi Roy. Learning Linear Temporal Formulas from Specification Sketches
  • (17:20) Corto Mascle. Distributed control of asynchronous systems with restricted strategies


Student Session (B) [Friday, 14:00-15:30]

  • (14:00) Lucas Bueri. On an Invariance Problem for Parameterized Concurrent Systems
  • (14:10) Philip Offtermatt. The complexity of soundness in workflow nets
  • (14:20) Christoph Welzel. Inductive invariants for regular transition systems
  • (14:30) Ramesh Krishnamurthy. A Framework for the Competitive Analysis of Model-Predictive Controllers
  • (14:40) Steffan Sølvsten. Decision Diagrams in External Memory
  • (14:50) Nicolas Waldburger. Parameterized safety verification of round-based shared-memory systems
  • (15:00) Benjamin Bordais. Characterizing safe local interactions in concurrent Reachability, Büchi and co-Büchi games
  • (15:10) K. S. Thejaswini. A Symmetric Attractor Decomposition Lifting Algorithm for Parity Games
  • (15:20) Irmak Saglam. Justification Graphs for Parity Games under Strong Transition Fairness


Student Session (C) [Friday, 16:00-17:20]

  • (16:00) Julie Parreaux. Playing Stochastically in Weighted Timed Games to Emulate Memory
  • (16:10) Riccardo Romanello. Heisenberg-Inspired Quantum Automata
  • (16:20) Sarah Larroze. Partial-order reduction methods for the verification of networks of timed automata
  • (16:30) Gianluca Redondi. SMT-based verification of parameterized systems
  • (16:40) Stefanie Mohr. Exploring Linear Dependencies in Neural Networks for Bisimulation
  • (16:50) Andrei Draghici. Deciding the existential fragment of (N,+,<,Vp,2^x) using a new class of counter automata
  • (17:00) Klara Nosan. The Membership Problem for Hypergeometric Sequences with Rational Parameters
  • (17:10) Nicolas Heurtel. LOv-Calculus: A Graphical Language for Linear Optical Quantum Circuits

News

  • June 3, 2022: The registration has closed
  • June 3, 2022: The social event has been announced
  • May 17, 2022: Accepted presentations and schedule are now online
  • April 27, 2022: Corrected early bird date
  • Mar 9, 2022: Program online
  • Feb 17, 2022: Registration link online (Closed)
  • Feb 17, 2022: Speaker abstract online
  • Dec 13, 2021: All speakers announced
  • Dec 8, 2021: Dates and speakers announced
  • Nov 1, 2021: We are online

Important Dates

All dates are Anywhere on Earth.