Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.
Safe semantics
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Abstract This paper addresses for the first time the problem of MWMR atomic memory in a Mobile Byzantine Agents model. The… Expand
2015
2015
A new approach to the study and analysis of Mutual Exclusion ME algorithms is presented, based on identifying the priority… Expand
2007
2007
We describe the combination of OWL and F-Logic for the
architecture of Semantic Web application nodes. The approach has been… Expand
2007
2007
We consider the problem of implementing a wait-free regular register from storage components prone to Byzantine faults. We… Expand
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
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
2000
2000
Several constructions implement more powerful registers from weaker ones. Their correctness proofs should be accessible to… Expand
1990
1990
A fundamental aspect of any concurrent system is how processes communicate with each other. Ultimately, all communication… Expand
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
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
