A formal hierarchy of weak memory models

Authors:
Jade Alglave
Affiliations:
INRIA, Rocquencourt, France and Oxford University, Oxford, UK and Queen Mary University of London, London, UK
Venue:
Formal Methods in System Design
Year:
2012

Citing 29
Cited 1

Memory Access Dependencies in Shared-Memory Multiprocessors

IEEE Transactions on Software Engineering
Race-free interconnection networks and multiprocessor consistency

ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
The SPARC architecture manual: version 8

The SPARC architecture manual: version 8
Reasoning about parallel architectures

Reasoning about parallel architectures
The power of processor consistency

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
The SPARC architecture manual (version 9)

The SPARC architecture manual (version 9)
Designing memory consistency models for shared-memory multiprocessors

Designing memory consistency models for shared-memory multiprocessors
How to Make a Correct Multiprocess Program Execute Correctly on a Multiprocessor

IEEE Transactions on Computers
Shared Memory Consistency Models: A Tutorial

Computer
Information-Flow Models for Shared Memory with an Application to the PowerPC Architecture

IEEE Transactions on Parallel and Distributed Systems
The complexity of verifying memory coherence

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Memory Consistency Models for Shared-Memory Multiprocessors

Memory Consistency Models for Shared-Memory Multiprocessors
TSOtool: A Program for Verifying Memory Systems Using the Memory Consistency Model

Proceedings of the 31st annual international symposium on Computer architecture
The Java memory model

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
UMM: an operational memory model specification framework with integrated model checking capability: Research Articles

Concurrency and Computation: Practice & Experience - 2002 ACM Java Grande—ISCOPE Conference Part I
Memory Model = Instruction Reordering + Store Atomicity

Proceedings of the 33rd annual international symposium on Computer Architecture
Foundations of the C++ concurrency memory model

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Effective Program Verification for Relaxed Memory Models

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
The semantics of x86-CC multiprocessor machine code

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relaxed memory models: an operational approach

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Better x86 Memory Model: x86-TSO

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Memory models: a case for rethinking parallel languages and hardware

Communications of the ACM
Litmus: running tests against hardware

TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Understanding POWER multiprocessors

Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Stability in weak memory models

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Fences in weak memory models

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Verifying local transformations on relaxed memory models

CC'10/ETAPS'10 Proceedings of the 19th joint European conference on Theory and Practice of Software, international conference on Compiler Construction
Parameterized memory models and concurrent separation logic

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Soundness of data flow analyses for weak memory models

APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems

Software verification for weak memory via program transformation

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present in this paper a formal generic framework, implemented in the Coq proof assistant, for defining and reasoning about weak memory models. We first present the three axioms of our framework, with several examples as illustration and justification. Then we show how to implement several existing weak memory models in our framework, and prove formally that our implementation is equivalent to the native definition for each of these models.