Reachability analysis of synchronized PA systems
From MaRDI portal
Publication:2851071
Recommendations
Cited in
(17)- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Bounded communication reachability analysis of process rewrite systems with ordered parallelism
- Constraint-based reachability
- Static Analysis of Multithreaded Recursive Programs Communicating via Rendez-Vous
- scientific article; zbMATH DE number 1670551 (Why is no real title available?)
- A generic approach to the static analysis of concurrent programs with procedures
- Verification of Boolean programs with unbounded thread creation
- On Reachability in Parameterized Phaser Programs
- Iterable forward reachability analysis of monitor-DPNs
- Constrained Reachability of Process Rewrite Systems
- Feasible reactivity for synchronous cooperative threads
- Verification of well-formed communicating recursive state machines
- Reachability Analysis of Procedural Programs with Affine Integer Arithmetic
- A Generic Approach to the Static Analysis of Concurrent Programs with Procedures
- Pairwise reachability analysis for higher order concurrent programs by higher-order model checking
- On symbolic verification of weakly extended PAD
- Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates
This page was built for publication: Reachability analysis of synchronized PA systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851071)