PROGRAM

The workshop takes place in the ICT building (see DLT Conference Site), in lecture room β.

Saturday 7 July

10:00-10:30 Registration + COFFEE
10:30-11:30 Javier Esparza (Invited)
Symbolic Reachability in Boolean Programs
11.30-12.00 Anil Seth An Alternative Construction in Symbolic Reachability Analysis of Second Order Pushdown Automata
12.00-12.30 Alexei Lisitsa and Andrei Nemytykh Reachability Analysis in Verification via Supercompilation.
12:30-14.00 LUNCH
14:00-15:00 Vincent Blondel (Invited)
Products of Matrices and Reachability of their Optimal Rate of Growth
15:00-15.30 Raphael Jungers and Vincent Blondel Is the Joint Spectral Radius of Rational Matrices Reachable by a Finite Product?
15.30 - 16:00 COFFEE
16:00-17:00 Christian Choffrut (Invited)
Weakening Presburger Arithmetic

Sunday 8 July

10.00-11.00 Oscar Ibarra (Invited)
On Counter Machines, Diophantine Equations, and Reachability Problems
11.00-11.30 COFFEE
11.30-12.00 Hsu-Chun Yen Decidability and Complexity Analysis of Forbidden State Problems for Discrete Event Systems.
12.00-12.30 Maurice Margenstern The finite tiling problem is undecidable in the hyperbolic plane.
12:30-13.00 Oleksiy Kurganskyy, Igor Potapov and Fernando Sancho Reachability problems in low-dimensional iterative maps.
13.00-13.15 Closing