论文信息 - A Methodology for Developing Distributed Programs

A Methodology for Developing Distributed Programs

A methodology, different from the existing ones, for constructing distributed programs is presented. It is based on the well-known idea of developing distributed programs via synchronous and centralized programs. The distinguishing features of the methodology are: 1) specification include process structure information and distributed programs are developed taking this information into account, 2) a new class of programs, called PPSA's, is used in the development process, and 3) a transformational approach is suggested to solve the problems inherent in the method of developing distributed programs through synchronous and centralized programs. The methodology is illustrated with an example.

S. Ramesh | S. L. Mehndiratta | S. Ramesh | S. Mehndiratta

[1] Michael Rodeh,et al. Distributed k-selection: From a sequential to a distributed algorithm , 1983, PODC '83.

[2] Zohar Manna,et al. How to cook a temporal proof system for your pet language , 1983, POPL '83.

[3] Abha Moitra,et al. Synthesis of communicating processes , 1983, PODC '83.

[4] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .

[5] Nissim Francez,et al. Decomposition of Distributed Programs into Communication-Closed Layers , 1982, Sci. Comput. Program..

[6] Nissim Francez,et al. Script: A communication abstraction mechanism , 1983, PODC '83.

[7] Ralph-Johan Back,et al. Decentralization of process nets with centralized control , 1983, PODC '83.

[8] Fred B. Schneider,et al. Derivation of a Distributed Algorithm for Finding Paths in Directed Networks , 1986, Sci. Comput. Program..

[9] S. Ramesh,et al. A New Class of High Level Programs for Distributed Computing Systems , 1985, FSTTCS.

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

[11] Abraham Silberschatz,et al. An Effective Implementation for the Generalized Input-Output Construct of CSP , 1983, TOPL.