Data flow analysis of distributed communicating processes

DOI10.1007/BF01407862zbMath0714.68003OpenAlexW2024748881MaRDI QIDQ751233

John H. 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

zbMATH Keywords

reachabilitymessage passingcommunicating processesData flow analysis

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Theory of compilers and interpreters (68N20)

Related Items

The complexity of reachability in distributed communicating processes, Static and dynamic processor allocation for higher-order concurrent languages, An algorithm for analyzing communicating processes

Cites Work

• The complexity of reachability in distributed communicating processes
• A calculus of mobile processes. I
• A Fast and Usually Linear Algorithm for Global Flow Analysis
• A Simple Algorithm for Global Data Flow Analysis Problems
• Communicating sequential processes
• Data Flow Analysis for Procedural Languages
• High level programming for distributed computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item