Arnaud Carayol

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 26

Top Venues

CoRR

ACM Trans. Comput. Log.

Fundam. Informaticae

LICS

University of Rennes 1, France (PHD)

Education History

University of Rennes 1, France

PHD

Publications

Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud
Random DFA With One Added Transition. CoRR (2024)
Arnaud Carayol, Lucien Charamond
The Structure of Trees in the Pushdown Hierarchy. ICALP (2024)
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
Games on Graphs. CoRR (2023)
Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud
One Drop of Non-Determinism in a Random Deterministic Automaton. STACS (2023)
Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre
Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties. ACM Trans. Comput. Log. 22 (2) (2021)
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre
Collapsible Pushdown Parity Games. ACM Trans. Comput. Log. 22 (3) (2021)
Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre
Higher-Order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties. CoRR (2020)
Arnaud Carayol, Olivier Serre
How Good Is a Strategy in a Game With Nature? CoRR (2020)
Arnaud Carayol, Olivier Serre
How Good Is a Strategy in a Game with Nature? ACM Trans. Comput. Log. 21 (3) (2020)
Alin Bostan, Arnaud Carayol, Florent Koechlin, Cyril Nicaud
Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series. ICALP (2020)
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre
Collapsible Pushdown Parity Games. CoRR (2020)
Arnaud Carayol, Cyril Nicaud
Special issue - Implementation and Application of Automata (CIAA 2017). Theor. Comput. Sci. 787 (2019)
Arnaud Carayol, Stefan Göller
On long words avoiding Zimin patterns. CoRR (2019)
Arnaud Carayol, Stefan Göller
On Long Words Avoiding Zimin Patterns. Theory Comput. Syst. 63 (5) (2019)
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
Emptiness of Stack Automata is NEXPTIME-complete: A Correction. CoRR (2018)
Arnaud Carayol, Christof Löding, Olivier Serre
Pure Strategies in Imperfect Information Stochastic Games. Fundam. Informaticae 160 (4) (2018)
Arnaud Carayol, Matthew Hague
Optimal Strategies in Pushdown Reachability Games. MFCS (2018)
Arnaud Carayol, Zoltán Ésik
An analysis of the equational properties of the well-founded fixed point. J. Log. Algebraic Methods Program. 86 (1) (2017)
Arnaud Carayol, Stefan Göller
On Long Words Avoiding Zimin Patterns. STACS (2017)
David Baelde, Arnaud Carayol, Ralph Matthes, Igor Walukiewicz
Preface. Fundam. Informaticae 150 (3-4) (2017)
Arnaud Carayol, Olivier Serre
Counting branches in trees using games. Inf. Comput. 252 (2017)
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
C-SHORe: Higher-Order Verification via Collapsible Pushdown System Saturation. CoRR (2017)
Luca Aceto, Arnaud Carayol, Zoltán Ésik, Anna Ingólfsdóttir
Algebraic Synchronization Trees and Processes. CoRR (2016)
Arnaud Carayol, Zoltán Ésik
An Analysis of the Equational Properties of the Well-Founded Fixed Point. KR (2016)
Arnaud Carayol, Christof Löding, Olivier Serre
Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings. LICS (2016)
Arnaud Carayol, Olivier Serre
Marking shortest paths on pushdown graphs does not preserve MSO decidability. Inf. Process. Lett. 116 (10) (2016)
Arnaud Carayol, Olivier Serre
How Good Is a Strategy in a Game with Nature? LICS (2015)
Arnaud Carayol, Christof Löding, Olivier Serre
Pure Strategies in Imperfect Information Stochastic Games. CoRR (2015)
Arnaud Carayol, Axel Haddad, Olivier Serre
Erratum for "Randomization in Automata on Infinite Trees". ACM Trans. Comput. Log. 16 (4) (2015)
Arnaud Carayol, Zoltán Ésik
An analysis of the equational properties of the well-founded fixed point. CoRR (2015)
Arnaud Carayol, Olivier Serre
Marking Shortest Paths On Pushdown Graphs Does Not Preserve MSO Decidability. CoRR (2015)
Arnaud Carayol, Axel Haddad, Olivier Serre
Counting Branches in Trees Using Games. CoRR (2015)
Arnaud Carayol, Matthew Hague
Regular Strategies in Pushdown Reachability Games. RP (2014)
Arnaud Carayol, Matthew Hague
Saturation algorithms for model-checking pushdown systems. AFL (2014)
Arnaud Carayol, Axel Haddad, Olivier Serre
Randomization in Automata on Infinite Trees. ACM Trans. Comput. Log. 15 (3) (2014)
Arnaud Carayol, Zoltán Ésik
The FC-rank of a context-free language. Inf. Process. Lett. 113 (8) (2013)
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
C-SHORe: a collapsible approach to higher-order verification. ICFP (2013)
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
A Saturation Method for Collapsible Pushdown Systems. ICALP (2) (2012)
Arnaud Carayol, Zoltán Ésik
The FC-rank of a context-free language CoRR (2012)
Arnaud Carayol, Zoltán Ésik
A Context-Free Linear Ordering with an Undecidable First-Order Theory. IFIP TCS (2012)
Luca Aceto, Arnaud Carayol, Zoltán Ésik, Anna Ingólfsdóttir
Algebraic Synchronization Trees and Processes. ICALP (2) (2012)
Arnaud Carayol, Cyril Nicaud
Distribution of the number of accessible states in a random deterministic automaton. STACS (2012)
Arnaud Carayol, Olivier Serre
Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection. LICS (2012)
Arnaud Carayol, Axel Haddad, Olivier Serre
Qualitative Tree Languages. LICS (2011)
Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre
Recursion Schemes and Logical Reflection. LICS (2010)
Laurent Braud, Arnaud Carayol
Linear Orders in the Pushdown Hierarchy. ICALP (2) (2010)
Arnaud Carayol
Structures Defined by Higher-Order Recursion Schemes. FICS (2010)
Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre
Winning Regions of Higher-Order Pushdown Games. LICS (2008)
Arnaud Carayol, Michaela Slaats
Positional Strategies for Higher-Order Pushdown Parity Games. MFCS (2008)
Arnaud Carayol, Christof Löding
MSO on the Infinite Binary Tree: Choice and Order. CSL (2007)
Arnaud Carayol, Antoine Meyer
Linearly bounded infinite graphs CoRR (2007)
Arnaud Carayol, Antoine Meyer
Context-Sensitive Languages, Rational Graphs and Determinism. Log. Methods Comput. Sci. 2 (2) (2006)
Arnaud Carayol, Christophe Morvan
On Rational Trees. CSL (2006)
Arnaud Carayol, Antoine Meyer
Linearly bounded infinite graphs. Acta Informatica 43 (4) (2006)
Arnaud Carayol, Didier Caucal
The Kleene Equality for Graphs. MFCS (2006)
Arnaud Carayol, Antoine Meyer
Context-Sensitive Languages, Rational Graphs and Determinism CoRR (2006)
Arnaud Carayol, Daniel Hirschkoff, Davide Sangiorgi
On the representation of McCarthy's amb in the Pi-calculus. Theor. Comput. Sci. 330 (3) (2005)
Arnaud Carayol
Regular Sets of Higher-Order Pushdown Stacks. MFCS (2005)
Arnaud Carayol, Antoine Meyer
Linearly Bounded Infinite Graphs. MFCS (2005)
Arnaud Carayol, Thomas Colcombet
On Equivalent Representations of Infinite Structures. ICALP (2003)
Arnaud Carayol, Stefan Wöhrle
The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata. FSTTCS (2003)
Arnaud Carayol, Daniel Hirschkoff, Davide Sangiorgi
in the π-calculus. EXPRESS (2003)

Arnaud Carayol.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Arnaud Carayol