We present a denotational semantics for weak memory concurrency that avoids thin-air
reads, provides data-race free programs with sequentially consistent semantics (DRF-SC) …

We investigate the problem of developing an" in-order" shared-memory concurrency model
for languages like C and C++, which executes instructions following their program order …

We present a compositional denotational semantics for a functional language with first-class
parallel composition and shared-memory operations whose operational semantics follows …

We formally show that sequential reasoning is adequate and sufficient for establishing
soundness of various compiler optimizations under weakly consistent shared-memory …

A memory model defines the semantics of concurrent programs operating on a shared
memory. The most well-known and intuitive memory model, sequential consistency, is too …

We revisit the fundamental problem of defining a compositional semantics for a concurrent
programming language under sequentially consistent memory with the aim of equating the …

Weak memory models for concurrent programming languages are expected to admit
standard compiler optimizations. However, prior works on verifying optimizations in weak …

Modern processors deploy a variety of weak memory models for efficiency reasons. Total
Store Order (TSO) is a widely used weak memory model which omits store-load constraint …

DEDUCTIVE TECHNIQUES Page 1 DEDUCTIVE TECHNIQUES for Model-Based Concurrency
Verification Wytse Oortwijn Page 2 Deductive Techniques for Model-Based Concurrency …

Optimizing compilers change a program based on a formal analysis of its code, and modern
processors further rearrange the program order. It is hard to reason about such …