Note: Participation is based on invitations. Due to the limited capacity of the room, we unfortunately cannot accept further
registrations.
Alex Berlea
Henrik Björklund
Mikolaj Bojanczyk
Iovka Boneva
Thomas Colcombet
Hubert Comon-Lundh
Claire David
Emmanuel Filiot
Remi Gilleron
Amaury Habrard
Hendrik Jan Hoogeboom
Wong Karianto
Christof Loeding
Denis Lugiez
Sebastian Maneth
Wim Martens
Filip Murlak
Anca Muscholl
Joachim Niehren
Frank Neven
Nicolas Perrin
Thomas Perst
Mathias Samuelides
Thomas Schwentick
Luc Segoufin
Helmut Seidl
Jean-Marc Talbot
Wolfgang Thomas
Sophie Tison
Igor Walukiewicz
Thomas Wilke
Wednesday |
||
| 13:00 - 14:00 | Reception | |
| 14:00 - 14:15 | Opening | |
| 14:15 - 15:15 | Christof Loeding: Automata for Unranked Trees (tutorial) | |
| 15:15 - 15:45 | Coffee | |
| 15:45 - 16:45 | Wofgang Thomas: Fundamentals on Logics over Trees (tutorial) | |
| 17:00 - 18:00 | Luc Segoufin: Regular tree languages definable in FO and FO+MOD | |
| Igor Walukiewicz: Unranked Tree Algebra | ||
Thursday |
||
| 9:00 - 10:00 | Frank Neven: Tree Automata and XML (tutorial) | |
| 10:00 - 10:30 | Helmut Seidl: Type-Checking Macro Tree Transducers in Polynomial Time | |
| 10:30 - 11:00 | Coffee | |
| 11:00 - 12:00 | Sebastian Maneth: Open Problems Session | |
| 12:00 - 12:30 | Alex Berlea: Online Evaluation of Regular Tree Queries | |
| 14:00 - 15:00 | Anca Muscholl: Logics and automata with infinite alphabets (tutorial) | |
| 15:00 - 15:30 | Coffee | |
| 15:30 - 17:00 | Wim Martens: Minimization Problem for Deterministic Unranked Tree Automata | |
| Joachim Niehren: Learning Tree Automata: Squirrel | ||
| Rémi Gilleron: On probabilistic models for trees | ||
| 19:30 - | Dinner | |
Friday |
||
| 9:00 - 10:00 | Mikołaj Bojańczyk: Tree-Walking Automata (tutorial) | |
| 10:00 - 10:30 | Hendrik Jan Hoogeboom: Nested Pebbles and Transitive Closure | |
| 10:30 - 11:00 | Coffee | |
| 11:00 - 12:00 | Thomas Schwentick: Pebble Automata | |
| Thomas Wilke: Tree Automata and Tree Transducers for Analyzing Cryptographic Protocols | ||
| 13:30 - 14:30 | Hubert Comon-Lundh: Examples of Applications of Tree Automata to Security Protocols | |
| Jean Marc Talbot: TQL and Tree Automata (Unordered Unbounded Case) | ||
| 14:30 | Closing and coffee |