Since September 2020, I am a professor of Computer Science at the Université Gustave Eiffel and a member of the Models and Algortihms team of the Laboratoire d'informatique Gaspard Monge (LIGM).

Before that I was a full time researcher of the CNRS.

Laboratoire d'informatique Gaspard Monge (UMR 8049)
Cité Descartes
5, boulevard Descartes
Champs-sur-Marne
77454 MARNE-LA-VALLEE Cedex 2
France

Tel:+33 1 60 95 77 30
Fax:+33 1 60 95 75 57
Mail: Arnaud.Carayol@univ-mlv.fr

Events

Projects

Conferences

[1]Alin Bostan, Arnaud Carayol, Florent Koechlin and Cyril Nicaud. Weakly-unambiguous Parikh automata and their link to holonomic series.
In 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, pages 114:1-114:16, 2020. [pdf] [doi]
[2]Arnaud Carayol and Matthew Hague. Optimal Strategies in Pushdown Reachability Games.
In 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, pages 42:1-42:14, 2018. [pdf] [doi]
[3]Arnaud Carayol and Stefan Göller. On Long Words Avoiding Zimin Patterns.
In 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pages 19:1-19:13, 2017. [pdf] [doi]
[4]Arnaud Carayol, Christof Löding and Olivier Serre. Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings.
In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2016, New York, NY, USA, July 5-8, 2016, pages 227-236, 2016. [pdf] [doi]
[5]Arnaud Carayol and Zoltán Ésik. An Analysis of the Equational Properties of the Well-Founded Fixed Point (short paper).
In Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR 2016, Cape Town, South Africa, April 25-29, 2016, pages 533-536, 2016. [pdf]
[6]Arnaud Carayol and Olivier Serre. How Good Is a Strategy in a Game with Nature?
In 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, pages 609-620, 2015. [pdf] [doi]
[7]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague and Olivier Serre. C-SHORe: A collapsible approach to higher-order verification.
In ACM SIGPLAN International Conference on Functional Programming, ICFP 2013, Boston, MA, USA - September 25 - 27, 2013, pages 13-24, 2013. [pdf] [doi]
[8]Arnaud Carayol and Olivier Serre. Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection.
In Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, June 25-28, 2012, pages 165-174, 2012. [pdf] [doi]
[9]Arnaud Carayol and Zoltán Ésik. A Context-Free Linear Ordering with an Undecidable First-Order Theory.
In Theoretical Computer Science - 7th IFIP TC 1/WG 2.2 International Conference, TCS 2012, Amsterdam, The Netherlands, September 26-28, 2012. Proceedings, pages 104-118, 2012. [pdf] [doi]
[10]Christopher H. Broadbent, Arnaud Carayol, Matthew Hague and Olivier Serre. A Saturation Method for Collapsible Pushdown Systems.
In Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II, pages 165-176, 2012. [pdf] [doi]
[11]Luca Aceto, Arnaud Carayol, Zoltán Ésik and Anna Ingólfsdóttir. Algebraic Synchronization Trees and Processes.
In Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II, pages 30-41, 2012. [pdf] [doi]
[12]Arnaud Carayol and Cyril Nicaud. Distribution of the number of accessible states in a random deterministic automaton.
In 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pages 194-205, 2012. [pdf] [doi]
[13]Arnaud Carayol, Axel Haddad and Olivier Serre. Qualitative Tree Languages.
In Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS 2011, June 21-24, 2011, Toronto, Ontario, Canada, pages 13-22, 2011. [pdf] [doi]
[14]Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong and Olivier Serre. Recursion Schemes and Logical Reflection.
In Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, 11-14 July 2010, Edinburgh, United Kingdom, pages 120-129, 2010. [pdf] [doi]
[15]Laurent Braud and Arnaud Carayol. Linear Orders in the Pushdown Hierarchy.
In Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II, pages 88-99, 2010. [pdf] [doi]
[16]Arnaud Carayol and Michaela Slaats. Positional Strategies for Higher-Order Pushdown Parity Games.
In Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, pages 217-228, 2008. [pdf] [doi]
[17]Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong and Olivier Serre. Winning Regions of Higher-Order Pushdown Games.
In Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA, pages 193-204, 2008. [pdf] [doi]
[18]Arnaud Carayol and Christof Löding. MSO on the Infinite Binary Tree: Choice and Order.
In Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, pages 161-176, 2007. [pdf] [doi]
[19]Arnaud Carayol and Didier Caucal. The Kleene Equality for Graphs.
In Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, pages 214-225, 2006. [pdf] [doi]
[20]Arnaud Carayol and Christophe Morvan. On Rational Trees.
In Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings, pages 225-239, 2006. [pdf] [doi]
[21]Arnaud Carayol and Antoine Meyer. Linearly Bounded Infinite Graphs.
In Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, pages 180-191, 2005. [pdf] [doi]
[22]Arnaud Carayol. Regular Sets of Higher-Order Pushdown Stacks.
In Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, pages 168-179, 2005. [pdf] [doi]
[23]Arnaud Carayol and Thomas Colcombet. On Equivalent Representations of Infinite Structures.
In Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pages 599-610, 2003. [pdf] [doi]
[24]Arnaud Carayol and Stefan Wöhrle. The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata.
In FSTTCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, Mumbai, India, December 15-17, 2003, Proceedings, pages 112-123, 2003. [pdf] [doi]

