Reachability of scope-bounded multistack pushdown systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- 2-Visibly Pushdown Automata
- A Temporal Logic for Multi-threaded Programs
- A unifying approach for multistack pushdown automata
- Adjacent ordered multi-pushdown systems
- An Infinite Automaton Characterization of Double Exponential Time
- Bounded context switching for valence systems
- Budget-bounded model-checking pushdown systems
- Computer aided verification. 21st international conference, CAV 2009, Grenoble, France, June 26--July 2, 2009. Proceedings
- Computer aided verification. 22nd international conference, CAV 2010, Edinburgh, UK, July 15--19, 2010. Proceedings
- 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
- Decidable logics combining heap structures and data
- Delay-bounded scheduling
- Games on Multi-stack Pushdown Systems
- Interprocedural Analysis of Concurrent Programs Under a Context Bound
- Linear-time model-checking for multithreaded programs under scope-bounding
- MSO decidability of multi-pushdown systems via split-width
- MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
- Model-checking bounded multi-pushdown systems
- On the Complexity of Bounded Context Switching.
- On the Expressive Power of 2-Stack Visibly Pushdown Automata
- Reachability of multistack pushdown systems with scope-bounded matching relations
- Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
- Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
- Saturation of Concurrent Collapsible Pushdown Systems
- Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
- Scope-bounded pushdown languages
- Stateless model checking for TSO and PSO
- Temporal logics for concurrent recursive programs: satisfiability and model checking
- The Complexity of Model Checking Multi-stack Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- 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. Procee
Cited in
(25)- Scope-bounded pushdown languages
- Attacking the Dimensionality Problem of Parameterized Systems via Bounded Reachability Graphs
- Safety verification of asynchronous pushdown systems with shaped stacks
- Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
- A perfect model for bounded verification
- Saturation of Concurrent Collapsible Pushdown Systems
- Controllers for the verification of communicating multi-pushdown systems
- Revisiting underapproximate reachability for multipushdown systems
- Scope-Bounded Reachability in Valence Systems
- Fully Dynamic Single-Source Reachability in Practice: An Experimental Study
- On bounded reachability analysis of shared memory systems
- Budget-bounded model-checking pushdown systems
- On Reachability Analysis of Pushdown Systems with Transductions: Application to Boolean Programs with Call-by-Reference
- On boundedness problems for pushdown vector addition systems
- Reachability problem for weak multi-pushdown automata
- Reachability problem for weak multi-pushdown automata
- Scope-bounded pushdown languages
- Backwards-reachability for cooperating multi-pushdown systems
- Recent advances on reachability problems for valence systems (invited talk)
- Data multi-pushdown automata
- Linear-time model-checking for multithreaded programs under scope-bounding
- Adjacent ordered multi-pushdown systems
- Reachability of multistack pushdown systems with scope-bounded matching relations
- Forwards- and backwards-reachability for cooperating multi-pushdown systems
- Adjacent ordered 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)
