University of Cambridge > Talks.cam > Semantics Lunch (Computer Laboratory) > Relaxed-Memory Concurrency and Verified Compilation

Relaxed-Memory Concurrency and Verified Compilation

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

If you have a question about this talk, please contact Sam Staton.

I will describe the semantic design and verified compilation of a C-like programming language for concurrent shared-memory computation above x86 multiprocessors. I will start with the correctness statement, including the surprisingly subtle design of a relaxed x86-like memory model for a realistic subset of C. Then I will outline our overall proof strategy, which is largely inspired by Xavier Leroy’s CompCert compiler that we build on, with several interesting twists. Finally, I will explain some of the curious subtleties encountered in the semantic design and in the proof.

This is joint work with Viktor Vafeiadis, Francesco Zappa Nardelli, Suresh Jagannathan, and Peter Sewell.

This talk is part of the Semantics Lunch (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-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity