Verifying local transformations on relaxed memory models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6011 LNCS, Issue , 2010, Pages 104-123

  Burckhardt, Sebastian ^a   Musuvathi, Madanlal ^a   Singh, Vasu ^b  

^a MICROSOFT RESEARCH   (United States)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPILER TRANSFORMATIONS; CONCURRENT THREADS; DENOTATIONAL SEMANTICS; LOCAL TRANSFORMATIONS; MEMORY MODELS; PROGRAM FRAGMENTS; PROGRAM TRANSFORMATIONS; SEMI-AUTOMATED; SEQUENTIAL PROGRAMS; SHARED-MEMORY PROGRAMS; SPECIFIC HARDWARE; STRUCTURAL INDUCTION;

AUTOMATA THEORY; COMPUTER SOFTWARE; PROGRAM COMPILERS; SEMANTICS; SYSTEMS ANALYSIS;

PROGRAM TRANSLATORS;

EID: 77951568206     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11970-5_7     Document Type: Conference Paper

References (29)

1. Adve, S., Gharachorloo, K.: Shared memory consistency models: a tutorial. Computer 29(12), 66-76 (1996)
2. Adve, S., Hill, M.: A unified formalization of four shared-memory models. IEEE Trans. Parallel Distrib. Syst. 4(6), 613-624 (1993)
3. Arvind, Maessen, J.-W.: Memory model = instruction reordering + store atomicity. In: ISCA, pp. 29-40 (2006)
4. Boehm, H.-J., Adve, S.V.: Foundations of the C++ concurrency memory model. In: Programming Language Design and Implementation (PLDI), pp. 68-78 (2008)
5. Boudol, G., Petri, G.: Relaxed memory models: an operational approach. In: Principles of Programming Languages, POPL (2009)
6. Brookes, S.: Full abstraction for a shared variable parallel language. In: LICS, pp. 98-109 (1993)
7. Brumme, C.: cbrumme's weblog, http://blogs.gotdotnet.com/cbrumme/archive/ 2003/05/17/51445.aspx
8. Burckhardt, S., Musuvathi, M., Singh, V.: Verification of compiler transformations for concurrent programs. Technical Report MSR-TR-2008-2171, Microsoft Research (2008)
9. Cenciarelli, P., Sibilio, E.: The java memory model: Operationally, denotationally, axiomatically. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.4421, pp. 331-346. Springer, Heidelberg (2007)
10. Compaq Computer Corporation. Alpha Architecture Reference Manual, 4th edn. (January 2002)
11. de Moura, L.M., Bjørner, N.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.4963, pp. 337-340. Springer, Heidelberg (2008)
12. Duffy, J.: Joe Duffy's Weblog, http://www.bluebytesoftware.com/blog/2007/ 11/10/CLR20MemoryModel.aspx
13. Sarkar, S., et al.: The semantics of x86-CC multiprocessor machine code. In: Principles of Programming Languages, POPL (2009)
14. Gharachorloo, K.: Memory Consistency Models for Shared-Memory Multiprocessors. PhD thesis, University of Utah (2005)
15. Intel Corporation. Intel 64 Architecture Memory Ordering White Paper (August 2007)
16. International Business Machines Corporation. z/Architecture Principles of Operation, 1st edn. (December 2000)
17. Klein, G., Nipkow, T.: A machine-checked model for a java-like language, virtual machine, and compiler. ACM Transactions on Programming Languages and Systems 28(4), 619-695 (2006)
18. Lerner, S., Millstein, T., Chambers, C.: Automatically proving the correctness of compiler optimizations. In: Programming Language Design and Implementation (PLDI), pp. 220-231 (2003)
19. Leroy, X.: Formal certification of a compiler back-end or: programming a compiler with a proof assistant. In: Principles of programming languages (POPL), pp. 42-54 (2006)
20. Manson, J., Pugh, W., Adve, S.: The Java memory model. In: Principles of Programming Languages (POPL), pp. 378-391 (2005)
21. Morrison, V.: Understand the impact of low-lock techniques in multithreaded apps. MSDN Magazine 20(10) (October 2005)
22. Owens, S., Sarkar, S., Sewell, P.: A better x86 memory model: x86-TSO (extended version). Technical Report UCAM-CL-TR-745, Univ. of Cambridge (2009)
23. Park, S., Dill, D.L.: An executable specification, analyzer and verifier for RMO (relaxed memory order). In: Symposium on Parallel Algorithms and Architectures (SPAA), pp. 34-41 (1995)
24. Saraswat, V., Jagadeesan, R., Michael, M., von Praun, C.: A theory of memory models. In: PPoPP 2007: Principles and practice of parallel programming, pp. 161-172 (2007)
25. Sevcik, J.: Program Transformations in Weak Memory Models. PhD thesis, University of Edinburgh (2008)
26. Sevcik, J., Aspinall, D.: On validity of program transformations in the Java memory model. In: Vitek, J. (ed.) ECOOP 2008. LNCS, vol.5142, pp. 27-51. Springer, Heidelberg (2008)
27. Shen, X., Arvind, Rudolph, L.: Commit-reconcile & fences (crf): A new memory model for architects and compiler writers. In: ISCA, pp. 150-161 (1999)
28. Weaver, D., Germond, T. (eds.): The SPARC Architecture Manual Version 9. PTR Prentice Hall, Englewood Cliffs (1994)
29. Young, W.D.: A mechanically verified code generator. Journal of Automated Reasoning 5(4), 493-518 (1989)