Saturday (September 23)

8:45 - 9:00
Welcome

09:00 - 10:00
Azalea Raad
Invited talk: Under-approximation for Scalable Bug Detection
10:00 - 10:20
Coffee break

10:20 - 11:20
Myrthe Spronck
Process-Algebraic Models of Multi-Writer Multi-Reader Non-Atomic Registers, and Adding Liveness Properties
11:20 - 11:40
Lucie Guillou
A Communication Restriction on Ad Hoc Networks
11:40 - 12:00
Corto Mascle
Reconfigurable broadcast networks with registers
12:00 - 12:20
Mathieu Lehaut
Understanding the Gain of Reconfigurable Communication
12:20 - 13:45
Lunch

13:45 - 14:45
Arka Ghosh
Orbit-finite Linear Programming
14:45 - 15:05
Radosław Piórkowski
Deterministic separability of register automata through synthesis games.
15:05 - 15:25
Jan Martens
Witnessing inequivalence of DFAs using invariants
15:25 - 15:45
Tansholpan Zhanabekova
Deciding What is Good-for-MDPs
15:45 - 16:00
Coffee break

16:00 - 16:20
Eren Keskin
Separability and Non-Determinizability of WSTS
16:20 - 16:40
Sougata Bose
Computing Value of Concurrent Mean-payoff games
16:40 - 17:00
Roland Guttenberg
Geometry of VAS and Weakly-Computable Functions
17:00 - 18:00

Open problem session