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 …

Multi-execution memory models, such as Promising and Weakestmo, are an advanced class
of weak memory consistency models that justify certain outcomes of a concurrent program …

We present a monadic denotational semantics for a higher-order programming language
with shared-state concurrency, ie global-state in the presence of interleaving concurrency …

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 …

Modern processors such as ARMv8 and RISC-V allow executions in which independent
instructions within a process may be reordered. To cope with such phenomena, so called …

Verification techniques for C11 programs have advanced significantly in recent years with
the development of operational semantics and associated logics for increasingly large …

In recent years, there has been a trend towards the use of accelerators and architectural
specialization to continue scaling performance in spite of a slowing of Moore's Law. GPUs …

The C/C++ memory model provides a range of mechanisms that programmers of concurrent
code can use to control accesses to shared variables. The C standard describes the memory …