Invited Lectures

[25]Arnaud Carayol and Matthew Hague. Saturation algorithms for model-checking pushdown systems.
In Proceedings 14th International Conference on Automata and Formal Languages, AFL 2014, Szeged, Hungary, May 27-29, 2014, pages 1-24, 2014. [pdf] [doi]
[26]Arnaud Carayol. Structures Defined by Higher-Order Recursion Schemes.
In 7th Workshop on Fixed Points in Computer Science, FICS 2010, Brno, Czech Republic, August 21-22, 2010, pages 7, 2010.

Journals

[27]Arnaud Carayol and Olivier Serre. How Good Is a Strategy in a Game With Nature?
ACM Trans. Comput. Log., 213:1-39, 2020. [pdf] [doi]
[28]Arnaud Carayol and Stefan Göller. On Long Words Avoiding Zimin Patterns.
Theory Comput. Syst., 635:926-955, 2019. [pdf] [doi]
[29]Arnaud Carayol, Christof Löding and Olivier Serre. Pure Strategies in Imperfect Information Stochastic Games.
Fundam. Inform., 1604:361-384, 2018. [pdf] [doi]
[30]Arnaud Carayol and Zoltán Ésik. An analysis of the equational properties of the well-founded fixed point.
J. Log. Algebr. Meth. Program., 861:308-318, 2017. [pdf] [doi]
[31]Arnaud Carayol and Olivier Serre. Counting branches in trees using games.
Inf. Comput., 252:221-242, 2017. [pdf] [doi]
[32]Arnaud Carayol and Olivier Serre. Marking shortest paths on pushdown graphs does not preserve MSO decidability.
Inf. Process. Lett., 11610:638-643, 2016. [pdf] [doi]
[33]Arnaud Carayol, Axel Haddad and Olivier Serre. Randomization in Automata on Infinite Trees.
ACM Trans. Comput. Log., 153:24:1-24:33, 2014. [pdf] [doi]
[34]Arnaud Carayol and Zoltán Ésik. The FC-rank of a context-free language.
Inf. Process. Lett., 1138:285-287, 2013. [pdf] [doi]
[35]Carayol, Arnaud, Löding, Christof, Niwinski, Damian and Walukiewicz, Igor. Choice Functions and Well-orderings over the Infinite Binary Tree.
Open Mathematics, 84:662-682, 2010. [pdf] [doi]
[36]Arnaud Carayol and Antoine Meyer. Context-Sensitive Languages, Rational Graphs and Determinism.
Logical Methods in Computer Science, 22:-, 2006. [pdf] [doi]
[37]Arnaud Carayol and Antoine Meyer. Linearly bounded infinite graphs.
Acta Inf., 434:265-292, 2006. [pdf] [doi]
[38]Arnaud Carayol, Daniel Hirschkoff and Davide Sangiorgi. On the representation of McCarthy's amb in the Pi-calculus.
Theor. Comput. Sci., 3303:439-473, 2005. [pdf] [doi]

Chapters in a book

[39]Arnaud Carayol and Olivier Serre. Higher-order recursion schemes and their automata models.
In Handbook of Automata. J.-E. Pin (Ed.), pages 440-477, 2019. [pdf]
[40]Arnaud Carayol and Christof Löding. Uniformization in Automata Theory.
Logic, Methodology and Philosophy of Science - Logic and Science Facing the New Technologies - Proceedings of the 14th International Congress (Nancy), :1-26, 2015. [pdf]

Errata

[41]Arnaud Carayol, Axel Haddad and Olivier Serre. Erratum for "Randomization in Automata on Infinite Trees".
ACM Trans. Comput. Log., 164:36:1-36:2, 2015. [pdf] [doi]

Workshop

[42]Arnaud Carayol and Matthew Hague. Regular Strategies in Pushdown Reachability Games.
In Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings, pages 58-71, 2014. [pdf] [doi]
[43]Arnaud Carayol, Daniel Hirschkoff and Davide Sangiorgi. On the Representation of McCarthy's amb in the Pi-calculus.
In Expressiveness in Concurrency, 10th International Workshop, EXPRESS 2003, Marseille, France, 2 September, 2003, pages 73-89, 2004. [pdf] [doi]

Habilitation Thesis

[44]Arnaud Carayol. Automata, Logics and Games for Infinite Trees.
Habilitation Thesis, Université Paris-Est, 2019. [pdf]

PhD Thesis

[45]Arnaud Carayol. Automates infinis, logiques et langages.
PhD Thesis, University of Rennes 1, France, 2006. [pdf]