Data flow analysis of distributed communicating processes
type: Item
instance of: scholarly article
title: Data flow analysis of distributed communicating processes
zbMATH Open document ID: 0714.68003
DOI: 10.1007/BF01407862
author: J. Reif
author: Scott A. Smolka
published in: International Journal of Parallel Programming
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68N20
zbMATH DE Number: 4176417
zbMATH Keywords: message passing
zbMATH Keywords: reachability
zbMATH Keywords: Data flow analysis
zbMATH Keywords: communicating processes
MaRDI profile type: Publication
cites work: Communicating sequential processes
cites work: A calculus of mobile processes. I
cites work: High level programming for distributed computing
cites work: Q4162449
cites work: A Simple Algorithm for Global Data Flow Analysis Problems
cites work: Q3871899
cites work: The complexity of reachability in distributed communicating processes
cites work: A Fast and Usually Linear Algorithm for Global Flow Analysis
cites work: Q5585020
cites work: Q5452362
cites work: Data Flow Analysis for Procedural Languages
full work available at URL: https://doi.org/10.1007/bf01407862
OpenAlex ID: W2024748881
Recommended article: An algorithm for analyzing communicating processes
Recommended article: Q4417832
Recommended article: Two Tools for Interprocess Communication in Distributed Data-Flow Systems
Recommended article: Communication patterns in distributed computations
Recommended article: Q3835010
description: scientific article; zbMATH DE number 4176417