|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Mathematizing C++ Concurrency
If you have a question about this talk, please contact Sam Staton.
New versions of C++0x) and of C (C1X) will have new concurrency features, aiming to support high-performance code with well-defined semantics. Unfortunately, as we near the end of the long standardization process, not all has been well. Unsurprisingly, the prose specification style of the draft standards is poorly suited to describe the complex design of the relaxed memory model, and in fact there have been significant problems.
I will discuss work on formalization of the memory model, what was broken, and some resulting improvements to the C++0x draft standard. In addition I will present a tool, Cppmem, for graphically exploring the semantics of small concurrent C++0x programs, and describe a proof of the correctness of a compilation strategy targeting x86-TSO.
This is joint work with Scott Owens, Susmit Sarkar, Peter Sewell, and Tjark Weber.
This talk is part of the Semantics Lunch (Computer Laboratory) series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsClare Hall Lecture: The evolution of Abcam plc - 30 April 2013 Social Mobility: Chavs, NEETs and McJobs Engineers Without Borders
Other talksAdapting Cities and Their Infrastructure to Global Change: An Integrated Modelling Approach to Understand Risks and Tradeoffs Measuring Systemic Illiquidity and Optimal Policy Options: A Dynamic Approach Writing in South Italy: Adaptation, Exchange and Identity Reflections on a career as a professional statistician and the increasing value of the role of professional bodies Capital Adequacy, Pro-cyclicality and Systemic Risk LGB&T Welcome! Bonfire Night Social