Christopher H. Broadbent

Publication Activity (10 Years)

Years Active: 2009-2021
Publications (10 Years): 6

Top Venues

CoRR

ACM Trans. Comput. Log.

ICALP (2)

Theory Comput. Syst.

University of Oxford, UK (PHD)

Education History

University of Oxford, UK

PHD

Publications

Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre
Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties. ACM Trans. Comput. Log. 22 (2) (2021)
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre
Collapsible Pushdown Parity Games. ACM Trans. Comput. Log. 22 (3) (2021)
Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre
Higher-Order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties. CoRR (2020)
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre
Collapsible Pushdown Parity Games. CoRR (2020)
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
Emptiness of Stack Automata is NEXPTIME-complete: A Correction. CoRR (2018)
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
C-SHORe: Higher-Order Verification via Collapsible Pushdown System Saturation. CoRR (2017)
Christopher H. Broadbent
On First-Order Logic and CPDA Graphs. Theory Comput. Syst. 55 (4) (2014)
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
C-SHORe: a collapsible approach to higher-order verification. ICFP (2013)
Christopher H. Broadbent, Naoki Kobayashi
Saturation-Based Model Checking of Higher-Order Recursion Schemes. CSL (2013)
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
A Saturation Method for Collapsible Pushdown Systems. ICALP (2) (2012)
Christopher H. Broadbent, Stefan Göller
On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two. FSTTCS (2012)
Christopher H. Broadbent
Prefix Rewriting for Nested-Words and Collapsible Pushdown Automata. ICALP (2) (2012)
Christopher H. Broadbent
The Limits of Decidability for First Order Logic on CPDA Graphs. STACS (2012)
Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre
Recursion Schemes and Logical Reflection. LICS (2010)
Christopher H. Broadbent, C.-H. Luke Ong
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes. FoSSaCS (2009)

Christopher H. Broadbent.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Christopher H. Broadbent