Abstract
Programming MIMD multiprocessors requires to design processes mapped on the nodes of the architecture, communicating by message passing. This paper is a contribution for a rationalized design of such programs from formal specifications. For that purpose we introduce a refinement calculus of parallel specifications in which processes refine safety properties and communications refine liveness ones.
References
R.J. Back: Stepwise refinement of actions systems; LNCS 375, 1989.
K. Chandy, J. Misra: Parallel Program Design: a Foundation; Prentice Hall, 1988.
S. Damy, G.R. Perrin: Techniques for the design of communicating Processes; 6th International Workshop on Software Specification and Design, Como, 1991.
E.W. Dijkstra: A discipline of programming. Prentice-Hall, 1976.
P.E. Gribomont: Development of concurrent systems by incremental transformation; Research Report, Philips, Brussels, 1990.
C. Hoare: Communicating Sequential Processes; CACM, 21, 8, 1978.
E. Knapp: An exercise in the formal derivation of parallel programs: maximum flows in graphs; ACM TOPLAS, 12, 2, 1990.
C. Morgan: Types and invariants in the refinement calculus; LNCS 375, 1989.
J.M. Morris: A theorical basis for stepwise refinement and the programming calculus; SCP, 9(3), 1987.
N. Wirth: Program Development by Stepwise Refinement. CACM, 14, 4, 1971.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Damy, S., Perrin, GR. (1992). A refinement of communicating processes. In: Etiemble, D., Syre, JC. (eds) PARLE '92 Parallel Architectures and Languages Europe. PARLE 1992. Lecture Notes in Computer Science, vol 605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55599-4_136
Download citation
DOI: https://doi.org/10.1007/3-540-55599-4_136
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55599-5
Online ISBN: 978-3-540-47250-6
eBook Packages: Springer Book Archive