Abstract
Hoare introduced abstraction functions for reasoning about abstract data types in 1972 [1]. What happens in the presence of concurrency? Reasoning about objects in a concurrent system necessitates extending the notion of abstraction functions in order to model the system’s inherent nondeterminisitic behavior. My talk presented in detail the extensions required to reason about lock-free concurrent objects, used to build linearizable systems. It also discussed briefly a different extension required to reason about atomic objects, used to build fault-tolerant distributed systems.
Much of this work is joint with Maurice Herlihy and previously published in two papers [2, 3].
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
References
C.A.R. Hoare, “Proof of Correctness of Data Representations,” Ada Informatica, Vol. 1, 1972, pp. 271–281.
M.P. Herlihy and J.M. Wing, “Linearizability: A Correctness Condition for Concurrent Objects,” ACM TOPLAS, Vol. 12, No. 3, July 1990, pp. 463–492.
J.M. Wing, “Verifying Atomic Data Types,” International Journal of Parallel Programming, Vol. 18, No. 5, 1989, pp. 315–357.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag London
About this paper
Cite this paper
Wing, J.M. (1992). Revisiting Abstraction Functions For Reasoning About Concurrency. In: Jones, C.B., Shaw, R.C., Denvir, T. (eds) 5th Refinement Workshop. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3550-0_15
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3550-0_15
Publisher Name: Springer, London
Print ISBN: 978-3-540-19752-2
Online ISBN: 978-1-4471-3550-0
eBook Packages: Springer Book Archive