Abstract
In this paper we develop a Hoare-style proof system for partial correctness of programs written in the parallel object-oriented language POOL.
Preview
Unable to display preview. Download preview PDF.
References
P. America, F.S. de Boer: A proof theory for a sequential version of POOL, C.W.I. Report, to appear.
P. America: Definition of the programming language POOL-T. ESPRIT project 415A, Doc. No. 0091, Philips Research Laboratories, Eindhoven, the Netherlands, September 1985.
K.R. Apt: Formal justification of a proof system for CSP. Journal ACM, Vol. 30, No. 1, 1983, pp. 197–216.
K.R. Apt, N. Francez, W.P. de Roever: A proof system for communicating processes, ACM Transactions on Programming Languages and Systems, Vol. 2, No. 3, 1980, pp. 359–385.
R. Gerth, W.P. de Roever: A proof system for concurrent Ada programs. Science of Computer Programming 4, pp. 159–204.
J. Zwiers, W.P. de Roever, P. van Emde Boas: Compositionality and concurrent networks: soundness and completeness of a proof system. In: Proceedings of the 12th International Colloquium on Automata, Languages and Programming (ICALP), Nafplion, Greece, July 15–19, 1985, Springer Lecture Notes in Computer Science 194, pp. 509–519.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Boer, F.S. (1990). A proof system for the parallel object-oriented language POOL. In: Paterson, M.S. (eds) Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, vol 443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032059
Download citation
DOI: https://doi.org/10.1007/BFb0032059
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52826-5
Online ISBN: 978-3-540-47159-2
eBook Packages: Springer Book Archive