A New Approach to Proving the Correctness of Multiprocess Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent reading and writing
Communications of the ACM
Principles of Database Systems
Principles of Database Systems
On cacheability of lock-variables in tightly coupled multiprocessor systems
ACM SIGARCH Computer Architecture News
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The elusive atomic register revisited
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
On Lamport's interprocessor communication model
ACM Transactions on Programming Languages and Systems (TOPLAS)
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Atomic snapshots of shared memory
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Sequential consistency versus linearizability (extended abstract)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
On reasoning with the global time assumption
ACM Letters on Programming Languages and Systems (LOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Atomic snapshots of shared memory
Journal of the ACM (JACM)
The power of processor consistency
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Journal of the ACM (JACM)
Sequential consistency versus linearizability
ACM Transactions on Computer Systems (TOCS)
Mixed consistency: a model for parallel programming (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Scalable Consistency Protocols for Distributed Services
IEEE Transactions on Parallel and Distributed Systems
On beyond registers: wait-free readable objects
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Sequential consistency as lazy linearizability
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Dijkstra's Self-Stabilizing Algorithm in Unsupportive Environments
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Proof of correctness of Ressel's adOPTed algorithm
Information Processing Letters
Relationships between memory models
Information Processing Letters
A page-coherent, causally consistent protocol for distributed shared memory
Journal of Systems and Software
Distributed Computing
Multi-writer composite registers
Distributed Computing
Time and space optimal implementations of atomic multi-writer register
Information and Computation
Specifying memory consistency of write buffer multiprocessors
ACM Transactions on Computer Systems (TOCS)
Globally synchronized dead-reckoning with local lag for continuous distributed multiplayer games
NetGames '06 Proceedings of 5th ACM SIGCOMM workshop on Network and system support for games
On specification of Read/Write shared variables
Journal of the ACM (JACM)
A parametrized algorithm that implements sequential, causal, and cache memory consistencies
Journal of Systems and Software
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Time and space optimal implementations of atomic multi-writer register
Information and Computation
What consistency does your key-value store actually provide?
HotDep'10 Proceedings of the Sixth international conference on Hot topics in system dependability
Analyzing consistency properties for fun and profit
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Don't settle for eventual: scalable causal consistency for wide-area storage with COPS
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
Group communication: from practice to theory
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Dependable Systems
Data-race and concurrent-write freedom are undecidable
Computer Languages, Systems and Structures
| Hi-index | 0.00 |
The problem of concurrent accesses to registers by asynchronous components is considered. A set of axioms about the values in a register during concurrent accesses is proposed. It is shown that if these axioms are met by a register, then concurrent accesses to it may be viewed as nonconcurrent, thus making it possible to analyze asynchronous algorithms without elaborate timing analysis of operations. These axioms are shown, in a certain sense, to be the weakest. Motivation for this work came from analyzing low-level hardware components in a VLSI chip which concurrently accesses a flip-flop.