I am a full time researcher of the CNRS in the Models and Algortihms team of the Laboratoire d'informatique Gaspard Monge (LIGM) of Université Paris-Est Marne-la-Vallée .

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] Arnaud Carayol and Zoltán Ésik. An analysis of the equational properties of the well-founded fixed point. 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.
[2] Arnaud Carayol, Christof Loeding, and Olivier Serre. Automata on infinite trees with equality and disequality constraints between siblings. In To appear in the proceedings of 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2016, 2016.
[3] 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.
[4] 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.
[5] 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. Invited speaker.
[6] Christopher Broadbent, Arnaud Carayol, Matthew Hague, and Olivier Serre. C-shore: A collapsible approach to higher-order verification. In Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming, ICFP '13, pages 13--24, New York, NY, USA, 2013. ACM.
[7] 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, volume 7392, pages 30--41. Springer, 2012.
[8] 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, volume 7392, pages 165--176. Springer, 2012.
[9] 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, volume 14, pages 194--205. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012.
[10] Arnaud Carayol and Zoltán Ésik. A context-free linear ordering with an undecidable first-order theory. In Proceedings of the 7th IFIP International Conference On Theoretical Computer Science (TCS 2012), IFIP Advances in Information and Communication Technology, pages 104--118, 2012.
[11] Arnaud Carayol, Axel Haddad, and Olivier Serre. Qualitative tree languages. In 26th Annual IEEE Symposium on Logic In Computer Science (LICS'11), pages 13--22, 2011.
[12] Laurent Braud and Arnaud Carayol. Linear orders in the pushdown hierarchy. In 30th International Colloquium on Automata, Languages and Programming (ICALP'10), pages 88--99, 2010.
[13] Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, and Olivier Serre. Recursion schemes and logical reflection. In 25rd Annual IEEE Symposium on Logic In Computer Science (LICS'10), pages 120--129, 2010.
[14] Arnaud Carayol. Structures defined by higher-order recursion schemes. In at the 7th Workshop on Fixed Points in Computer Science, 2010. Invited speaker.
[15] Arnaud Carayol and Michaela Slaats. Positional Strategies for Higher-Order Pushdown Parity Games. In E. Ochmanski and J. Tyskiewicz, editors, 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS'08), volume 5162 of LNCS, pages 217--228. Springer-Verlag, 2008.
[16] Arnaud Carayol, Matthew Hague, Antoine Meyer, Luke Ong, and Olivier Serre. Winning regions of higher-order pushdown games. In 23rd Annual IEEE Symposium on Logic In Computer Science (LICS'08), pages 193--204. IEEE Computer Society Press, 2008.
[17] Arnaud Carayol and Christof Löding. MSO on the Infinite Binary Tree: Choice and Order. In Jacques Duparc and Thomas A. Henzinger, editors, 16th EACSL Annual Conference on Computer Science and Logic (CSL'07), volume 4646 of LNCS, pages 161--176. Springer-Verlag, September 2007.
[18] Arnaud Carayol and Christophe Morvan. On Rational Trees. In Zoltán Ésik, editor, 20th International Workshop on Computer Science Logic (CSL'06), volume 4207 of LNCS, pages 225--239, Szeged, Hungary, September 2006. Springer-Verlag.
[19] Arnaud Carayol and Didier Caucal. The Kleene Equality for Graphs. In Rastislav Kralovic and Pawel Urzyczyn, editors, 31st International Symposium on Mathematical Foundations of Computer Science (MFCS'06), volume 4162 of LNCS, pages 214--225. Springer-Verlag, August 2006.
[20] Arnaud Carayol. Regular Sets of Higher-Order Pushdown Stacks. In Joanna Jedrzejowicz and Andrzej Szepietowski, editors, 30th International Symposium on Mathematical Foundations of Computer Science (MFCS'05), volume 3618 of LNCS, pages 168--179. Springer-Verlag, August 2005.
[21] Arnaud Carayol and Antoine Meyer. Linearly Bounded Infinite Graphs. In Joanna Jedrzejowicz and Andrzej Szepietowski, editors, 30st International Symposium on Mathematical Foundations of Computer Science (MFCS'05), volume 3618 of LNCS, pages 180--191. Springer-Verlag, August 2005.
[22] Arnaud Carayol and Stefan Wöhrle. The Caucal Hierarchy of Infinite Graphs in Terms of Logic. In Paritosh K. Pandya and Jaikumar Radhakrishnan, editors, 23rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'03), volume 2914 of LNCS, pages 112--123. Springer-Verlag, December 2003.
[23] Arnaud Carayol and Thomas Colcombet. On Equivalent Representations of Infinite Structures. In Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, and Gerhard J. Woeginger, editors, 30th International Colloquium on Automata, Languages and Programming (ICALP'03), volume 2719 of LNCS, pages 599--610. Springer-Verlag, June 2003.

Journals

[1] Arnaud Carayol and Olivier Serre. Marking shortest paths on pushdown graphs does not preserve MSO decidability. Inf. Process. Lett., 116(10):638--643, 2016.
[3] Arnaud Carayol and Christof Loeding. Uniformization in automata theory. In Logic, Methodology and Philosophy of Science - Proceedings of the 14th Internatinal Congress, Nancy, 2011, 2015.
[4] Arnaud Carayol, Axel Haddad, and Olivier Serre. Randomization in automata on infinite trees. ACM Trans. Comput. Log., 15(3):24, 2014.
[5] Arnaud Carayol and Zoltán Ésik. The FC-rank of a context-free language. Inf. Process. Lett., 113(8):285--287, 2013.
[6] Arnaud Carayol, Christof Loeding, Damian Niwinski, and Igor Walukiewicz. Choice Functions and Well-Orderings over the Infinite Binary Tree. Central European Journal of Mathematics, 8(4):662--682, 2010.
[7] Arnaud Carayol and Antoine Meyer. Linearly bounded infinite graphs. Acta Informatica, 43(4):265--292, November 2006.
[8] Arnaud Carayol and Antoine Meyer. Context-Sensitive Languages, Rational Graphs and Determinism. Logical Methods in Computer Science, 2(2), 2006. electronic version (24 pp.).
[9] Arnaud Carayol, Daniel Hirschkoff, and Davide Sangiorgi. On the representation of McCarthy's amb in the Pi-calculus. Theoretical Computer Science, 330(3):439--473, 2005. Selected papers of the 10th international workshop on expressiveness in concurrency (EXPRESS 2003).

Thesis

[1] Arnaud Carayol. Automates infinis, logiques et langages. Thèse de doctorat, Université de Rennes 1, December 2006.