10 citations · 36 across the 15 of their papers we have counts for
5 papers · 1 filter
Higher-Order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties
Christopher H. Broadbent, Arnaud Carayol, C. -H. Luke Ong +1
This paper studies the logical properties of a very general class of infinite ranked trees, namely those generated by higher-order recursion schemes. We consider, for both monadic…
C-SHORe: Higher-Order Verification via Collapsible Pushdown System Saturation
Christopher Broadbent, Arnaud Carayol, Matthew Hague +1
Higher-order recursion schemes (HORS) have received much attention as a useful abstraction of higher-order functional programs with a number of new verification techniques employin…
Algebraic Synchronization Trees and Processes
Luca Aceto, Arnaud Carayol, Zoltán Ésik +1
We study algebraic synchronization trees, i.e., initial solutions of algebraic recursion schemes over the continuous categorical algebra of synchronization trees. In particular, we…
Linearly bounded infinite graphs
Arnaud Carayol, Antoine Meyer
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata representing their observable…
Context-Sensitive Languages, Rational Graphs and Determinism
Arnaud Carayol, Antoine Meyer
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la…