Arnaud Carayol

According to our database, Arnaud Carayol authored at least 48 papers between 2003 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Random DFA With One Added Transition.

Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud

CoRR, 2024

2023

Games on Graphs.

Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer-Decitre, Romain Brenguier, Arnaud Carayol, John Fearnley, Hugo Gimbert, Florian Horn, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, Mateusz Skomra

CoRR, 2023

One Drop of Non-Determinism in a Random Deterministic Automaton.

Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2021

Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties.

Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre

ACM Trans. Comput. Log., 2021

Collapsible Pushdown Parity Games.

Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre

ACM Trans. Comput. Log., 2021

Higher-order recursion schemes and their automata models.

Arnaud Carayol, Olivier Serre

Proceedings of the Handbook of Automata Theory., 2021

2020

How Good Is a Strategy in a Game with Nature?

Arnaud Carayol, Olivier Serre

ACM Trans. Comput. Log., 2020

Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series.

Alin Bostan, Arnaud Carayol, Florent Koechlin, Cyril Nicaud

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Special issue - Implementation and Application of Automata (CIAA 2017).

Arnaud Carayol, Cyril Nicaud

Theor. Comput. Sci., 2019

On Long Words Avoiding Zimin Patterns.

Arnaud Carayol, Stefan Göller

Theory Comput. Syst., 2019

2018

Pure Strategies in Imperfect Information Stochastic Games.

Arnaud Carayol, Christof Löding, Olivier Serre

Fundam. Informaticae, 2018

Emptiness of Stack Automata is NEXPTIME-complete: A Correction.

Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre

CoRR, 2018

Optimal Strategies in Pushdown Reachability Games.

Arnaud Carayol, Matthew Hague

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017

An analysis of the equational properties of the well-founded fixed point.

Arnaud Carayol, Zoltán Ésik

J. Log. Algebraic Methods Program., 2017

Counting branches in trees using games.

Arnaud Carayol, Olivier Serre

Inf. Comput., 2017

Preface.

David Baelde, Arnaud Carayol, Ralph Matthes, Igor Walukiewicz

Fundam. Informaticae, 2017

C-SHORe: Higher-Order Verification via Collapsible Pushdown System Saturation.

Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre

CoRR, 2017

2016

Marking shortest paths on pushdown graphs does not preserve MSO decidability.

Arnaud Carayol, Olivier Serre

Inf. Process. Lett., 2016

Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings.

Arnaud Carayol, Christof Löding, Olivier Serre

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015

Erratum for "Randomization in Automata on Infinite Trees".

Arnaud Carayol, Axel Haddad, Olivier Serre

ACM Trans. Comput. Log., 2015

Counting Branches in Trees Using Games.

Arnaud Carayol, Axel Haddad, Olivier Serre

CoRR, 2015

2014

Randomization in Automata on Infinite Trees.

Arnaud Carayol, Axel Haddad, Olivier Serre

ACM Trans. Comput. Log., 2014

Saturation algorithms for model-checking pushdown systems.

Arnaud Carayol, Matthew Hague

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Regular Strategies in Pushdown Reachability Games.

Arnaud Carayol, Matthew Hague

Proceedings of the Reachability Problems - 8th International Workshop, 2014

2013

The FC-rank of a context-free language.

Arnaud Carayol, Zoltán Ésik

Inf. Process. Lett., 2013

C-SHORe: a collapsible approach to higher-order verification.

Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

2012

Distribution of the number of accessible states in a random deterministic automaton.

Arnaud Carayol, Cyril Nicaud

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection.

Arnaud Carayol, Olivier Serre

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

A Context-Free Linear Ordering with an Undecidable First-Order Theory.

Arnaud Carayol, Zoltán Ésik

Proceedings of the Theoretical Computer Science, 2012

A Saturation Method for Collapsible Pushdown Systems.

Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Algebraic Synchronization Trees and Processes.

Luca Aceto, Arnaud Carayol, Zoltán Ésik, Anna Ingólfsdóttir

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Qualitative Tree Languages.

Arnaud Carayol, Axel Haddad, Olivier Serre

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010

Recursion Schemes and Logical Reflection.

Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

Linear Orders in the Pushdown Hierarchy.

Laurent Braud, Arnaud Carayol

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Structures Defined by Higher-Order Recursion Schemes.

Arnaud Carayol

Proceedings of the 7th Workshop on Fixed Points in Computer Science, 2010

2008

Positional Strategies for Higher-Order Pushdown Parity Games.

Arnaud Carayol, Michaela Slaats

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Winning Regions of Higher-Order Pushdown Games.

Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2007

MSO on the Infinite Binary Tree: Choice and Order.

Arnaud Carayol, Christof Löding

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006

Automates infinis, logiques et langages.

Arnaud Carayol

PhD thesis, 2006

Context-Sensitive Languages, Rational Graphs and Determinism.

Arnaud Carayol, Antoine Meyer

Log. Methods Comput. Sci., 2006

Linearly bounded infinite graphs.

Arnaud Carayol, Antoine Meyer

Acta Informatica, 2006

The Kleene Equality for Graphs.

Arnaud Carayol, Didier Caucal

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

On Rational Trees.

Arnaud Carayol, Christophe Morvan

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005

On the representation of McCarthy's amb in the Pi-calculus.

Arnaud Carayol, Daniel Hirschkoff, Davide Sangiorgi

Theor. Comput. Sci., 2005

Regular Sets of Higher-Order Pushdown Stacks.

Arnaud Carayol

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2003

On the Representation of McCarthy's <i>amb</i> in the π-calculus.

Arnaud Carayol, Daniel Hirschkoff, Davide Sangiorgi

Proceedings of the 10th International Workshop on Expressiveness in Concurrency, 2003

On Equivalent Representations of Infinite Structures.

Arnaud Carayol, Thomas Colcombet

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata.

Arnaud Carayol, Stefan Wöhrle

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003