Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Safe semantics

Known as: Safe register 
Safe semantics is a consistency model that describes one type of guarantee a data register provides when it is shared by several processors in a… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A new approach to the study and analysis of Mutual Exclusion ME algorithms is presented, based on identifying the priority… Expand
Is this relevant?
2007
2007
We describe the combination of OWL and F-Logic for the architecture of Semantic Web application nodes. The approach has been… Expand
  • figure 1
Is this relevant?
2007
2007
We consider the problem of implementing a wait-free regular register from storage components prone to Byzantine faults. We… Expand
  • figure 1
  • figure 3
Is this relevant?
2006
2006
We demonstrate that the safe register abstraction is an inappropriate model of a shared bit variable in an ACM. This is due to… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 6
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n < 3t disks, t of… Expand
  • figure 1
  • figure 6
  • figure 7
  • figure 8
  • figure 9
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus protocol that uses a collection of n > 3t disks, t of… Expand
Is this relevant?
2000
2000
  • F. Manne
  • ITiCSE '00
  • 2000
  • Corpus ID: 31281792
Several constructions implement more powerful registers from weaker ones. Their correctness proofs should be accessible to… Expand
Is this relevant?
1990
1990
A fundamental aspect of any concurrent system is how processes communicate with each other. Ultimately, all communication… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
In this paper we consider implementation of atomic wait-free objects in the context of a shared-memory multiprocessor. We… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1986
Highly Cited
1986
A novel formal theory of concurrent systems that does not assume any atomic operations is introduced. The execution of a… Expand
  • figure 1
Is this relevant?