Data flow analysis of distributed communicating processes
From MaRDI portal
Publication:751233
DOI10.1007/BF01407862zbMATH Open0714.68003OpenAlexW2024748881MaRDI QIDQ751233FDOQ751233
Authors: J. Reif, Scott A. Smolka 
Publication date: 1990
Published in: International Journal of Parallel Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01407862
Recommendations
Theory of compilers and interpreters (68N20) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- A calculus of mobile processes. I
- Communicating sequential processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- High level programming for distributed computing
- A Simple Algorithm for Global Data Flow Analysis Problems
- The complexity of reachability in distributed communicating processes
- Title not available (Why is that?)
- A Fast and Usually Linear Algorithm for Global Flow Analysis
- Data Flow Analysis for Procedural Languages
Cited In (10)
- Data Flow Analysis for CCS
- Satisfiability of dataflow models of distributed programs
- Elimination of redundant messages with a two-pass static analysis algorithm
- Data Flow Analysis
- An algorithm for analyzing communicating processes
- The complexity of reachability in distributed communicating processes
- Static and dynamic processor allocation for higher-order concurrent languages
- Two Tools for Interprocess Communication in Distributed Data-Flow Systems
- Title not available (Why is that?)
- Data flow analysis of asynchronous systems using infinite abstract domains
This page was built for publication: Data flow analysis of distributed communicating processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751233)
