Literature Cited
S. S. Gorokhovskii, Yu. V. Kapitonova, A. A. Letichevskii, I. N. Molchanov, and S. B. Potrebinskii, “MAYAK-An Algorithmic Language,” Kibernetika, No. 3, 54 (1984).
C. A. R. Hoare, “An axiomatic basis for computer programming,” Commun. Assoc. Comput. Mach.,12, No. 10, 576 (1969).
G. M. Levin and D. Gries, “A proof technique for communicating sequential processes,” Acta Inform.,15, 281 (1981).
A. A. Letichevskii, A. B. Godlevskii, A. E. Doroshenko, and S. L. Krivoi, “Data exchange semantics in simple multimodule programs,” Programmirovanie, No. 5, 3 (1983).
K. K. Gyachas, “Translation of distributed program into coprograms,” in: Mathematical Logic and Its Applications [in Russian], No. 4, 122 (1985).
S. Owicki and D. Gries, “Verifying properties of parallel programs. An axiomatic approach,” J. Assoc. Comput. Mach.,19, No. 5, 279 (1976).
N. Francez, D. Lehmann, and A. Pnueli, “A linear-history semantics for languages for distributed programming,” Theor. Comput. Sci.,32, No. 1–2, p. 25 (1984).
S. A. Cook, “Soundness and Completeness of an axiom system for program verification,” Technical Report, Univ. of Toronto, No. 95, Toronto (1976).
V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “Theoretical principles of discrete system design,” Kibernetika, No. 6, 5 (1977).
G. D. Plotkin, “An operational semantics for CSP,” in: Formal Descriptions of Programming Concepts, II, North-Holland, Amsterdam (1983), pp. 199–223.
Additional information
Translated from Kibernetika, No. 2, pp. 33–38, March–April, 1988.
Rights and permissions
About this article
Cite this article
Gyachas, K.K. Axiomatic system for proving the properties of simple multimodule programs. Cybern Syst Anal 24, 179–186 (1988). https://doi.org/10.1007/BF01082606
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01082606