University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Modular Relaxed Dependencies in Weak Memory Concurrency

Modular Relaxed Dependencies in Weak Memory Concurrency

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Jean Pichon-Pharabod.

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), and supports a compositional refinement relation for validating optimisations. We then use this semantics to fix the C+ memory model, which we call RD-C11 (Relaxed Dependencies C11 ). We show RD-C11 is the first C+ model the avoids thin-air reads that is aligned with the axiomatic-style specification of the ISO standard, provides the DRF -SC property, is efficiently implementable over hardware architectures and that is tested via a simulator over a battery of litmus tests.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2020 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity