Abstract
A weakest precondition semantics for communicating processes is presented, based on a centralized approach. Semantic equations are given for the CSP constructs. The representation of delay is discussed. Several examples of applying the rules are given.
The work of the first author was supported by NSF grant MCS-80-17577.
The work of the second author was supported by a grant by IBM-Israel.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Preliminary ADA reference manual. SIGPLAN notices 14, 6 (June 1979).
K.R. Apt, N. Francez, W.P. de Roever: A proof system for communicating sequential processes, ACM-TOPLAS, 2, 1, (July 1980).
P. Brinch Hansen: Distributed processes — a concurrent programming concept. CACM 21, 11 (November 1978).
P. Cousot, R. Cousot: Semantic analysis of communicating sequential processes. Proceedings of the 7-th Colloquium, Automata, Languages and Programming, Nordwijkerhout, July 1980.
Z.C. Chen, A.A.R. Hoare: Partial correctness of communicating sequential processes. Proc. 2nd Int. Symp. on Distributed Systems, Paris (April 1981).
K.M. Chandy, J. Misra: Proofs of networks of processes. IEEE-TSE, SE-7, No. 4 (July 1981).
E.W. Dijkstra: A Discipline of Programming. Prentice Hall, Englewood Cliffs, New Jersey, (1976).
Tz. Elrad: Ph.D. thesis, in preparation.
J.A. Feldman: High level programming for distributed computing. CACM 22, 6 (June 1979).
N. Francez, C.A.R. Hoare, D.J. Lehmann, W.P. de Roever: Semantics of nondeterminism, concurrency and communication, JCSS 19, 3 (December 1979).
N. Francez, D.J. Lehmann, A. Pnueli: A linear history semantics for distributed leanguages. Proc. FOCS Conf. (October 1980).
L. Flon, N. Suzuki: Nondeterminism and the correctness of parallel programs. IFIP working conf. on Formal Description of Programming Concepts, Saint Andrews, 1977.
C.A.R. Hoare: Communicating sequential processes. CACM 21, 8 (August 1978).
G. Levin, D. Gries: A proof technique for communicating sequential processes. Acta Informatica 15 (1981).
A. Van Lamsweerde, M. Sintzoff: Formal derivation of strongly correct concurrent programs. Acta Informatica, Vol. 12, Fasc. 1, (1979).
G. Milne, R. Milner: Concurrent processes and their syntax. JACM 26, 2 (April 1979).
S.S. Owicki, D. Gries: An axiomatic proof technique for parallel programs I. Acta Informatica, 6 (1976).
R. Milner: A Calculus of Communicating Processes. Lecture Notes in Computer Science, No. 92, Springer-Verlag (1980).
G.D. Plotkin: An operational semantics for CSP. Technical Report, Dept. of Computer Science, University of Edinburgh, October 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Elrad, T., Francez, N. (1982). A weakest precondition semantics for communicating processes. In: Dezani-Ciancaglini, M., Montanari, U. (eds) International Symposium on Programming. Programming 1982. Lecture Notes in Computer Science, vol 137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11494-7_7
Download citation
DOI: https://doi.org/10.1007/3-540-11494-7_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11494-9
Online ISBN: 978-3-540-39184-5
eBook Packages: Springer Book Archive