Higher-Order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties

10/13/2020
by   Christopher H. Broadbent, et al.
0

This paper studies the logical properties of a very general class of infinite ranked trees, namely those generated by higher-order recursion schemes. We consider three main problems – model-checking, logical refection (aka global model-checking) and selection – for both monadic second-order logic and modal mu-calculus and prove that they can be effectively answered positively. For that, we rely on the known connexion between higher-order recursion schemes and collapsible pushdown automata and on previous work regarding parity games played on transition graphs of collapsible pushdown automata.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/13/2020

Collapsible Pushdown Parity Games

This paper studies a large class of two-player perfect-information turn-...
02/16/2015

Rewriting Higher-Order Stack Trees

Higher-order pushdown systems and ground tree rewriting systems can be s...
10/10/2018

Recursion Schemes, the MSO Logic, and the U quantifier

We study the model-checking problem for recursion schemes: does the tree...
05/05/2021

Higher-Order Model Checking Step by Step

We show a new simple algorithm that solves the model-checking problem fo...
07/30/2020

Reasoning about strategies on collapsible pushdown arenas with imperfect information

Strategy Logic with imperfect information (SLiR) is a very expressive lo...
12/24/2020

Verifying Liveness Properties of ML Programs

Higher-order recursion schemes are a higher-order analogue of Boolean Pr...
09/10/2018

The Power of the Weak

A landmark result in the study of logics for formal verification is Jani...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.