scientific article; zbMATH DE number 5825969

DOI10.3233/978-1-60750-100-8-263MaRDI QIDQ3060985zbMATH OpenFDO

Authors

Publication date 13 December 2010

Full work available at URL https://doi.org/10.3233/978-1-60750-100-8-263

zbMATH Keywords

game semanticshigher-order collapsible pushdown automatahigher-order computationmodel checkingparity gamespushdown automatarecursion schemessurvey article

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Recursion schemes, collapsible pushdown automata and higher-order model checking
• Higher-order recursion schemes and their automata models
• Collapsible pushdown automata and recursion schemes
• Recursive schemes, Krivine machines, and collapsible pushdown automata
• The complexity of model checking (collapsible) higher-order pushdown systems
• Recursive programs and the hierarchy of their models
• Streett Automata Model Checking of Higher-Order Recursion Schemes
• Publication:4941897
• Algebraic computability and enumeration models. Recursion theory and descriptive complexity

Cited in

(18)

• Higher-order recursion schemes and their automata models
• The complexity of model checking (collapsible) higher-order pushdown systems
• Collapsible pushdown automata and labeled recursion schemes, equivalence, safety and effective selection
• On the significance of the collapse operation
• Krivine machines and higher-order schemes
• Collapse operation increases expressive power of deterministic higher order pushdown automata
• scientific article; zbMATH DE number 4213439 (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
• Krivine machines and higher-order schemes
• Recursive schemes, Krivine machines, and collapsible pushdown automata
• Recursion schemes, collapsible pushdown automata and higher-order model checking
• On the expressivity of linear recursion schemes
• On the expressive power of higher-order pushdown systems
• C-SHORe: a collapsible approach to higher-order verification
• Pumping by typing
• Collapsible pushdown automata and recursion schemes
• Verification of Higher-Order Computation: A Game-Semantic Approach

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3060985)