Pages that link to "Item:Q2216111"
From MaRDI portal
The following pages link to Reachability of scope-bounded multistack pushdown systems (Q2216111):
Displaying 13 items.
- Budget-bounded model-checking pushdown systems (Q479843) (← links)
- Recent advances on reachability problems for valence systems (invited talk) (Q2695487) (← links)
- Safety Verification of Asynchronous Pushdown Systems with Shaped Stacks (Q2842115) (← links)
- Attacking the Dimensionality Problem of Parameterized Systems via Bounded Reachability Graphs (Q2894567) (← links)
- Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width (Q2957490) (← links)
- Saturation of Concurrent Collapsible Pushdown Systems (Q2963923) (← links)
- On bounded reachability analysis of shared memory systems (Q2978551) (← links)
- Fully Dynamic Single-Source Reachability in Practice: An Experimental Study (Q5147502) (← links)
- On Reachability Analysis of Pushdown Systems with Transductions: Application to Boolean Programs with Call-by-Reference (Q5357718) (← links)
- Scope-bounded pushdown languages (Q5890814) (← links)
- Reachability problem for weak multi-pushdown automata (Q5891173) (← links)
- Forwards- and backwards-reachability for cooperating multi-pushdown systems (Q6546604) (← links)
- Backwards-reachability for cooperating multi-pushdown systems (Q6655673) (← links)