Relaxed memory models: an operational approach

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

Volumn , Issue , 2009, Pages 392-403

  Boudol, Gérard ^a   Petri, Gustavo ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

INTERLEAVING SEMANTICS; MEMORY MODELS; MEMORY OPERATIONS; NEW APPROACHES; OPERATIONAL SEMANTICS; ORDERING CONSTRAINTS; PROGRAMMING LANGUAGE; PROGRAMMING LANGUAGE SEMANTICS; WRITE OPERATIONS;

ADA (PROGRAMMING LANGUAGE); C (PROGRAMMING LANGUAGE); COMPUTER SOFTWARE; LINGUISTICS; QUERY LANGUAGES;

SEMANTICS;

EID: 67649837188     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1480881.1480930     Document Type: Conference Paper

References (34)

1. M. ABADI, A. BIRRELL, T. HARRIS, M. ISARD, Semantics of transactional memory and automatic mutual exclusion, POPL'08 (2008) 63-74.
2. S.V. ADVE, Designing Memory Consistency Models for Shared- Memory Multiprocessors, PhD Thesis, Univ. of Wisconsin (1993).
3. S.A. ADVE, K. GHARACHORLOO, Shared memory consistency models: a tutorial, IEEE Computer Vol. 29 No.12 (1996) 66-76. (Pubitemid 126517873)
4. S. ADVE, M.D. HILL,Weak ordering - A new definition, ISCA'90 (1990) 2-14.
5. D. ASPINALL J. ŠEVČ́IK Formalising Java's data race free guarantee, TPHOLs'07, Lecture Notes in Comput. Sci. 4732 (2007) 22-37.
6. D. ASPINALL, J. Š EVČ ́I K, Java memory model examples: good, bad and ugly, VAMP'07 (2007).
7. G. BERRY, J.-J. ĹEVY, Minimal and optimal computations of recursive programs, J. of ACM 26 (1979) 148-175.
8. H.-J. BOEHM, S.V. ADVE, Foundations of the C++ concurrency model, PLDI'08 (2008) 68-78.
9. C. BLUNDELL, E.C. LEWIS, M.M.K.MARTIN, Subtleties of transactional memory atomicity semantics, IEEE Comput. Architecture Letters Vol. 5 No.2 (2006). (Pubitemid 46190872)
10. G. BOUDOL, Atomic actions, INRIA Res. Rep. 1026 and EATCS Bull. 38 (1989) 136-144.
11. G. BOUDOL, I. CASTELLANI, A non-interleaving semantics for CCS based on proved transitions, Fundamenta Informaticae XI (1988) 433-452.
12. G. BOUDOL, I. CASTELLANI, Flow models of distributed computations: three equivalent semantics for CCS, Information and Computation Vol. 114 No.2 (1994) 247-314.
13. P. CENCIARELLI, A. KNAPP, B. REUS, M. WIRSING, An eventbased structural operational semantics of multi-threaded Java, in Formal Syntax and Semantics of JAVA, Lecture Notes in Comput. Sci. 1523 (1999) 157-200.
14. P. CENCIARELLI, A. KNAPP, E. SIBILIO,The Java memory model: operationally, denotationally, axiomatically, ESOP'07, Lecture Notes in Comput. Sci. 4421 (2007) 331-346. (Pubitemid 350259501)
15. M. DUBOIS, CH. SCHEURICH, F. BRIGGS,Memory access buffering in multiprocessors, ISCA'86 (1986) 434-442. (Pubitemid 16617121)
16. L. EFFINGER-DEAN, M. KEHRT, D. GROSSMAN, Transactional events for ML, ICFP'08 (2008) 103-114.
17. G.R. GAO, V. SARKAR, Location consistency - a new memory model and cache consistency protocol, IEEE Trans. on Computers Vol. 49 No.8 (2000) 798-813. (Pubitemid 30927304)
18. G.R. GAO, V. SARKAR, On the importance of an end-to-end view of memory consistency in future computer systems, ISHPC'97, Lecture Notes in Comput. Sci. 1336 (1997) 30-41. (Pubitemid 127147392)
19. K. GHARACHORLOO, D. LENOSKI, J. LAUDON, P. GIBBONS, A. GUPTA, J. HENNESSY,Memory consistency and event ordering in scalable shared-memory multiprocessors, ACM SIGARCH Computer Architecture News Vol. 18 No. 3a (1990) 15-26.
20. P.B. GIBBONS, M. MERRITT, K. GHARACHORLOO, Proving sequential consistency of high-performance shared memories, ACM Symp. on Parallel Algorithms and Architectures (1991) 292-303.
21. J.R. GOODMAN, Cache consistency and sequential consistency,Techn. Rep. TR1006, University of Wisconsin (1991).
22. J.R. GOODMAN, Cache consistency and sequential consistency, Techn. Rep. TR1006, University of Wisconsin (1991). [22] D. GROSSMAN, J. MANSON, W. PUGH, What do high-level memory models mean for transactions?, MSPC'06 (2006) 62-69. (Pubitemid 47177304)
23. A. HOBOR, A.W. APPEL, F. ZAPPA NARDELLI, Oracle semantics for concurrent separation logic, ESOP'08, Lecture Notes in Comput. Sci. 4960 (2008) 353-360.
24. INTEL CORP., Intel 64 architecture memory ordering white paper, (2007).
25. M. HUISMAN, G. PETRI, The Java memory model: a formal explanation, VAMP'07 (2007).
26. L. LAMPORT, Time, clocks, and the ordering of events in a distributed system, CACM Vol. 21 No.7 (1978) 558-565. (Pubitemid 8615486)
27. L. LAMPORT, How to make a multiprocessor computer that correctly executes multiprocess programs, IEEE Trans. on Computers Vol. 28 No.9 (1979) 690-691. (Pubitemid 10420526)
28. J. -J. ĹE VY, Optimal reductions in the lambda calculus, in To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (J.P. Seldin, J.R. Hindley, Eds), Academic Press (1980) 159-191.
29. J. MANSON, W. PUGH, S.A. ADVE, The Java memory model, POPL'05 (2005) 378-391. (Pubitemid 40493992)
30. K. F. MOORE, D. GROSSMAN, High-level small-step operational semantics for transactions, POPL'08 (2008) 51-62.
31. J.C. REYNOLDS, Toward a grainless semantics for shared-variable concurrency, FST-TCS'04, Lecture Notes in Comput. Sci. 3328 (2004) 35-48. (Pubitemid 39740211)
32. V. SARASWAT, R. JAGADEESAN, M. MICHAEL, C. von PRAUN, A theory of memory models, PPOPP'07 (2007) 161-172. (Pubitemid 47479104)
33. X. SHEN, ARVIND, L. RUDOLPH, Commit-reconcile & fences (CRF): a new memory model for architects and compiler writers, ISCA'99 (1999) 150-161.
34. R.C. STEINKE, G. J. NUTT, A unified theory of shared memory consistency, JACM Vol. 51 No. 5 (2004) 800-849. (Pubitemid 40119868)