Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,148,164 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Atomic semantics
Central processing unit
Consistency model
Parallel computing
Expand
Broader (1)
Concurrency control
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority
Y. Moses
,
Katia Patkin
Colloquium on Structural Information…
2015
Corpus ID: 32267637
A new approach to the study and analysis of Mutual Exclusion ME algorithms is presented, based on identifying the priority…
Expand
2007
2007
Combining OWL with F-Logic Rules and Defaults
Heiko Kattenstroth
,
Wolfgang May
,
F. Schenk
Applications of Logic Programming to the Web…
2007
Corpus ID: 7171124
We describe the combination of OWL and F-Logic for the architecture of Semantic Web application nodes. The approach has been…
Expand
2007
2007
Wait-free regular storage from Byzantine components
Ittai Abraham
,
G. Chockler
,
I. Keidar
,
D. Malkhi
Information Processing Letters
2007
Corpus ID: 14759960
Highly Cited
2004
Highly Cited
2004
Byzantine disk paxos: optimal resilience with byzantine shared memory
Ittai Abraham
,
G. Chockler
,
I. Keidar
,
D. Malkhi
ACM SIGACT-SIGOPS Symposium on Principles of…
2004
Corpus ID: 2096021
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n < 3t disks, t of…
Expand
2000
2000
Competing in computing (poster session)
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…
Expand
1994
1994
How a Rainbow Coloring Function Can Simulate Wait-Free Handshaking
M. Papatriantafilou
,
P. Tsigas
International Symposium on Mathematical…
1994
Corpus ID: 16405218
How to construct shared data objects is a fundamental issue in asynchronous concurrent systems, since these objects provide the…
Expand
Review
1994
Review
1994
Towards Verified Systems
Jonathan P. Bowen
1994
Corpus ID: 60706175
1990
1990
Bounds on the Costs of Register Implementations
S. Chaudhuri
,
J. Welch
International Workshop on Distributed Algorithms
1990
Corpus ID: 39647104
A fundamental aspect of any concurrent system is how processes communicate with each other. Ultimately, all communication…
Expand
Highly Cited
1989
Highly Cited
1989
Sticky bits and universality of consensus
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…
Expand
Highly Cited
1986
Highly Cited
1986
The mutual exclusion problem: part I—a theory of interprocess communication
L. Lamport
JACM
1986
Corpus ID: 12012739
A novel formal theory of concurrent systems that does not assume any atomic operations is introduced. The execution of a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE