Program

Talks marked with 📹 are given remotely.

Monday

• 08:40 - 09:00Registration
• 09:00 - 10:00Invited Talk: Decidability Results for Context-Bounded Analysis of Systems Rupak Majumdar

• 10:00 - 10:30Coffee break


• 10:30 - 10:50The Pseudo-Reachability Problem for Affine Dynamical Systems
  Julian D'Costa, Toghrul Karimov, Rupak Majumdar, Joel Ouaknine, Mahmoud Salamati and James Worrell



• 10:50 - 11:10The Stochastic Arrival Problem (Regular Paper) [Slides]
  Thomas Webster


• 11:10 - 11:30On the Identity Problem for Unitriangular Matrices of Dimension Four
  Ruiwen Dong


• 11:30 - 11:50Skolem Meets Schanuel [Slides]
  Yuri Bilu, Florian Luca, Joris Nieuwveld, Joel Ouaknine, David Purser and James Worrell


• 11:50 - 12:10📹 Linearization, model reduction and reachability in nonlinear ODEs (Regular Paper) [Slides]
  Michele Boreale and Luisa Collodi


• 12:10 - 12:30 On the Skolem Problem for Reversible Sequences [Slides]
  George Kenison

• 12:30 - 14:00Lunch break

• 14:00 - 15:00Invited Talk: SAT-Based Invariant Inference and Its Relation to Concept Learning [Slides]
  Sharon Shoham


• 15:00 - 15:20Coffee break

• 15:20 - 15:40The Variance-Penalized Stochastic Shortest Path Problem [Slides]
  Jakob Piribauer, Ocan Sankur and Christel Baier


• 15:40 - 16:00History-deterministic Timed Automata are Not Determinizable (Regular Paper) [Slides]
  Sougata Bose, Thomas Henzinger, Karoliina Lehtinen, Sven Schewe and Patrick Totzke


• 16:00 - 16:20The Membership Problem for Hypergeometric Sequences with Rational Parameters [Slides]
  Amaury Pouly, Klara Nosan, Mahsa Shirmohammadi and James Worrell


• 16:20 - 16:40Parameterized safety verification of round-based shared-memory systems [Slides]
  Nathalie Bertrand, Nicolas Markey, Ocan Sankur and Nicolas Waldburger


• 16:40 - 17:00A Universal Skolem Set of Positive Lower Density [Slides]
  Florian Luca, Joel Ouaknine and James Worrell


• 17:00 - 17:20On the Undecidability of Loop Analysis [Slides]
  Laura Kovács and Anton Varonka

Tuesday

• 09:00 - 10:00Invited Talk: The Past and Future of Embedded Finite Model Theory
  Michael Benedikt

• 10:00 - 10:30Coffee Break


• 10:30 - 10:50📹 Regular Path Queries in MillenniumDB
  Domagoj Vrgoc and Carlos Rojas


• 10:50 - 11:10📹 On Higher-Order Reachability Games vs May Reachability (Regular Paper) [Slides]
  Kazuyuki Asada, Hiroyuki Katsura and Naoki Kobayashi


• 11:10 - 11:30Higher-Order Nonemptiness Step by Step [Slides]
  Paweł Parys


• 11:30 - 11:50Distributed controller synthesis for deadlock avoidance [Slides]
  Hugo Gimbert, Corto Mascle, Anca Muscholl and Igor Walukiewicz


• 11:50 - 12:10Coefficient Synthesis for Threshold Automata (Regular Paper)
  A. R. Balasubramanian


• 12:10 - 12:30A dynamic programming algorithm for a maximum s-clique set on trees [Slides]
  José Alberto Fernández-Zepeda, Alejandro Flores Lamas, Matthew Hague and Joel Antonio Trejo-Sánchez

• 12:30 - 14:00Lunch break

• 14:00 - 15:00Invited Talk: Post's Correspondence Problem: from computer science to algebra [Slides]
  Laura Ciobanu


• 15:00 - 15:20Coffee Break

• 15:20 - 15:40📹 On the Expressive Power of String Constraints
  Joel Day, Vijay Ganesh, Nathan Grewal and Florin Manea


• 15:40 - 16:00Subsequences in Bounded Ranges: Matching and Analysis Problems (Regular Paper) [Slides]
  Maria Kosche, Tore Koß, Florin Manea and Viktoriya Pak


• 16:00 - 16:20Subsequences With Gap Constraints: Complexity Bounds for Matching and Analysis Problems [Slides]
  Joel Day, Maria Kosche, Florin Manea and Markus L. Schmid


• 16:20 - 16:40On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices [Slides]
  Amaury Pouly, Klara Nosan, Mahsa Shirmohammadi, James Worrell and Sylvain Schmitz


• 16:40 - 17:00📹 Matching Patterns with Variables Under Edit Distance [Slides]
  Pawel Gawrychowski, Florin Manea and Stefan Siemer


• 17:00 - 17:20📹 Program Specialization as a Tool for Solving Word Equations
  Antonina Nepeivoda

• 18:00 - 20:00 Conference Dinner

Wednesday

• 09:00 - 10:00Invited Talk: Recent Advances on the Reachability Problem for VASSes by Examples [Slides]
  Wojciech Czerwiński

• 10:00 - 10:30Coffee Break


• 10:30 - 10:50📹 Pairwise Reachability Oracles and Preservers under Failures
  Diptarka Chakraborty, Kushagra Chatterjee and Keerti Choudhary


• 10:50 - 11:10Unambiguity and Fewness for Nonuniform Families of Polynomial-Size Nondeterministic Finite Automata (Regular Paper) [Slides]
  Tomoyuki Yamakami


• 11:10 - 11:30Weak Bisimulation Finiteness of Pushdown Systems With Deterministic Epsilon-Transitions Is 2-EXPTIME-Complete [Slides]
  Paweł Parys and Stefan Göller


• 11:30 - 11:50📹 Canonization of Reconfigurable PT Nets in Maude (Regular Paper) [Slides]
  Lorenzo Capra


• 11:50 - 12:10📹 What can oracles teach us about the ultimate fate of life?
  Ville Salo and Ilkka Törmä


• 12:10 - 12:30Universal Complexity Bounds Based on Value Iteration and Application to Entropy Games [Slides]
  Xavier Allamigeon, Stephane Gaubert, Ricardo Katz and Mateusz Skomra

Talks marked with 📹 are given remotely.