Follow
Arnaud Carayol
Arnaud Carayol
CNRS & Université Paris Est
Verified email at univ-mlv.fr
Title
Cited by
Cited by
Year
The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata
A Carayol, S Wöhrle
FST TCS 2003: Foundations of Software Technology and Theoretical Computer …, 2003
1552003
Recursion schemes and logical reflection
CH Broadbent, A Carayol, CHL Ong, O Serre
2010 25th Annual IEEE Symposium on Logic in Computer Science, 120-129, 2010
692010
Collapsible pushdown automata and labeled recursion schemes: Equivalence, safety and effective selection
A Carayol, O Serre
2012 27th Annual IEEE Symposium on Logic in Computer Science, 165-174, 2012
512012
Regular sets of higher-order pushdown stacks
A Carayol
Mathematical Foundations of Computer Science 2005: 30th International …, 2005
492005
A saturation method for collapsible pushdown systems
C Broadbent, A Carayol, M Hague, O Serre
International Colloquium on Automata, Languages, and Programming, 165-176, 2012
452012
Winning regions of higher-order pushdown games
A Carayol, M Hague, A Meyer, CHL Ong, O Serre
2008 23rd Annual IEEE Symposium on Logic in Computer Science, 193-204, 2008
442008
MSO on the infinite binary tree: Choice and order
A Carayol, C Löding
International Workshop on Computer Science Logic, 161-176, 2007
412007
Choice functions and well-orderings over the infinite binary tree
A Carayol, C Löding, D Niwinski, I Walukiewicz
Open Mathematics 8 (4), 662-682, 2010
392010
C-shore: a collapsible approach to higher-order verification
C Broadbent, A Carayol, M Hague, O Serre
ACM SIGPLAN Notices 48 (9), 13-24, 2013
352013
Uniformization in automata theory
A Carayol, C Löding
Proceedings of the 14th Congress of Logic, Methodology and Philosophy of …, 2011
312011
On the representation of McCarthy's amb in the π-calculus
A Carayol, D Hirschkoff, D Sangiorgi
Theoretical computer science 330 (3), 439-473, 2005
302005
Randomization in automata on infinite trees
A Carayol, A Haddad, O Serre
ACM Transactions on Computational Logic (TOCL) 15 (3), 1-33, 2014
292014
Distribution of the number of accessible states in a random deterministic automaton
A Carayol, C Nicaud
STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 194-205, 2012
282012
Context-sensitive languages, rational graphs and determinism
A Carayol, A Meyer
Logical Methods in Computer Science 2, 2006
242006
Linear orders in the pushdown hierarchy
L Braud, A Carayol
International Colloquium on Automata, Languages, and Programming, 88-99, 2010
222010
Saturation algorithms for model-checking pushdown systems
A Carayol, M Hague
arXiv preprint arXiv:1405.5593, 2014
182014
Automates infinis, logiques et langages
A Carayol
Université Rennes 1, 2006
182006
On rational trees
A Carayol, C Morvan
International Workshop on Computer Science Logic, 225-239, 2006
162006
On equivalent representations of infinite structures
A Carayol, T Colcombet
International Colloquium on Automata, Languages, and Programming, 599-610, 2003
162003
Positional strategies for higher-order pushdown parity games
A Carayol, M Slaats
International Symposium on Mathematical Foundations of Computer Science, 217-228, 2008
132008
The system can't perform the operation now. Try again later.
Articles 1–20