M. [. Adve and . Hill, Weak ordering ? a new definition, Proc. ISCA, 1990.

J. Alglave and L. Maranget, Stability in Weak Memory Models, Proc. CAV, 2011.
DOI : 10.1007/978-3-540-30482-1_11
URL : https://hal.archives-ouvertes.fr/hal-01100806

J. Alglave, L. Maranget, S. Sarkar, and P. Sewell, Fences in Weak Memory Models, Proc. CAV, 2010.
DOI : 10.1007/978-3-642-14295-6_25
URL : https://hal.archives-ouvertes.fr/hal-01100859

H. Boehm and S. V. Adve, Foundations of the C++ concurrency memory model, Proc. PLDI, 2008.

. Bmo-+-12-]-m, K. Batty, S. Memarian, S. Owens, P. Sarkar et al., Clarifying and compiling C/C++ concurrency: from C++11 to POWER, Proc. POPL, 2012.

]. Boe05 and . Boehm, Threads cannot be implemented as a library, Proc. PLDI, 2005.

. Bos-+-11-]-m, S. Batty, S. Owens, P. Sarkar, T. Sewell et al., Mathematizing C++ concurrency, Proc. POPL, 2011.

F. Corella, J. M. Stone, and C. M. Barton, A formal specification of the PowerPC shared memory architecture, 1993.

M. Herlihy, A methodology for implementing highly concurrent data objects, ACM Transactions on Programming Languages and Systems, vol.15, issue.5, pp.745-770, 1993.
DOI : 10.1145/161468.161469

E. H. Jensen, G. W. Hagensen, and J. M. Broughton, A new approach to exclusive data access in shared memory multiprocessors, 1987.

L. Lamport, How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs, IEEE Transactions on Computers, vol.28, issue.9, pp.690-691, 1979.
DOI : 10.1109/TC.1979.1675439

P. E. Mckenney, [patch rfc tip/core/rcu 0/28] preview of rcu changes for 3, p.363, 2011.

M. M. Michael, Hazard pointers: safe memory reclamation for lock-free objects, MS11] P. E. McKenney and R. Silvera. Example POWER implementation for C/C++ memory model, pp.491-504, 2004.
DOI : 10.1109/TPDS.2004.8

S. Owens, P. Böhm, F. Z. Nardelli, and P. Sewell, Lem: A lightweight tool for heavyweight semantics Rough Diamond " section, N2745r.2011.03.04a.html Proc. ITP, LNCS 6898, 2011.

M. Parkinson, R. Bornat, and P. O. Hearn, Modular verification of a non-blocking stack Safe optimisations for shared-memory concurrent programs, Proc. POPL Proc. PLDI, 2007.

D. Shasha and M. Snir, Efficient and correct execution of parallel programs that share memory, ACM Transactions on Programming Languages and Systems, vol.10, issue.2, pp.282-312, 1988.
DOI : 10.1145/42190.42277

]. S. Ssa-+-11, P. Sarkar, J. Sewell, L. Alglave, D. Maranget et al., Understanding POWER multiprocessors, PLDI, 2011.