Abstract
We present some new theorems that equate an iteration to a sequential composition of stronger iterations, and use these theorems to simplify and generalize a number of known techniques for pretending atomicity in concurrent programs.
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
Back, R.J.R.: Refining atomicity in parallel algorithms. In: Parallel Architectures and Languards Europe, Springer, Heidelberg (1989)
Back, R.J.R., von Wright, J.: Reasoning algebraically about loops. Acta Informatica 36(4) (1999)
Doeppner, T.: Parallel program correctness through refinement. In: ACM Symposium on Principles of Programming Languages (1977)
Gouda, M.G., Yu, Y.T.: Protocol validation by maximal progress state exploration. Technical Report CS-TR-211, The University of Texas at Austin (1982)
Kozen, D.: A completeness theorem for Kleene algebra and the calculus of regular events. Information and Computation 110(2), 366–390 (1994)
Lamport, L.: A theorem on atomicity in distributed algorithms. Distributed COmputing 4, 59–68 (1990)
Lamport, L., Schneider, F.B.: Pretending atomicity. Technical Report Research Report 44, Compaq System Research Center (1989)
Lipton, R.J.: Reduction: A method of proving properties of parallel programs. Communications of the ACM 18(12), 717–721 (1975)
Papadimitriou, C.: The Theory of Database Concurrency Control. Computer Science Press, Rockville (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cohen, E. (2000). Separation and Reduction. In: Backhouse, R., Oliveira, J.N. (eds) Mathematics of Program Construction. MPC 2000. Lecture Notes in Computer Science, vol 1837. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722010_4
Download citation
DOI: https://doi.org/10.1007/10722010_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67727-7
Online ISBN: 978-3-540-45025-2
eBook Packages: Springer Book Archive