Partition consistency. A case study in modeling systems with weak memory consistency and proving correctness of their implementations

DOI10.1007/s00446-013-0205-0zbMath1320.68045arXiv1306.0077OpenAlexW2963560569MaRDI QIDQ2256965

Lisa Higham, Steven Cheng, Jalal Kawash

Publication date: 23 February 2015

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.0077

zbMATH Keywords

sequential consistencyprocessor consistencycorrectness of distributed implementationsdistributed-shared memorypartial-order broadcastweak memory consistency models

Mathematics Subject Classification ID

Distributed systems (68M14)

Uses Software

• Checkfence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Implementing sequentially consistent programs on processor consistent platforms
• A semantics for concurrent separation logic
• On interprocess communication. I: Basic formalism
• The equational theory of pomsets
• A unified theory of shared memory consistency
• Formalising Java’s Data Race Free Guarantee
• Capturing Register and Control Dependence in Memory Consistency Models with Applications to the Itanium Architecture
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Time, clocks, and the ordering of events in a distributed system
• The Java memory model
• Reactive Systems
• Mathematizing C++ concurrency

This page was built for publication: Partition consistency. A case study in modeling systems with weak memory consistency and proving correctness of their implementations