Clarifying and compiling C/C++ concurrency: From C++11 to Power

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2012, Pages 509-520

  Batty, Mark ^a   Memarian, Kayvan ^a,b   Owens, Scott ^a   Sarkar, Susmit ^a   Sewell, Peter ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b INRIA ^*  (United Kingdom)

Author keywords

Relaxed memory models; Semantics

Indexed keywords

EQUIVALENT MODEL; MACHINE ARCHITECTURES; OPTIMISATIONS; RELAXED MEMORY MODELS; SEQUENTIAL CONSISTENCY;

PROGRAM COMPILERS; SEMANTICS;

HIGH LEVEL LANGUAGES;

EID: 84857804113     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2103656.2103717     Document Type: Conference Paper

References (26)

1. Mustaque Ahamad, Rida A. Bazzi, Ranjit John, Prince Kohli, and Gil Neiger. The power of processor consistency. In Proc. SPAA, 1993.
2. S. V. Adve and M. D. Hill. Weak ordering-a new definition. In Proc. ISCA, 1990.
3. J. Alglave. A Shared Memory Poetics. PhD thesis, Université Paris 7 and INRIA, 2010.
4. J. Alglave and L. Maranget. Stability in weak memory models. In Proc. CAV, 2011.
5. J. Alglave, L. Maranget, S. Sarkar, and P. Sewell. Fences in weak memory models. In Proc. CAV, 2010.
6. H.-J. Boehm and S.V. Adve. Foundations of the C++ concurrency memory model. In Proc. PLDI, 2008.
7. P. Becker, editor. Programming Languages - C++. 2011. ISO/IEC 14882:2011. A non-final but recent version is available at http://www.open-std.org/jtc1/ sc22/wg21/ docs/papers/2011/n3242.pdf.
8. M. Batty, K. Memarian, S. Owens, S. Sarkar, and P. Sewell. http://www.cl.cam.ac.uk/users/pes20/cppppc.
9. S. Burckhardt, M. Musuvathi, and V. Singh. Verifying local transformations on relaxed memory models. In CC, 2010.
10. Hans Boehm. Atomic synchronization sequences, 2011. Mailing list communication, July 18th.
11. M. Batty, S. Owens, S. Sarkar, P. Sewell, and T.Weber. Mathematizing C++ concurrency: The post-Rapperswil model. Technical Report N3132, ISO IEC JTC1/SC22/WG21, August 2010. http://www.open-std.org/jtc1/sc22/wg21/docs/papers/ 2010/n3132.pdf.
12. M. Batty, S. Owens, S. Sarkar, P. Sewell, and T.Weber. Mathematizing C++ concurrency. In Proc. POPL, 2011.
13. J. C. Blanchette, T.Weber, M. Batty, S. Owens, and S. Sarkar. Nitpicking C++ concurrency. In Proc. PPDP, 2011.
14. X. Fang, J. Lee, and S. P. Midkiff. Automatic fence insertion for shared memory multiprocessing. In Proc. ICS, 2003.
15. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput., C-28(9):690-691, 1979. (Pubitemid 10420526)
16. D. Lea. The JSR-133 cookbook for compiler writers. http://gee.cs.oswego. edu/dl/jmm/cookbook.html.
17. X. Leroy. A formally verified compiler back-end. Journal of Automated Reasoning, 43(4):363-446, 2009.
18. A. Lochbihler. Verifying a compiler for Java threads. In Proc. ESOP'10, 2010.
19. P. E. McKenney and R. Silvera. Example POWER implementation for C/C++ memory model. http://www.rdrop.com/users/paulmck/scalability/paper/N2745r.2011. 03.04a.html, 2011.
20. S. Owens, P. Böhm, F. Zappa Nardelli, and P. Sewell. Lem: A lightweight tool for heavyweight semantics. In Proc. ITP, LNCS 6898, 2011. "Rough Diamond" section.
21. J. Ševčík. Safe optimisations for shared-memory concurrent programs. In Proc. PLDI, 2011.
22. D. Shasha and M. Snir. Efficient and correct execution of parallel programs that share memory. TOPLAS, 10:282-312, 1988. (Pubitemid 18638207)
23. S. Sarkar, P. Sewell, J. Alglave, L. Maranget, and D.Williams. Understanding POWER multiprocessors. In PLDI, 2011.
24. 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.
25. J. Ševčík, V. Vafeiadis, F. Zappa Nardelli, S. Jagannathan, and P. Sewell. Relaxed-memory concurrency and verified compilation. In Proc. POPL, 2011.
26. V. Vafeiadis and F. Zappa Nardelli. Verifying fence elimination optimisations. In Proc. SAS, 2011.