Abstract.
Work to date on algorithms for message-passing systems has explored a wide variety of types of faults, but corresponding work on shared memory systems has usually assumed that only crash faults are possible. In this work, we explore situations in which processes accessing shared objects can fail arbitrarily (Byzantine faults).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: December 2000 / Accepted: July 2002
RID="*"
ID="*" A preliminary version of the results presented in this paper appeared in Proceedings of the 14th International Symposium on Distributed Computing, Toledo, Spain, October 2000.
Rights and permissions
About this article
Cite this article
Malkhi, D., Merritt, M., Reiter, M. et al. Objects shared by Byzantine processes. Distrib Comput 16, 37–48 (2003). https://doi.org/10.1007/s00446-002-0075-3
Issue Date:
DOI: https://doi.org/10.1007/s00446-002-0075-3