Antoine Meyer
Address (mail): LIAFA
Univ. Paris Diderot - Paris 7
Case 7014
75205 Paris Cedex 13, France 		Antoine Meyer
Address (office): 175 rue du Chevaleret
Office 6A13 (6th floor, area A)
75013 Paris, France
Phone: +33 (0)1 44 27 53 92
Fax: +33 (0)1 44 27 68 49
Email: ameyer [at] liafa [dot] jussieu [dot] fr

From September 2006 to August 2009, I have been an assistant professor (maître de conférences) at LIAFA in Paris (France). Since last September, I am now holding a joint Université Paris Est / CNRS chair at the computer science lab in Institut Gaspard Monge. My professional page will eventually be relocated here.

My research interests include the characterization and study of families of finitely presented infinite graphs, in particular from the point of view of automata, languages and logics, and the closely related problem of verifying infinite-state models for computer programs and systems.

Publications

  1. with François Laroussinie and Eudes Petonnet: Counting CTL. Submitted.
  2. with Nutan Limaye and Meena Mahajan: On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. CSR 2008, LNCS 5010, pp. 240-251.
  3. with Arnaud Carayol, Matthew Hague, C.-H. Luke Ong, and Olivier Serre: Winning Regions of Higher-Order Pushdown Games. LICS 2008, pp. 193-204.
  4. with Greta Yorsh, Alex Rabinovich, Mooly Sagiv and Ahmed Bouajjani: A Logic of Reachable Patterns in Linked Data-Structures. Journal of Logic and Algebraic Programming 73(1-2):111-142 (2007). Short version in FoSSaCS 2006, LNCS 3921, pp. 94-110.
  5. Traces of Term-Automatic Graphs. MFCS 2007, LNCS 4708, pp. 489-500.
  6. with Arnaud Carayol: Linearly bounded infinite graphs. Acta Informatica 43(4):265-292 (2006). Short version in MFCS 2005, LNCS 3618 pp. 180 - 191 (pdf).
  7. with Arnaud Carayol: Context-Sensitive Languages, Rational Graphs and Determinism. LMCS 2(2), 2006 (link).
  8. Finitely presented infinite graphs. PhD thesis, IFSIC, Université de Rennes 1, 2005 (in English, in French).
  9. with Ahmed Bouajjani: Symbolic Reachability Analysis of Higher-Order Context-Free Processes. FSTTCS 2004, LNCS 3328 pp. 135 - 147 (with appendix: pdf).
  10. On Term Rewriting Systems Having a Rational Derivation. FoSSaCS 2004, LNCS 2987 pp. 378 - 392 (pdf).

Valid HTML 4.01 + CSS. Last update: December 3, 2009