Abstract
Many formal models of concurrent programs are based on the notion of interleaving: in executing a concurrent program, only one enabled action is executed at each step. This notion has both its advantages and disadvantages.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Gouda, M.G. (1990). Serializable Programs, Parallelizable Assertions: A Basis for Interleaving. In: Feijen, W.H.J., van Gasteren, A.J.M., Gries, D., Misra, J. (eds) Beauty Is Our Business. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4476-9_16
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4476-9_16
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8792-6
Online ISBN: 978-1-4612-4476-9
eBook Packages: Springer Book Archive