Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations
From MaRDI portal
Publication:3090831
DOI10.1007/978-3-642-23217-6_14zbMath1343.68172OpenAlexW174890186MaRDI QIDQ3090831
Margherita Napoli, Salvatore La Torre
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
Related Items (14)
Realizability of concurrent recursive programs ⋮ Revisiting Underapproximate Reachability for Multipushdown Systems ⋮ Ordered multi-stack visibly pushdown automata ⋮ The complexity of model checking multi-stack systems ⋮ Reachability of scope-bounded multistack pushdown systems ⋮ Temporal logics for concurrent recursive programs: satisfiability and model checking ⋮ Budget-bounded model-checking pushdown systems ⋮ Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete ⋮ Bounded Context Switching for Valence Systems ⋮ On the path-width of integer linear programming ⋮ On exteriority notions in book embeddings and treewidth ⋮ Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata ⋮ Data Multi-Pushdown Automata ⋮ On the Complexity of Bounded Context Switching.
Cites Work
- Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
- An Infinite Automaton Characterization of Double Exponential Time
- Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
- Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
- The tree width of auxiliary storage
- Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures
- Interprocedural Analysis of Concurrent Programs Under a Context Bound
- Context-Bounded Analysis of Concurrent Queue Systems
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations
