Recursion schemes, collapsible pushdown automata and higher-order model checking
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5825969
- Verification of Higher-Order Computation: A Game-Semantic Approach
- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
- Collapsible pushdown automata and recursion schemes
- Recursive schemes, Krivine machines, and collapsible pushdown automata
Cited in
(13)- Generalizations of checking stack automata: characterizations and hierarchies
- Herbrand's theorem as higher order recursion
- Higher-order recursion schemes and their automata models
- Collapsible pushdown automata and labeled recursion schemes, equivalence, safety and effective selection
- Krivine machines and higher-order schemes
- scientific article; zbMATH DE number 5825969 (Why is no real title available?)
- Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes
- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
- scientific article; zbMATH DE number 598180 (Why is no real title available?)
- C-SHORe: a collapsible approach to higher-order verification
- Collapsible pushdown automata and recursion schemes
- Verification of Higher-Order Computation: A Game-Semantic Approach
- Cost Automata, Safe Schemes, and Downward Closures
This page was built for publication: Recursion schemes, collapsible pushdown automata and higher-order model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910438)