论文信息 - Decomposition of Distributed Programs into Communication-Closed Layers - 字舞流文

Decomposition of Distributed Programs into Communication-Closed Layers

Nissim Francez | Tzilla Elrad | T. Elrad | N. Francez

[1] Nissim Francez,et al. A Weakest Precondition Semantics for Communicating Processes , 1984, Theor. Comput. Sci..

[2] Krzysztof R. Apt,et al. Formal Justification of a Proof System for Communicating Sequential Processes , 1983, JACM.

[3] Fred B. Schneider,et al. Synchronization in Distributed Programs , 1982, TOPL.

[4] Nissim Francez,et al. Extended naming conventions for communicating processes , 1982, POPL '82.

[5] K. Mani Chandy,et al. Proofs of Networks of Processes , 1981, IEEE Transactions on Software Engineering.

[6] Amir Pnueli,et al. A linear history semantics for distributed languages extended abstract , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[7] Willem P. de Roever,et al. A Proof System for Communicating Sequential Processes , 1980, ACM Trans. Program. Lang. Syst..

[8] C. A. R. Hoare,et al. Semantics of Nondeterminism, Concurrency, and Communication , 1979, J. Comput. Syst. Sci..

[9] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.

[10] Richard J. Lipton,et al. Reduction: a method of proving properties of parallel programs , 1975, CACM.