10-12 Mar 2010
Paris, France
Workshop on Higher-Order Recursion Schemes & Pushdown Automata
10-12 March 2010
Paris, France
http://www.liafa.jussieu.fr/~serre/WorkshopSchemes
*** Subject ***
The Workshop on Higher-Order Recursion Schemes and Pushdown Automata will b
e an
opportunity to assess and disseminate recent advances in higher-order recur
sion
schemes, higher-order pushdown automata, related models and their applicati
ons.
It aims to promote interaction and collaboration between experts in these a
reas,
and stimulate interest from researchers in related fields.
*** Important Dates ***
Registration by the 28th of February.
Workshop the 10th (afternoon only), 11th and 12th (morning only) of March 2
010.
*** Confirmed Speakers ***
Achim Blumensath (Technische Universität Darmstadt)
A Pumping Lemma for Higher-order Pushdown Automata.
Arnaud Carayol (LIGM — Université Paris-Est & CNRS)
Linear Orders in the Pushdown Hierarchy.
Didier Caucal (LIGM — Université Paris-Est & CNRS)
An Extension of the Pushdown Hierarchy.
Bruno Courcelle (Université Bordeaux 1 & Institut Universitaire de Fra
nce)
Syntactic Tools for Equivalence Problems.
Zoltán Ésik (University of Szeged)
To be announced.
Irène Guessarian (LIAFA & Université Paris 6)
Program schemes: early results about semantics.
Alexander Kartzow (Technische Universität Darmstadt)
Collapsible Pushdown Graphs of Level 2 are Tree-Automatic.
Naoki Kobayashi (Tohoku University)
Types and Recursion Schemes for Higher-Order Program Verification.
Christof Löding (RWTH Aachen)
Finite Set Interpretations and Tree Automatic Structures of Higher Order.
Luke Ong (Oxford University Computing Laboratory)
Recursion Schemes and Collapsible Pushdown Automata.
Paweł Parys (Warsaw University)
To be announced.
Sylvain Salvati (INRIA Bordeaux Sud-Ouest, Université de Bordeaux, LaB
RI)
Extending Recognizability to the Simply Typed lambda-Calculus.
Géraud Sénizergues (Université Bordeaux 1)
Automata on Free Groups and Regular Sets of Words of Level k.
Olivier Serre (LIAFA — Université Paris 7 & CNRS)
Applications of the Equi-expressivity Theorem.
Balaguru Srivathsan (LaBRI)
Singleton Theorem using Models.
Colin Stirling (School of Informatics, University of Edinburgh)
Equivalence and Observational Equivalence Problems.
Igor Walukiewicz (LaBRI — Université Bordeaux 1 & CNRS)
A Model-Theoretic Approach to Model Checking Recursion Schemes.
*** Registration Fees & Financial Support ***
There will be no registration fee.
We will be able to cover travel and accomodation costs for a limited number
of
participants (especially students).
For more information on this support, please contact Olivier Serre.
*** Sponsors ***
The workshop is sponsored by the following Research Networking Programmes o
f
the European Science Foundation:
- Automata: from Mathematics to Applications (AutoMathA)
- Games for Design and Verification (GAMES)
*** Organisers ***
Arnaud Carayol (Arnaud.Carayol@univ-mlv.fr)
Luke Ong (lo@comlab.ox.ac.uk)
Olivier Serre (Olivier.Serre@liafa.jussieu.fr)
Paweł Urzyczyn (urzy@mimuw.edu.pl)