On Global Model Checking Trees Generated by Higher-Order Recursion Schemes. - Christopher H. Broadbent; C.-H. Luke Ong (FoSSaCS, 2009)

Recursion Schemes and Logical Reflection. - Christopher H. Broadbent; Arnaud Carayol; C.-H. Luke Ong; Olivier Serre (LICS, 2010)

On collapsible pushdown automata, their graphs and the power of links. - Christopher H. Broadbent (2011)

On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two. - Christopher H. Broadbent; Stefan Göller (FSTTCS, 2012)

Prefix Rewriting for Nested-Words and Collapsible Pushdown Automata. - Christopher H. Broadbent (ICALP (2), 2012)

A Saturation Method for Collapsible Pushdown Systems. - Christopher H. Broadbent; Arnaud Carayol; Matthew Hague; Olivier Serre (ICALP (2), 2012)

The Limits of Decidability for First Order Logic on CPDA Graphs. - Christopher H. Broadbent (STACS, 2012)

Saturation-Based Model Checking of Higher-Order Recursion Schemes. - Christopher H. Broadbent; Naoki Kobayashi 001 (CSL, 2013)

C-SHORe: a collapsible approach to higher-order verification. - Christopher H. Broadbent; Arnaud Carayol; Matthew Hague; Olivier Serre (ICFP, 2013)

On First-Order Logic and CPDA Graphs. - Christopher H. Broadbent (Theory Comput. Syst., 2014)

C-SHORe: Higher-Order Verification via Collapsible Pushdown System Saturation. - Christopher H. Broadbent; Arnaud Carayol; Matthew Hague; Olivier Serre (CoRR, 2017)

Emptiness of Stack Automata is NEXPTIME-complete: A Correction. - Christopher H. Broadbent; Arnaud Carayol; Matthew Hague; Olivier Serre (CoRR, 2018)

Collapsible Pushdown Parity Games. - Christopher H. Broadbent; Arnaud Carayol; Matthew Hague; Andrzej S. Murawski; C.-H. Luke Ong; Olivier Serre (ACM Trans. Comput. Log., 2021)

Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties. - Christopher H. Broadbent; Arnaud Carayol; C.-H. Luke Ong; Olivier Serre (ACM Trans. Comput. Log., 2021)