Christopher H. Broadbent
From MaRDI portal
Person:2254513
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Saturation-Based Model Checking of Higher-Order Recursion Schemes. | 2017-02-02 | Paper |
| On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two | 2017-01-26 | Paper |
| C-SHORe: a collapsible approach to higher-order verification Proceedings of the 18th ACM SIGPLAN international conference on Functional programming | 2015-03-30 | Paper |
| On first-order logic and CPDA graphs Theory of Computing Systems | 2015-02-05 | Paper |
| Prefix rewriting for nested-words and collapsible pushdown automata Automata, Languages, and Programming | 2012-11-01 | Paper |
| The limits of decidability for first order logic on CPDA graphs | 2012-08-23 | Paper |
| On Global Model Checking Trees Generated by Higher-Order Recursion Schemes Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
Research outcomes over time
This page was built for person: Christopher H. Broadbent
