Christopher H. Broadbent

According to our database, Christopher H. Broadbent authored at least 14 papers between 2009 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

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

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

2018

Emptiness of Stack Automata is NEXPTIME-complete: A Correction.

Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre

CoRR, 2018

2017

C-SHORe: Higher-Order Verification via Collapsible Pushdown System Saturation.

Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre

CoRR, 2017

2014

On First-Order Logic and CPDA Graphs.

Christopher H. Broadbent

Theory Comput. Syst., 2014

2013

C-SHORe: a collapsible approach to higher-order verification.

Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

Saturation-Based Model Checking of Higher-Order Recursion Schemes.

Christopher H. Broadbent, Naoki Kobayashi

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012

The Limits of Decidability for First Order Logic on CPDA Graphs.

Christopher H. Broadbent

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

A Saturation Method for Collapsible Pushdown Systems.

Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Prefix Rewriting for Nested-Words and Collapsible Pushdown Automata.

Christopher H. Broadbent

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two.

Christopher H. Broadbent, Stefan Göller

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011

On collapsible pushdown automata, their graphs and the power of links.

Christopher H. Broadbent

PhD thesis, 2011

2010

Recursion Schemes and Logical Reflection.

Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre

Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

2009

On Global Model Checking Trees Generated by Higher-Order Recursion Schemes.

Christopher H. Broadbent, C.-H. Luke Ong

Proceedings of the Foundations of Software Science and Computational Structures, 2009