3 citations · 4 across the 4 of their papers we have counts for
4 papers
Collapsible Pushdown Parity Games
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague +3
This paper studies a large class of two-player perfect-information turn-based parity games on infinite graphs, namely those generated by collapsible pushdown automata. The main mot…
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…
Emptiness of Stack Automata is NEXPTIME-complete: A Correction
Christopher Broadbent, Arnaud Carayol, Matthew Hague +1
A saturation algorithm for collapsible pushdown systems was published in ICALP 2012. This work introduced a class of stack automata used to recognised regular sets of collapsible p…
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…