invited-talk

Formal Reasoning about the C11 Weak Memory Model

Author:

Viktor VafeiadisAuthors Info & Claims

CPP '15: Proceedings of the 2015 Conference on Certified Programs and Proofs

Pages 1 - 2

https://doi.org/10.1145/2676724.2693181

Published: 13 January 2015 Publication History

Get Access

Abstract

This abstract introduces the C11 weak memory model, summarises known verification results, and discusses some open problems.

References

[1]

M. Batty, S. Owens, S. Sarkar, P. Sewell, and T. Weber. Mathematizing C++ concurrency. In POPL, pages 55--66, 2011.

Digital Library

Google Scholar

[2]

M. Batty, K. Memarian, S. Owens, S. Sarkar, and P. Sewell. Clarifying and compiling C/C++ concurrency: From C++ 11 to POWER. In POPL, pages 509--520, 2012.

Digital Library

Google Scholar

[3]

H.-J. Boehm and S. V. Adve. Foundations of the C++concurrency memory model. In PLDI, pages 68--78, 2008.

Digital Library

Google Scholar

[4]

A. Bouajjani, R. Meyer, and E. Möhlmann. Deciding robustness against total store ordering. In ICALP (2), pages 428--440, 2011.

Digital Library

Google Scholar

[5]

M. Desnoyers, P. E. McKenney, A. S. Stern, M. R. Dagenais, and J. Walpole. User-level implementations of read-copy update. IEEE Trans. Parallel Distrib. Syst., 23 (2): 375--382, 2012.

Digital Library

Google Scholar

[6]

ISO/IEC 14882:2011. Programming language C++ 2011.

Google Scholar

[7]

R. Morisset, P. Pawan, and F. Zappa Nardelli. Compiler testing via a theory of sound optimisations in the C11/C++ 11 memory model. In PLDI, pages 187--196, 2013.

Digital Library

Google Scholar

[8]

P. W. O'Hearn. Resources, concurrency, and local reasoning. Theor. Comput. Sci., 375 (1--3): 271--307, 2007.

Digital Library

Google Scholar

[9]

S. Owens, S. Sarkar, and P. Sewell. A better x86 memory model: x86-TSO. In TPHOLs, pages 391--407, 2009.

Digital Library

Google Scholar

[10]

S. Sarkar, K. Memarian, S. Owens, M. Batty, P. Sewell, L. Maranget, J. Alglave, and D. Williams. Synchronising C/C++ and POWER. In PLDI, pages 311--322, 2012.

Digital Library

Google Scholar

[11]

J. Sevcik. Safe optimisations for shared-memory concurrent programs. In PLDI, pages 306--316, 2011.

Digital Library

Google Scholar

[12]

J. Sevcik, V. Vafeiadis, F. Zappa Nardelli, S. Jagannathan, and P. Sewell. CompCertTSO: A verified compiler for relaxed-memory concurrency. J. ACM, 60 (3): 22, 2013.

Digital Library

Google Scholar

[13]

A. Turon, V. Vafeiadis, and D. Dreyer. GPS: Navigating weak memory with ghosts, protocols, and separation. In OOPSLA, pages 691--707, 2014.

Digital Library

Google Scholar

[14]

V. Vafeiadis and C. Narayan. Relaxed separation logic: A program logic for C11 concurrency. In OOPSLA, pages 867--884, 2013.

Digital Library

Google Scholar

[15]

V. Vafeiadis, T. Balabonski, S. Chakraborty, R. Morisset, and F. Zappa Nardelli. Common compiler optimisations are invalid in the C11 memory model and what we can do about it. In POPL, 2015.

Digital Library

Google Scholar

Cited By

View all

Joosten SHuisman M(2018)Static Code Verification Through Process ModelsLeveraging Applications of Formal Methods, Verification and Validation. Distributed Systems10.1007/978-3-030-03424-5_23(343-354)Online publication date: 5-Nov-2018
https://dl.acm.org/doi/10.1007/978-3-030-03424-5_23
Abe TMaeda T(2016)Observation-Based Concurrent Program Logic for Relaxed Memory Consistency ModelsProgramming Languages and Systems10.1007/978-3-319-47958-3_4(63-84)Online publication date: 9-Oct-2016
https://doi.org/10.1007/978-3-319-47958-3_4

Index Terms

Formal Reasoning about the C11 Weak Memory Model
1. Software and its engineering
  1. Software notations and tools
    1. Formal language definitions
2. Theory of computation

Recommendations

Overhauling SC atomics in C11 and OpenCL
POPL '16: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Despite the conceptual simplicity of sequential consistency (SC), the semantics of SC atomic operations and fences in the C11 and OpenCL memory models is subtle, leading to convoluted prose descriptions that translate to complex axiomatic ...
Verifying read-copy-update in a logic for weak memory
PLDI '15

Read-Copy-Update (RCU) is a technique for letting multiple readers safely access a data structure while a writer concurrently modifies it. It is used heavily in the Linux kernel in situations where fast reads are important and writes are infrequent. ...
Verifying read-copy-update in a logic for weak memory
PLDI '15: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation

Read-Copy-Update (RCU) is a technique for letting multiple readers safely access a data structure while a writer concurrently modifies it. It is used heavily in the Linux kernel in situations where fast reads are important and writes are infrequent. ...

Comments

Information & Contributors

Information

Published In

CPP '15: Proceedings of the 2015 Conference on Certified Programs and Proofs

January 2015

192 pages

ISBN:9781450332965

DOI:10.1145/2676724

Program Chairs:
Xavier Leroy
Inria Paris-Rocquencourt, France
,
Alwen Tiu
Nanyang Technological University, Singapore

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

In-Cooperation

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 January 2015

Check for updates

Author Tags

Qualifiers

Invited-talk

Funding Sources

Seventh Framework Programme

Conference

POPL '15

Sponsor:

SIGPLAN

POPL '15: The 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

January 13 - 14, 2015

Mumbai, India

Acceptance Rates

CPP '15 Paper Acceptance Rate 18 of 26 submissions, 69%;

Overall Acceptance Rate 18 of 26 submissions, 69%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
239
Total Downloads

Downloads (Last 12 months)9
Downloads (Last 6 weeks)2

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Joosten SHuisman M(2018)Static Code Verification Through Process ModelsLeveraging Applications of Formal Methods, Verification and Validation. Distributed Systems10.1007/978-3-030-03424-5_23(343-354)Online publication date: 5-Nov-2018
https://dl.acm.org/doi/10.1007/978-3-030-03424-5_23
Abe TMaeda T(2016)Observation-Based Concurrent Program Logic for Relaxed Memory Consistency ModelsProgramming Languages and Systems10.1007/978-3-319-47958-3_4(63-84)Online publication date: 9-Oct-2016
https://doi.org/10.1007/978-3-319-47958-3_4

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Cited By

Index Terms

Recommendations

Overhauling SC atomics in C11 and OpenCL

Verifying read-copy-update in a logic for weak memory

Verifying read-copy-update in a logic for weak memory