publication . Conference object . Article . 2009

Relaxed memory models

Gérard Boudol; Gustavo Petri;
Restricted
  • Published: 21 Jan 2009
  • Publisher: ACM Press
Abstract
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to have in a given model. A minimal guarantee memory models should provide to the programmer is that well-synchronized, that is, data-race free code has a standard semantics. Traditionally, memory models are defined axiomatically, setting constraints on the order in which memory operations are allowed to occur, and the programming language semantics is implicit as determining some of these constraints. In this work we propose a new approach to formalizing a memory model in which the model its...
Read more
doi: 10.1145/1480881.1480930 , 10.1145/1594834.1480930
Subjects
arXiv: Computer Science::Programming Languages
free text keywords: Software, Computer Graphics and Computer-Aided Design, Type erasure, Denotational semantics, Memory model, Semantics (computer science), Well-founded semantics, Operational semantics, Stable model semantics, Programming language, computer.software_genre, computer, Computer science, Computational semantics
Related Organizations
Download fromView all 2 versions
ACM SIGPLAN Notices
Article . 2009
Provider: Crossref
https://dl.acm.org/citation.cf...
Conference object
Provider: Microsoft Academic Graph
http://dl.acm.org/ft_gateway.c...
Conference object . 2009
Provider: Crossref
ACM Press
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue