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

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 …

Compiler correctness proofs for higher-order concurrent languages are difficult: they involve
establishing a termination-preserving refinement between a concurrent high-level source …

Value-dependent noninterference allows the classification of program variables to depend
on the contents of other variables, and therefore is able to express a range of data …

We present civl, a language and verifier for concurrent programs based on automated and
modular refinement reasoning. civl supports reasoning about a concurrent program at many …

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

Specifications are a necessary reference point for correctness arguments. Top-down
descriptions of concurrent programs require a way of recording information about the …

Compositionality is at the core of programming languages research and has become an
important goal toward scalable verification of large systems. Despite that, there is no …

The diffusion of service-based and cloud-based systems has created a scenario where
software is often made available as services, offered as commodities over corporate …

We study abstraction for crash-resilient concurrent objects using non-volatile memory
(NVM). We develop a library-correctness criterion that is sound for ensuring contextual …