Abstract
The current paper deals with the issues of axiomatic semantics of communication primitives in distributed programs. As a sample language we use a certain class of distributed programs with a synchronous mode of communication regarded as standard. A compositional proof system dealing with partial correctness of distributed programs is presented. The correctness of formalization is justified by proving the system to be sound and relatively complete. The proof is based on the given operational semantics. We also consider the structure of interrelation predicates — global invariants of distributed programs. This is done in order to get insight into the correspondence between communication modes and proof systems which define axiomatic semantics of distributed programs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Apt K.R. (1983). Formal justification of a proof system for communicating sequential processes Journal of the ACM 30, No. 1, pp. 197–216.
Cook S.A. (1978). Soundness and completeness of an axiom system for program verification SIAM J. Comput. 7, No. 1, pp.70–90
Francez N., Hoare C.A.R., Lehmann D.J.,de Roever W.P. (1979). Semantics of nondeterminism, concurrency, and communication Journal of Computer and System Sciences 19, No. 3, pp.290–308.
Gečas K. (1988). An axiom system for proving properties of simple multimodular programs Kibernetika (Kiev) No. 2 pp. 33–38. (in Russian)
Gorochovskij S.S.,Kapitonova J.V.,Letichevskij A.A.,Molchanov I.N., Pogrebinskij S.B. (1984). Algorithmic language MAJAK Kibernetika, No. 3, pp.54–74. (in Russian)
Hoare C.A.R. (1969). Axiomatic basis for computer programming Comm. of ACM 12, No. 10, pp. 576–580
Hoare C.A.R. (1978). Communicating sequential processes Comm. of the ACM 21, No. 8, pp.666–677.
Hooman J., de Roever W.P. (1986). The quest goes on: a survey of proofsystems for partial correctness of CSP Lect. Notes Comp. Sci. 224, pp. 343–395
Letichevskij A.A., Godlevskij A.B., Doroshenko A.E., Krivoj S.L. (1983). A semantics of data communication in simple multimodular programs Programmirovanie, No. 5, pp. 3–11. (in Russian)
Levin G.M., Gries D. (1981). A proof technique for communicating sequential processes Acta Informatica 15, No. 2, pp. 281–302.
Nepomnyashchij V.A. (1986). On problem-oriented program verification Programmirovanie No. 1, pp. 3–13. (in Russian)
Plotkin G.D. (1983). An operational semantics for CSP In: Formal Descriptions of Programming Consepts, North-Holl., Amsterdam pp. 199–223
Soundararajan N. (1984). Axiomatic semantics of communicating sequential processes ACM Trans. Progr. Lang. Sys. 6, No. 4, pp.647–662.
Zwiers J.,de Roever W.P.,van Emde Boas P. (1985). Compositionality and concurrent networks: soundness and completeness of a proofsystem Lect. Notes in Comp. Sci. 194, pp.509–519.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gečas, K. (1991). A compositional proof system for distributed programs. In: Bārzdinš, J., Bjørner, D. (eds) Baltic Computer Science. BCS 1991. Lecture Notes in Computer Science, vol 502. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019365
Download citation
DOI: https://doi.org/10.1007/BFb0019365
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54131-8
Online ISBN: 978-3-540-47427-2
eBook Packages: Springer Book Archive