Abstract
Disjoint parallelism is a rather restricted form of concurrency. In applications, concurrently operating components often share resources, such as a common data base, a line printer or a data bus. Sharing is necessary when resources are too costly to have one copy for each component, as in the case of a large data base. Sharing is also useful to establish communication between different components, as in the case of a data bus. This form of concurrency can be modeled by means of parallel programs with shared variables, variables that can be changed and read by several components.
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.
References
K.R. Apt, F.S. de Boer, and E.-R. Olderog. Proving termination of parallel programs. In W.H.J. Feijen, A.J.M. van Gasteren, D. Gries, and J. Misra, editors, Beauty is our Business, A Birthday Salute to Edsger W. Dijkstra, pages 0–6, New York, 1990. Springer-Verlag.
E. Ashcroft and Z. Manna. Formalization of properties of parallel programs. Machine Intelligence, 6: 17–41, 1971.
R.J.R. Back. A method for refining atomicity in parallel algorithms. In PARLE Conference on Parallel Architectures and Languages Europe,pages 199–216, New York, 1989. Lecture Notes in Computer Science 366, Springer-Verlag.
J.W. de Bakker. Mathematical Theory of Program Correctness. Prentice-Hall International, Englewood Cliffs, NJ, 1980.
K.M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, New York, 1988.
T. Elrad and N. Francez. Decompositions of distributed programs into communication closed layers. Science of Computer Programming, 2 (3): 155–173, 1982.
L. Flon and N. Suzuki. Nondeterminism and the correctness of parallel programs In E.J. Neuhold, editor, Formal Description of Programming Concepts, pages 598–608, Amsterdam, 1978. North-Holland.
L. Flon and N. Suzuki. The total correctness of parallel programs. SIAM Journal on Computing, pages 227–246, 1981.
E. Knapp. Derivation of parallel programs. two examples. 1990. Note.
L. Lamport. Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering, SE-3: 2: 125–143, 1977.
R. Lipton. Reduction: a method of proving properties of parallel programs. Communications of the ACM, 18: 717–721, 1975.
S.Owicki and D. Gries An axiomatic proof technique for parallel programs. Acta Informatica, 6: 319–340, 1976.
S. Owicki. Verifying concurrent programs with shared data classes. In E.J. Neuhold, editor, Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts, pages 279–298. North-Holland, 1978.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media New York
About this chapter
Cite this chapter
Apt, K.R., Olderog, ER. (1991). Parallel Programs with Shared Variables. In: Verification of Sequential and Concurrent Programs. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-4376-0_6
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4376-0_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-4378-4
Online ISBN: 978-1-4757-4376-0
eBook Packages: Springer Book Archive