Bounded communication reachability analysis of process rewrite systems with ordered parallelism
From MaRDI portal
multithreaded programs with procedure callsprocess algebraprogram analysissynchronisationverification
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cites work
- A Generic Approach to the Static Analysis of Concurrent Programs with Procedures
- A generic approach to the static analysis of concurrent programs with procedures
- Algorithmic improvements in regular model checking.
- CONCUR 2005 – Concurrency Theory
- Context-bounded model checking of concurrent software
- Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Handling global conditions in parameterized system verification
- scientific article; zbMATH DE number 108539 (Why is no real title available?)
- scientific article; zbMATH DE number 1263840 (Why is no real title available?)
- On computing reachability sets of process rewrite systems
- Permutation rewriting and algorithmic verification
- Reachability analysis of synchronized PA systems
- Reachability analysis of term rewriting systems with Timbuk
- Regular model checking
- The regular viewpoint on PA-processes
- Tools and Algorithms for the Construction and Analysis of Systems
Cited in
(2)
This page was built for publication: Bounded communication reachability analysis of process rewrite systems with ordered parallelism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5179049)