Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

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… 
2007
2007
We describe the combination of OWL and F-Logic for the architecture of Semantic Web application nodes. The approach has been… 
2007
2007
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… 
2000
2000
  • F. Manne
  • Annual Conference on Innovation and Technology in…
  • 2000
  • Corpus ID: 31281792
Several constructions implement more powerful registers from weaker ones. Their correctness proofs should be accessible to… 
1994
1994
How to construct shared data objects is a fundamental issue in asynchronous concurrent systems, since these objects provide the… 
Review
1994
Review
1994
1990
1990
A fundamental aspect of any concurrent system is how processes communicate with each other. Ultimately, all communication… 
Highly Cited
1989
Highly Cited
1989
  • Serge A. Plotkin
  • ACM SIGACT-SIGOPS Symposium on Principles of…
  • 1989
  • Corpus ID: 1107766
In this paper we consider implementation of atomic wait-free objects in the context of a shared-memory multiprocessor. We… 
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…