On the analysis of interacting pushdown systems
From MaRDI portal
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cited in
(12)- Analyzing pushdown systems with stack manipulation
- Verifying parallel programs with dynamic communication structures
- Acceleration in multi-pushdown systems
- Model checking dynamic pushdown networks
- Verification of Boolean programs with unbounded thread creation
- Reasoning about threads with bounded lock chains
- Model checking concurrent programs
- An automata-theoretic approach to infinite-state systems
- Verifying Parallel Programs with Dynamic Communication Structures
- Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
- Interprocedural Analysis of Concurrent Programs Under a Context Bound
- Verification of well-formed communicating recursive state machines
This page was built for publication: On the analysis of interacting pushdown systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189810)