Axioms for memory access in asynchronous hardware systems
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
The global time assumption and semantics for concurrent systems
PODC '88 Proceedings of the seventh 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)
A correctness condition for high-performance multiprocessors (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Mixed consistency: a model for parallel programming (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Timed consistency for shared distributed objects
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
A New Approach to Proving the Correctness of Multiprocess Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Framework for Programming Using Non-Atomic Variables
Proceedings of the 8th International Symposium on Parallel Processing
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
A Simple Characterization of Database Serializability
Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
A Proof Technique for Register Automicity
Proceedings of the Eighth Conference on Foundations of Software Technology and Theoretical Computer Science
From Causal Consistency to Sequential Consistency in Shared Memory Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Applications of Probabilistic Quorums to Iterative Algorithms
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
A unified theory of shared memory consistency
Journal of the ACM (JACM)
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
IEEE Transactions on Computers
Interconnection of distributed memory models
Journal of Parallel and Distributed Computing
| Hi-index | 0.01 |
A shared variable is an abstraction of persistent interprocess communication. Processors execute operations, often concurrently, on shared variables to exchange information among themselves. The behavior of operation executions is required to be “consistent” for effective interprocess communication. Consequently, a consistency specification of a shared variable describes some guarantees on the behavior of the operation executions. A Read/Write shared variable has two operations: a Write stores a specified value in the variable and a Read returns a value from the variable. For Read/Write variables, a consistency specification describes what values Reads may return. Using an intuitive notion of illegality of Reads, we propose a framework that facilitates specifying a large variety of Read/Write variables.