A criterion for atomicity

DOI10.1007/BF01212305zbMath0746.68057OpenAlexW1976859557MaRDI QIDQ1192605

James H. Anderson, Mohamed G. Gouda

Publication date: 27 September 1992

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01212305

zbMATH Keywords

snapshotinterleaving semanticsatomic registersleader electionatomicitymodels of concurrencyshared variableswaitingcomposite registers

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Composite registers ⋮ Efficient algorithms for checking the atomicity of a run of read and write operations

Cites Work

• Unnamed Item
• Adequate proof principles for invariance and liveness properties of concurrent programs
• On interprocess communication. I: Basic formalism
• Beyond atomic registers: Bounded wait-free implementations of nontrivial objects
• The ``Hoare Logic of CSP, and All That
• Axioms for memory access in asynchronous hardware systems
• Efficient synchronization of multiprocessors with shared memory
• Constructing two-writer atomic registers
• Atomic snapshots of shared memory
• The elusive atomic register
• Randomized wait-free concurrent objects (extended abstract)
• Proof of a structured program: 'The sieve of Eratosthenes'

This page was built for publication: A criterion for atomicity