Concurrent systems software is widely-used, complex, and error-prone, posing a significant
security risk. We introduce VRM, a new framework that makes it possible for the first time to …

Program logics and semantics tell a pleasant story about sequential composition: when
executing (S1; S2), we first execute S1 then S2. To improve performance, however …

While causal consistency is one of the most fundamental consistency models weaker than
sequential consistency, the decidability of safety verification for (finite-state) concurrent …

Existing semantic formalisations of the Intel-x86 architecture cover only a small fragment of
its available features that are relevant for the consistency semantics of multi-threaded …

Rely-guarantee (RG) is a highly influential compositional proof technique for concurrent
programs, which was originally developed assuming a sequentially consistent shared …

Remote direct memory access (RDMA) is a modern technology enabling networked
machines to exchange information without involving the operating system of either side, and …

Rely/guarantee reasoning provides a compositional approach to reasoning about
concurrent programs. However, such reasoning traditionally assumes a sequentially …

Local data-race-freedom guarantees, ensuring strong semantics for locations accessed by
non-racy instructions, provide a fruitful methodology for modular reasoning in relaxed …

We address the problem of verifying the reachability problem in programs running under the
formal model Px86 defined recently by Raad et al. in POPL'20 for the persistent Intel x86 …

We present the first specification and verification of an implementation of a causally-
consistent distributed database that supports modular verification of full functional …