Memory model (programming)

The most intuitive memory model for shared-memory multithreaded programming is sequential consistency(SC), but it disallows the… (More)

We present a class of relaxed memory models, defined in Coq, parameterised by the chosen permitted local reorderings of reads and… (More)

We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture… (More)

Real multiprocessors do not provide the sequentially consistent memory that is assumed by most work on semantics and verification… (More)

Program verification for relaxed memory models is hard. The high degree of nondeterminism in such models challenges standard… (More)

This article presents the formal verification, using the Coq proof assistant, of a memory model for low-level imperative… (More)

A memory model for a concurrent imperative programming language specifies which writes to shared variables may be seen by reads… (More)

We present a memory model to analyze and improve the performance of scientific algorithms on graphics processing units (GPUs… (More)

In this paper, we describe TSOtool, a program to check thebehavior of the memory subsystem in a shared memorymultiprocessor… (More)

The memory consistency model, or memory model, supported by a shared-memory multiprocessor directly affects its performance. The… (More)