On the composability of consistency conditions

DOI10.1016/S0020-0190(02)00498-2zbMath1173.68385OpenAlexW2116569164MaRDI QIDQ1007594

Roy Friedman, Roman Vitenberg, Gregory Chockler

Publication date: 23 March 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00498-2

zbMATH Keywords

formal semanticsdistributed systemsdistributed computingconcurrency

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Distributed systems (68M14)

Related Items

Relaxed data types as consistency conditions

Cites Work

• Limitations of fast consistency conditions for distributed shared memories
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• A Correctness Condition for High-Performance Multiprocessors
• Causal memory: definitions, implementation, and programming
• A checkpoint protocol for an entry consistent shared memory system
• Unnamed Item

This page was built for publication: On the composability of consistency conditions