Objects shared by Byzantine processes

Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld

Research output: Contribution to journalArticlepeer-review


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).

Original languageEnglish
Pages (from-to)37-48
Number of pages12
JournalDistributed Computing
Issue number1
StatePublished - Feb 2003


  • Byzantine faults
  • Consensus
  • Emulation
  • Shared memory


Dive into the research topics of 'Objects shared by Byzantine processes'. Together they form a unique fingerprint.

Cite this