Christopher H. Broadbent

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