The complexity of model checking (collapsible) higher-order pushdown systems

DOI10.4230/LIPICS.FSTTCS.2010.228MaRDI QIDQ2908852zbMATH OpenOpenAlexFDO

Authors Matthew Hague, Anthony Widjaja To

Publication date 29 August 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_58e5.html

zbMATH Keywords

collapsiblecomplexityhigher-ordermodel checkingpushdown systemstemporal logics

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• The Complexity of Model Checking Higher-Order Fixpoint Logic
• Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
• scientific article; zbMATH DE number 5825969
• Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
• First-order logic on higher-order nested pushdown trees

Cited in

(9)

• The complexity of model checking multi-stack systems
• Reachability in higher-order-counters
• Global model checking of ordered multi-pushdown systems
• Saturation of Concurrent Collapsible Pushdown Systems
• scientific article; zbMATH DE number 5825969 (Why is no real title available?)
• A Saturation Method for Collapsible Pushdown Systems
• The Complexity of Model Checking Multi-stack Systems
• Complexity of model-checking call-by-value programs
• Knapsack in hyperbolic groups

This page was built for publication: The complexity of model checking (collapsible) higher-order pushdown systems

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