Sep 9, 2012 · Higher-order model checking—the model checking of trees gen- erated by higher-order recursion schemes (HORS)—is a natural.

Higher-order recursion schemes are a powerful model of functional com- putation that grew out of traditional recursive program schemes and generali-.

We then present an algorithm for deciding the model checking problem, which is based on the notion of traversals induced by the fully abstract game semantics of ...

This paper presents an algorithm for deciding the model checking problem, which is based on the notion of traversals induced by the fully abstract game ...

In this paper, we introduce higher-order recursion schemes with cases (HORSC), which extend HORS with a definition-by-cases construct (to express program ...

Abstract—Higher-order model checking is about the model checking of trees generated by recursion schemes. The past fifteen years or so have seen ...

Jul 2, 2021 · We show a new simple algorithm that solves the model-checking problem for recursion schemes: check whether the tree generated by a given higher-order recursion ...

Jan 5, 2024 · Model-checking is one of the most powerful techniques for verifying systems and programs, which since the pioneering results by Knapik et ...

Abstract: We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion ...

May 5, 2021 · We show a new simple algorithm that solves the model-checking problem for recursion schemes: check whether the tree generated by a given higher- ...