Reachability of multistack pushdown systems with scope-bounded matching relations

DOI10.1007/978-3-642-23217-6_14MaRDI QIDQ3090831zbMATH OpenOpenAlexFDO

Authors Salvatore La Torre, Margherita Napoli

Publication date 2 September 2011

Published in CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-23217-6_14

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Reachability of scope-bounded multistack pushdown systems
• Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
• Scope-Bounded Reachability in Valence Systems
• Data multi-pushdown automata
• Saturation of Concurrent Collapsible Pushdown Systems

Cites work

• An Infinite Automaton Characterization of Double Exponential Time
• Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
• Context-Bounded Analysis of Concurrent Queue Systems
• Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures
• Interprocedural Analysis of Concurrent Programs Under a Context Bound
• Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
• Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
• The tree width of auxiliary storage
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(25)

• Realizability of concurrent recursive programs
• Reachability of scope-bounded multistack pushdown systems
• On exteriority notions in book embeddings and treewidth
• The complexity of model checking multi-stack systems
• Context-free ambiguity detection using multi-stack pushdown automata
• Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
• Controllers for the verification of communicating multi-pushdown systems
• Ordered multi-stack visibly pushdown automata
• Emptiness of ordered multi-pushdown automata is 2ETIME-complete
• Linear-time model-checking for multithreaded programs under scope-bounding
• Temporal logics for concurrent recursive programs: satisfiability and model checking
• Budget-bounded model-checking pushdown systems
• Bounded context switching for valence systems
• Revisiting underapproximate reachability for multipushdown systems
• Data multi-pushdown automata
• On the Complexity of Bounded Context Switching.
• On the path-width of integer linear programming
• On Reachability Analysis of Pushdown Systems with Transductions: Application to Boolean Programs with Call-by-Reference
• Reachability analysis of pushdown systems with an upper stack
• Scope-bounded pushdown languages
• Scope-bounded pushdown languages
• Scope-Bounded Reachability in Valence Systems
• Forwards- and backwards-reachability for cooperating multi-pushdown systems
• Backwards-reachability for cooperating multi-pushdown systems
• On the complexity of multi-pushdown games

This page was built for publication: Reachability of multistack pushdown systems with scope-bounded matching relations

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