Trace Semantics for C++11 Memory Model-Reference-Cited by-同舟云学术

Trace Semantics for C++11 Memory Model

Published:2024-09-05 Issue:3 Volume:36 Page:1-24
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Xiao Lili¹^ORCID,Zhu Huibiao²^ORCID,Chen Sini²^ORCID,He Mengda³^ORCID,Qin Shengchao⁴^ORCID

Affiliation:

1. School of Computer Science and Technology, Donghua University, Shanghai, China

2. Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China

3. Teesside University, Middlesbrough, United Kingdom

4. Xidian University, Xi'an, China

Abstract

The C and C++ languages introduced the relaxed-memory concurrency into the language specification for efficiency purposes in 2011. Trace semantics can provide the mathematical foundation for the proposed C++11 memory model, and there is a lack of investigation of trace semantics for C++11. The Promising Semantics (PS) of Kang et al. provides the standard SC-style operational semantics for the C++11 concurrency model, where “SC” refers to “Sequential Consistency”. Inspired by PS, in this article we first investigate the trace semantics for the relaxed read and write accesses under C++11, acting in the denotational semantics style. In our semantic model, a trace is in the form of a sequence of snapshots, and the snapshots record the modification in the relevant global or local variables, and the thread view. Moreover, the trace semantics for the release/acquire accesses under C++11 is also explored, based on the separated thread views and newly added message views. When considering this trace model, different accesses bring in their unique snapshots, and make distinguished effects on the production of the sequences. For any given program, the proposed trace semantics in this article produces all the valid traces directly. Furthermore, our trace semantics, together with that for TSO and MCA ARMv8, has the possibility to be the foundation of the meta model of the trace semantics for weak memory models.

Funder

National Natural Science Foundation of China

“Digital Silk Road” Shanghai International Joint Lab of Trustworthy Intelligent Software

Shanghai Trusted Industry Internet Software Collaborative Innovation Center

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/3670696

Reference32 articles.

1. Mark Batty, Scott Owens, Susmit Sarkar, Peter Sewell, and Tjark Weber. 2011. Mathematizing C++ concurrency. In Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, January 26–28, 2011.Thomas Ball and Mooly Sagiv (Eds.), ACM, 55–66.

2. Mark John Batty. 2015. The C11 and C++11 Concurrency Model. Ph.D. Dissertation. University of Cambridge, UK.

3. Full Abstraction for a Shared-Variable Parallel Language

4. The Safety-Critical Java memory model formalised

5. Sadegh Dalvandi, Simon Doherty, Brijesh Dongol, and Heike Wehrheim. 2020. Owicki-gries reasoning for C11 RAR. In Proceedings of the 34th European Conference on Object-Oriented Programming, ECOOP 2020, November 15–17, 2020, Berlin, Germany (Virtual Conference).Robert Hirschfeld and Tobias Pape (Eds.), Vol. 166, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 11:1–11:26.