Mathematizing C++ concurrency

ACM SIGPLAN Notices

Volumn 46, Issue 1, 2011, Pages 55-66

  Batty, Mark ^a   Owens, Scott ^a   Sarkar, Susmit ^a   Sewell, Peter ^a   Weber, Tjark ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Relaxed Memory Models; Semantics

Indexed keywords

ATOMIC PRIMITIVES; DRAFT STANDARD; ISABELLE/HOL; RELAXED MEMORY MODELS; SHARED MEMORIES;

COMPUTER PROGRAMMING; SEMANTICS; STANDARDS;

COMPUTER SOFTWARE;

EID: 79251564123     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1925844.1926394     Document Type: Conference Paper

References (33)

1. [AB10] S. V. Adve and H.-J. Boehm. Memory models: A case for rethinking parallel languages and hardware. C. ACM, 2010.
2. [AMSS10] J. Alglave, L. Maranget, S. Sarkar, and P. Sewell. Fences in weak memory models. In Proc. CAV, 2010.
3. [ARM08] ARM. ARM Architecture Reference Manual (ARMv7-A and ARMv7-R edition). April 2008.
4. [BA08] H.-J. Boehm and S.V. Adve. Foundations of the C++ concurrency memory model. In Proc. PLDI, 2008.
5. [Bec10] P. Becker, editor. Programming Languages - C++. Final Committee Draft. 2010. ISO/IEC JTC1 SC22 WG21 N3092.
6. [BN10] Jasmin Christian Blanchette and Tobias Nipkow. Nitpick: A counterexample generator for higher-order logic based on a relational model finder. In Proc. ITP, 2010.
7. [BOS] www.cl.cam.ac.uk/users/pes20/cpp.
8. [C1X] JTC1/SC22/WG14 - C. http://www.open-std.org/ jtc1/sc22/wg14/.
9. [CKS07] P. Cenciarelli, A. Knapp, and E. Sibilio. The Java memory model: Operationally, denotationally, axiomatically. In Proc. ESOP, 2007.
10. [GN00] E. R. Gansner and S. C. North. An open graph visualization system and its applications to software engineering. Softw. Pract. Exper., 30(11):1203-1233, 2000.
11. [Haf09] Florian Haftmann. Code Generation from Specifications in Higher-Order Logic. PhD thesis, TU München, 2009.
12. [HOL] The HOL 4 system. http://hol.sourceforge.net/.
13. [Int02] Intel. A formal specification of Intel Itanium processor family memory ordering. http://www.intel.com/design/ itanium/downloads/251429.htm, October 2002.
14. [Isa] Isabelle 2009-2. http://isabelle.in.tum.de/.
15. [Lam79] L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput., C-28(9):690-691, 1979.
16. [MPA05] J. Manson,W. Pugh, and S.V. Adve. The Java memory model. In Proc. POPL, 2005.
17. [MS10] P. E. McKenney and R. Silvera. Example POWER implementation for C/C++ memory model. http: //www.rdrop.com/users/paulmck/scalability/ paper/N2745r.2010.02.19a.html, 2010.
18. [MW] P. E. McKenney and J. Walpole. What is RCU, fundamentally? Linux Weekly News, http://lwn.net/Articles/ 262464/.
19. [NMRW02] George C. Necula, Scott McPeak, Shree Prakash Rahul, and Westley Weimer. Cil: Intermediate language and tools for analysis and transformation of c programs. In Proc. CC, 2002.
20. [Nor08] M. Norrish. A formal semantics for C++. Technical report NICTA 2008.
21. [OSS09] S. Owens, S. Sarkar, and P. Sewell. A better x86 memory model: x86-TSO. In Proc. TPHOLs, 2009.
22. [Owe10] S. Owens. Reasoning about the implementation of concurrency abstractions on x86-TSO. In Proc. ECOOP, 2010.
23. [Pow09] Power ISA Version 2.06. IBM, 2009.
24. [Pug00] W. Pugh. The Java memory model is fatally flawed. Concurrency - Practice and Experience, 12(6), 2000.
25. [SA08] J. Ševčík and D. Aspinall. On validity of program transformations in the Java memory model. In ECOOP, 2008.
26. [Spa] The SPARC architecture manual, v. 9. http://dev elopers.sun.com/solaris/articles/sparcv9.pdf.
27. [SSO+10] P. Sewell, S. Sarkar, S. Owens, F. Zappa Nardelli, and M. O. Myreen. x86-TSO: A rigorous and usable programmer's model for x86 multiprocessors. C. ACM, 53(7):89-97, 2010.
28. [SSZN+09] S. Sarkar, P. Sewell, F. Zappa Nardelli, S. Owens, T. Ridge, T. Braibant, M. Myreen, and J. Alglave. The semantics of x86-CC multiprocessor machine code. In Proc. POPL, 2009.
29. [Ter08] A. Terekhov. Brief tentative example x86 implementation for C/C++ memory model. cpp-threads mailing list, http://www.decadent.org.uk/pipermail/ cpp-threads/2008-December/001933.html, Dec. 2008.
30. [TJ07] E. Torlak and D. Jackson. Kodkod: a relational model finder. In Proc. TACAS, 2007.
31. [TVD10] E. Torlak, M. Vaziri, and J. Dolby. MemSAT: checking axiomatic specifications of memory models. In PLDI, 2010.
32. [YGLS04] Y. Yang, G. Gopalakrishnan, G. Lindstrom, and K. Slind. Nemos: A framework for axiomatic and executable specifications of memory consistency models. In IPDPS, 2004.
33. [Zal08] M. Zalewski. Generic Programming with Concepts. PhD thesis, Chalmers University, November 2008.