J.H.Reif, S.A.Smolka: Dataflow analysis of distributed communicating processes. International Journal of Parallel Programs 19, 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Static and Dynamic Processor Allocation for Higher-Order.. - Nielson, Nielson (1995) (5 citations) (Correct)
....via shared variables is studied in [8] and its communication patterns are analysed, again with the goal of producing useful information for processor (and storage) allocation. Also a couple of program analyses have been developed for concurrent languages with an imperative facet. The papers [3, 7, 14] all present reachability analyses for concurrent programs with a statically determined communication topology; only [14] shows how this restriction can be lifted to allow communication in the style of the calculus. Finally, 10] presents an analysis determining the number of communications on ....
....information for processor (and storage) allocation. Also a couple of program analyses have been developed for concurrent languages with an imperative facet. The papers [3, 7, 14] all present reachability analyses for concurrent programs with a statically determined communication topology; only [14] shows how this restriction can be lifted to allow communication in the style of the calculus. Finally, 10] presents an analysis determining the number of communications on each channel connecting two processes in a CSP like language. As mentioned our analysis is specified in two stages. The ....
J.H.Reif, S.A.Smolka: Dataflow analysis of distributed communicating processes. International Journal of Parallel Programs 19, 1990.
Tractable Flow Analysis for Anomaly Detection in Distributed.. - Cheung, Kramer (1993) (13 citations) (Correct)
....communication patterns in a collection of process flow graphs. The method can analyse programs with loops, non deterministic structures and synchronous communication using an algorithm with a quadratic complexity in terms of program size. The method follows an approach described by Reif and Smolka [9] but delivers a more accurate result in assessing the reachability of statements. The higher accuracy is achieved using three techniques: statement dependency, history sets and statement re reachability. The method is illustrated by a pump control application for a mining environment. A prototype ....
.... in terms of state space graphs is difficult due to the combinatorial state explostion problem, where the state space of a system can increase geometrically in terms of the system size [12] To avoid this problem, more tractable but non exhaustive techniques using flow analysis have been proposed [6, 9, 13]. In our analysis, a distributed application is made up of a system of sequential processes. Processes in the system communicate synchronously with each other by transmitting and receiving messages. A process sending a message needs to wait for the process receiving the message; and vice versa. We ....
[Article contains additional citation context not shown here]
J. Reif and S. Smolka: Data Flow Analysis of Distributed Communicating Processes. Internation Journal of Parallel Programming 19, 1 (1990), 1-30.
Static and Dynamic Processor Allocation for Higher-Order.. - Nielson, Nielson (1995) (5 citations) (Correct)
....via shared variables is studied in [9] and its communication patterns are analysed, again with the goal of producing useful information for processor (and storage) allocation. Also a couple of program analyses have been developed for concurrent languages with an imperative facet. The papers [4, 8, 15] all present reachability analyses for concurrent programs with a statically determined communication topology; only [15] shows how this restriction can be lifted to allow communication in the style of the calculus. Finally, 11] presents an analysis determining the number of communications on ....
....information for processor (and storage) allocation. Also a couple of program analyses have been developed for concurrent languages with an imperative facet. The papers [4, 8, 15] all present reachability analyses for concurrent programs with a statically determined communication topology; only [15] shows how this restriction can be lifted to allow communication in the style of the calculus. Finally, 11] presents an analysis determining the number of communications on each channel connecting two processes in a CSP like language. As mentioned our analysis is specified in two stages. The ....
J.H.Reif, S.A.Smolka: Dataflow analysis of distributed communicating processes. International Journal of Parallel Programs 19, 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC