Data flow analysis of distributed communicating processes

DOI10.1007/BF01407862MaRDI QIDQ751233zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

reachabilitymessage passingcommunicating processesData flow analysis

Mathematics Subject Classification ID

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

Recommendations

• An algorithm for analyzing communicating processes
• scientific article; zbMATH DE number 1956488
• Two Tools for Interprocess Communication in Distributed Data-Flow Systems
• Communication patterns in distributed computations
• scientific article; zbMATH DE number 4111991

Cites work

• scientific article; zbMATH DE number 3675290 (Why is no real title available?)
• scientific article; zbMATH DE number 3592938 (Why is no real title available?)
• scientific article; zbMATH DE number 5254145 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A Fast and Usually Linear Algorithm for Global Flow Analysis
• A Simple Algorithm for Global Data Flow Analysis Problems
• A calculus of mobile processes. I
• Communicating sequential processes
• Data Flow Analysis for Procedural Languages
• High level programming for distributed computing
• The complexity of reachability in distributed communicating processes

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
• scientific article; zbMATH DE number 3894998 (Why is no real title available?)
• 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)