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

Existing dynamic partial order reduction (DPOR) algorithms scale poorly on concurrent data
structure benchmarks because they visit a huge number of blocked executions due to …

Fairness properties, which state that a sequence of bad events cannot happen infinitely
before a good event takes place, are often crucial in program verification. However, general …

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

Concurrent bounded queues have been widely used for exchanging data and profiling in
operating systems, databases, and multithreaded applications. The performance of state-of …

We consider the verification of liveness properties for concurrent programs running on weak
memory models. To that end, we identify notions of fairness that preclude demonic non …

After more than 30 years of research, there is a solid understanding of the consistency
guarantees given by CPU systems. Unfortunately, the same is not yet true for GPUs. The …

The goal of this work is to improve the efficiency of bounded model checkers that are
modular in the memory model. Our first contribution is a static analysis for the given 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 …

As GPU availability has increased and programming support has matured, a wider variety of
applications are being ported to these platforms. Many parallel applications contain fine …