Abstract
In this paper an assertional proof method is introduced which captures concurrent systems consisting of dynamically created recursive processes which interact via shared-variables. The main contribution is a generalization of the Owicki & Gries proof method and a formal justification by soundness and completeness.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Apt, K.R.: Ten years of Hoare logic: a survey — part I. ACM Transactions on Programming Languages and Systems 3(4), 431–483 (1981)
Apt, K.R.: Formal justification of a proof system for Communicating Sequential Processes. Journal of the ACM 30(1), 197–216 (1983)
Apt, K.R., Francez, N., de Roever, W.P.: A proof system for Communicating Sequential Processes. ACM Transactions on Programming Languages and Systems 2, 359–385 (1980)
de Boer, F.S.: A Sound and Complete Shared-Variable Concurrency Model for Multi-threaded Java Programs. In: Bonsangue, M.M., Johnsen, E.B. (eds.) FMOODS 2007. LNCS, vol. 4468, pp. 252–268. Springer, Heidelberg (2007)
Gorelick, G.A.: A complete axiomatic system for proving assertions about recursive and non-recursive programs. Technical Report 75, Department of Computer Science, University of Toronto (1975)
Owicki, S.: A consistent and complete deductive system for the verification of parallel programs. In: Proceedings of the eighth annual ACM symposium on Theory of computing. ACM Press, New York (1976)
Owicki, S., Gries, D.: An axiomatic proof technique for parallel programs. Acta Informatica 6, 319–340 (1976)
Tucker, J.V., Zucker, J.I.: Program Correctness over Abstract Data Types, with Error-State Semantics. CWI Monograph Series, vol. 6. Centre for Mathematics and Computer Science/North-Holland (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
de Boer, F.S. (2010). Reasoning about Recursive Processes in Shared-Variable Concurrency. In: Dams, D., Hannemann, U., Steffen, M. (eds) Concurrency, Compositionality, and Correctness. Lecture Notes in Computer Science, vol 5930. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11512-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-11512-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11511-0
Online ISBN: 978-3-642-11512-7
eBook Packages: Computer ScienceComputer Science (R0)