Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems

DOI10.2168/LMCS-4(4:14)2008MaRDI QIDQ3623010zbMATH OpenFDO

Authors Matthew Hague, Luke Ong

Publication date 29 April 2009

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/LMCS-4(4:14)2008

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
• Complete symbolic reachability analysis using back-and-forth narrowing
• Algebra and Coalgebra in Computer Science
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• AN ALTERNATIVE CONSTRUCTION IN SYMBOLIC REACHABILITY ANALYSIS OF SECOND ORDER PUSHDOWN SYSTEMS
• scientific article; zbMATH DE number 1629965
• scientific article; zbMATH DE number 1232241
• Reachability analysis of pushdown systems with an upper stack
• CONCUR 2005 – Concurrency Theory
• Reachability analysis of first-order definable pushdown systems

Cited in

(14)

• Unboundedness and downward closures of higher-order pushdown automata
• Reachability in higher-order-counters
• The complexity of model checking (collapsible) higher-order pushdown systems
• Pairwise reachability analysis for higher order concurrent programs by higher-order model checking
• AN ALTERNATIVE CONSTRUCTION IN SYMBOLIC REACHABILITY ANALYSIS OF SECOND ORDER PUSHDOWN SYSTEMS
• Games on Higher Order Multi-stack Pushdown Systems
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems
• Reachability analysis of first-order definable pushdown systems
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Mathematical Foundations of Computer Science 2005
• Reachability analysis of pushdown systems with an upper stack
• Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
• On the complexity of multi-pushdown games

This page was built for publication: Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems

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