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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Modular Relaxed Dependencies in Weak Memory Concurrency

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Rainbow Interaction Seminars Cambridge University Engineering Department, Language Unit Meeting Room Average on weekdays: 8955.41330998 kWh

Other talks

Together Now: Cooperation and Collaboration in Social Art Practice FILM: One With The Whale Mergers all the way down: simulating the origin of globular clusters in a galactic context The role of radiation in cancer care: a spotlight on cancers of the oesophagus, head and neck Title to be confirmed Beyond Hubble: Studying the Earliest Galaxies with the James Webb Space Telescope
 

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