Symbolic reachability analysis of higher-order context-free processes
From MaRDI portal
Recommendations
- Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
- Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
- Reachability analysis of pushdown automata: Application to model-checking
- Local model checking for context-free processes
- scientific article; zbMATH DE number 751138
Cited in
(10)- Automatic verification of recursive procedures with one integer parameter.
- Model checking procedural programs
- Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
- Games on Higher Order Multi-stack Pushdown Systems
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
- Domains for Higher-Order Games
- Symbolic Reachability for Process Algebras with Recursive Data Types
- Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
- On the complexity of multi-pushdown games
- Regular sets over extended tree structures
This page was built for publication: Symbolic reachability analysis of higher-order context-free processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465847)