## A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes

- Naoki Kobayashi, C.-H. Luke Ong
- 2009 24th Annual IEEE Symposium on Logic In…
- 2009

- Published 2010 in FSTTCS

We study (collapsible) higher-order pushdown systems — theoretically robust and wellstudied models of higher-order programs — along with their natural subclass called (collapsible) higher-order basic process algebras. We provide a comprehensive analysis of the model checking complexity of a range of both branching-time and linear-time temporal logics. We obtain tight bounds on data, expression, and combined-complexity for both (collapsible) higher-order pushdown systems and (collapsible) higher-order basic process algebra. At order-k, results range from polynomial to (k + 1)-exponential time. 1998 ACM Subject Classification D.2.4

@inproceedings{Hague2010TheCO,
title={The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems},
author={Matthew Hague and Anthony Widjaja Lin},
booktitle={FSTTCS},
year={2010}
}