S. V. Adve and K. Gharachorloo, Shared memory consistency models: a tutorial, Computer, vol.29, issue.12, pp.66-76, 1995.
DOI : 10.1109/2.546611

S. V. Adve and M. D. Hill, Weak Ordering -A New Definition, 1990.

S. V. Adve and H. Boehm, Memory Models: A Case for Rethinking Parallel Languages and Hardware

J. Alglave, L. Maranget, S. Sarkar, and P. Sewell, Fences in Weak Memory Models, 2010.
DOI : 10.1007/978-3-642-14295-6_25

URL : https://hal.archives-ouvertes.fr/hal-01100859

J. Alglave, L. Maranget, S. Sarkar, and P. Sewell, Litmus: Running Tests against Hardware, TACAS, 2011.
DOI : 10.1145/1785414.1785443

URL : https://hal.archives-ouvertes.fr/hal-01100851

H. Boehm, Reordering constraints for pthread-style locks, Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming , PPoPP '07, 2007.
DOI : 10.1145/1229428.1229470

H. Boehm, Threads Cannot Be Implemented As a Library, PLDI, 2005.

H. Boehm and S. V. Adve, Foundations of the C++ Concurrency Memory Model, PLDI, 2008.

S. Burckhardt, R. Alur, and M. K. Martin, Checkfence: Checking consistency of concurrent data types on relaxed memory models, PLDI, 2007.

S. Burckhardt and M. Musuvathi, Effective Program Verification for Relaxed Memory Models, CAV, 2008.
DOI : 10.1007/978-3-540-70545-1_12

J. Cantin, M. Lipasti, and J. Smith, The complexity of verifying memory coherence, Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '03, 2003.
DOI : 10.1145/777412.777457

X. Fang, J. Lee, and S. Midkiff, Automatic fence insertion for shared memory multiprocessing, Proceedings of the 17th annual international conference on Supercomputing , ICS '03, 2003.
DOI : 10.1145/782814.782854

T. Huynh and A. Roychoudhury, A Memory Model Sensitive Checker for C#, 2006.
DOI : 10.1007/11813040_32

M. Kuperstein, M. Vechev, and E. Yahav, Automatic inference of memory fences, ACM SIGACT News, vol.43, issue.2, 2010.
DOI : 10.1145/2261417.2261438

L. Lamport, How to make a correct multiprocess program execute correctly on a multiprocessor, IEEE Transactions on Computers, vol.46, issue.7, pp.779-782, 1979.
DOI : 10.1109/12.599898

D. Lea, The JSR-133 Cookbook for Compiler Writers, 2006.

J. Lee and D. A. Padua, Hiding relaxed memory consistency with a compiler, IEEE Transactions on Computers, vol.50, issue.8, pp.824-833, 2001.
DOI : 10.1109/12.947002

J. Manson, W. Pugh, and S. V. Adve, The Java Memory Model, POPL, 2005.

P. Mckenney and R. Silvera, Example Power Implementation for C/C++ Memory Model, 2008.

S. Owens, Reasoning about the Implementation of Concurrency Abstractions on x86-TSO, 2010.
DOI : 10.1007/978-3-642-14107-2_23

S. Park and D. Dill, An executable specification, analyzer and verifier for RMO, SPAA 95

M. Rinard, Analysis of Multithreaded Programs, SAS, 2001.
DOI : 10.1007/3-540-47764-0_1

J. Sevcik, Program Transformations in Weak Memory Models, 2008.

D. Shasha and M. Snir, Efficient and correct execution of parallel programs that share memory, TOPLAS, 1988.
DOI : 10.1145/42190.42277

Z. Sura, X. Fang, C. Wong, S. P. Midkiff, J. Lee et al., Compiler techniques for high performance SC Java programs, PPoPP'05, 2005.

Y. Yang, G. Gopalakrishnan, and G. Lindstrom, Memory-Model-Sensitive Data Race Analysis, 2004.
DOI : 10.1007/978-3-540-30482-1_11