scientific article; zbMATH DE number 7199579
From MaRDI portal
Publication date: 12 May 2020
Full work available at URL: https://arxiv.org/abs/1810.04763
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic, Cost Automata, Safe Schemes, and Downward Closures
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Krivine machines and higher-order schemes
- Weak MSO with the unbounding quantifier
- The IO- and OI-hierarchies
- The monadic theory of order
- Unboundedness and downward closures of higher-order pushdown automata
- Using models to model-check recursive schemes
- A Note on Decidable Separability by Piecewise Testable Languages
- Saturation-Based Model Checking of Higher-Order Recursion Schemes.
- Simply typed fixpoint calculus and collapsible pushdown automata
- Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection
- A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes
- The first order properties of products of algebraic systems
- Recursion Schemes and the WMSO+U Logic
- New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures
- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
- The Complexity of Tree Automata and Logics of Programs
- The Diagonal Problem for Higher-Order Recursion Schemes is Decidable
- The Complexity of the Diagonal Problem for Recursion Schemes
- Computer Science Logic
- A model for behavioural properties of higher-order programs
- Collapsible Pushdown Automata and Recursion Schemes
- Model Checking Higher-Order Programs
- A type-directed abstraction refinement approach to higher-order model checking
- Indexed Grammars—An Extension of Context-Free Grammars
- MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
- Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
