Reachability of scope-bounded multistack pushdown systems
DOI10.1016/J.IC.2020.104588zbMATH Open1496.68235OpenAlexW2965450052MaRDI QIDQ2216111FDOQ2216111
Salvatore La Torre, Margherita Napoli, Gennaro Parlato
Publication date: 15 December 2020
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2020.104588
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)
Cites Work
- Title not available (Why is that?)
- A Unifying Approach for Multistack Pushdown Automata
- Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations
- On the Expressive Power of 2-Stack Visibly Pushdown Automata
- ADJACENT ORDERED MULTI-PUSHDOWN SYSTEMS
- 2-Visibly Pushdown Automata
- Context-Bounded Analysis of Concurrent Queue Systems
- MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Model-Checking Bounded Multi-Pushdown Systems
- Computer aided verification. 21st international conference, CAV 2009, Grenoble, France, June 26--July 2, 2009. Proceedings
- Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
- MSO Decidability of Multi-Pushdown Systems via Split-Width
- Temporal logics for concurrent recursive programs: satisfiability and model checking
- Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
- Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
- Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding
- Budget-bounded model-checking pushdown systems
- Delay-bounded scheduling
- Decidable logics combining heap structures and data
- Tools and algorithms for the construction and analysis of systems. 14th international conference, TACAS 2008, held as part of the joint European conferences on theory and practice of software, ETAPS 2008, Budapest, Hungary, March 29--April 6, 2008. Proceedings
- A Temporal Logic for Multi-threaded Programs
- Games on Multi-stack Pushdown Systems
- Scope-bounded pushdown languages
- Interprocedural Analysis of Concurrent Programs Under a Context Bound
- Stateless model checking for TSO and PSO
- On the Complexity of Bounded Context Switching.
- Computer aided verification. 22nd international conference, CAV 2010, Edinburgh, UK, July 15--19, 2010. Proceedings
- Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures
- An Infinite Automaton Characterization of Double Exponential Time
- The Complexity of Model Checking Multi-stack Systems
- Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
- Saturation of Concurrent Collapsible Pushdown Systems
- Bounded Context Switching for Valence Systems
Cited In (8)
- Attacking the Dimensionality Problem of Parameterized Systems via Bounded Reachability Graphs
- Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
- Saturation of Concurrent Collapsible Pushdown Systems
- Fully Dynamic Single-Source Reachability in Practice: An Experimental Study
- On Reachability Analysis of Pushdown Systems with Transductions: Application to Boolean Programs with Call-by-Reference
- Backwards-reachability for cooperating multi-pushdown systems
- Recent advances on reachability problems for valence systems (invited talk)
- Forwards- and backwards-reachability for cooperating multi-pushdown systems
This page was built for publication: Reachability of scope-bounded multistack pushdown systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2216111)
