Objects Shared by Byzantine Processes
(Extended Abstract)
Dahlia Malkhi5 
, Michael Merritt6 , Michael Reiter7 and Gadi Taubenfeld8, 9
| (5) |
School of Comuter Science and Engineering, The Hebrew University of Jerusalem, Israel |
| (6) |
AT&T Labs, 180 Park Ave., Florham Park, NJ, 07932-0971 |
| (7) |
Bell Laboratories, Lucent Technologies, 600 Mountain Ave., Murray Hill, NJ, 07974 |
| (8) |
The Open University, 16 Klausner st., P.O.B. 39328, Tel-Aviv, 61392, Israel |
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).
School of Comuter Science and Engineering, The Hebrew University of Jerusalem, Israel. daliaacs@cs.huji.ac.il
AT&T Labs, 180 Park Ave., Florham Park, NJ 07932-0971. mischu@research.att.com
Bell Laboratories, Lucent Technologies, 600 Mountain Ave., Murray Hill, NJ 07974. reiter@research.bell-labs.com
The Open University, 16 Klausner st., P.O.B. 39328, Tel-Aviv 61392, Israel, and AT&T Labs. gadi@cs.openu.ac.il
References secured to subscribers.