Arnaud Carayol

According to our database1, Arnaud Carayol
  • authored at least 46 papers between 2003 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
An analysis of the equational properties of the well-founded fixed point.
J. Log. Algebr. Meth. Program., 2017

Counting branches in trees using games.
Inf. Comput., 2017

Preface.
Fundam. Inform., 2017

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

On Long Words Avoiding Zimin Patterns.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

2016
Marking shortest paths on pushdown graphs does not preserve MSO decidability.
Inf. Process. Lett., 2016

Algebraic Synchronization Trees and Processes.
CoRR, 2016

Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

An Analysis of the Equational Properties of the Well-Founded Fixed Point.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

2015
Erratum for "Randomization in Automata on Infinite Trees".
ACM Trans. Comput. Log., 2015

Marking Shortest Paths On Pushdown Graphs Does Not Preserve MSO Decidability.
CoRR, 2015

Pure Strategies in Imperfect Information Stochastic Games.
CoRR, 2015

Counting Branches in Trees Using Games.
CoRR, 2015

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

How Good Is a Strategy in a Game with Nature?
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014
Randomization in Automata on Infinite Trees.
ACM Trans. Comput. Log., 2014

Saturation algorithms for model-checking pushdown systems.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Regular Strategies in Pushdown Reachability Games.
Proceedings of the Reachability Problems - 8th International Workshop, 2014

2013
The FC-rank of a context-free language.
Inf. Process. Lett., 2013

C-SHORe: a collapsible approach to higher-order verification.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

2012
The FC-rank of a context-free language
CoRR, 2012

Distribution of the number of accessible states in a random deterministic automaton.
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.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

A Context-Free Linear Ordering with an Undecidable First-Order Theory.
Proceedings of the Theoretical Computer Science, 2012

A Saturation Method for Collapsible Pushdown Systems.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Algebraic Synchronization Trees and Processes.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Qualitative Tree Languages.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010
Recursion Schemes and Logical Reflection.
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

Linear Orders in the Pushdown Hierarchy.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Structures Defined by Higher-Order Recursion Schemes.
Proceedings of the 7th Workshop on Fixed Points in Computer Science, 2010

2008
Positional Strategies for Higher-Order Pushdown Parity Games.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Winning Regions of Higher-Order Pushdown Games.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2007
Linearly bounded infinite graphs
CoRR, 2007

MSO on the Infinite Binary Tree: Choice and Order.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006
Automates infinis, logiques et langages.
PhD thesis, 2006

Context-Sensitive Languages, Rational Graphs and Determinism.
Logical Methods in Computer Science, 2006

Context-Sensitive Languages, Rational Graphs and Determinism
CoRR, 2006

Linearly bounded infinite graphs.
Acta Inf., 2006

The Kleene Equality for Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

On Rational Trees.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005
On the representation of McCarthy's amb in the Pi-calculus.
Theor. Comput. Sci., 2005

Linearly Bounded Infinite Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Regular Sets of Higher-Order Pushdown Stacks.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004
On the Representation of McCarthy's amb in the -calculus.
Electr. Notes Theor. Comput. Sci., 2004

2003
On Equivalent Representations of Infinite Structures.
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.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003


  Loading...