Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,797,725 papers from all fields of science
Search
Sign In
Create Free Account
Memory semantics (computing)
Known as:
Memory semantics
In computing and parallel processing, memory semantics refers to the process logic used to control access to shared memory locations, or at a higher…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Consistency model
Lock (computer science)
Parallel computing
Transactional memory
Broader (1)
Transaction processing
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
A promising semantics for relaxed-memory concurrency
Jeehoon Kang
,
C. Hur
,
O. Lahav
,
Viktor Vafeiadis
,
Derek Dreyer
ACM-SIGACT Symposium on Principles of Programming…
2017
Corpus ID: 3037670
Despite many years of research, it has proven very difficult to develop a memory model for concurrent programming languages that…
Expand
Highly Cited
2017
Highly Cited
2017
Strong Logic for Weak Memory: Reasoning About Release-Acquire Consistency in Iris (Artifact)
Jan-Oliver Kaiser
,
Hoang-Hai Dang
,
Derek Dreyer
,
O. Lahav
,
Viktor Vafeiadis
Dagstuhl Artifacts Ser.
2017
Corpus ID: 1357870
This artifact provides the soundness proofs for the encodings in Iris the RSL and GPS logics, as well as the verification for all…
Expand
2015
2015
Relaxing safely: verified on-the-fly garbage collection for x86-TSO
Peter Gammie
,
Antony Hosking
,
Kai Engelhardt
ACM-SIGPLAN Symposium on Programming Language…
2015
Corpus ID: 14826435
We report on a machine-checked verification of safety for a state-of-the-art, on-the-fly, concurrent, mark-sweep garbage…
Expand
Highly Cited
2011
Highly Cited
2011
Relaxed-memory concurrency and verified compilation
J. Sevcík
,
Viktor Vafeiadis
,
Francesco Zappa Nardelli
,
S. Jagannathan
,
Peter Sewell
ACM-SIGACT Symposium on Principles of Programming…
2011
Corpus ID: 281109
In this paper, we consider the semantic design and verified compilation of a C-like programming language for concurrent shared…
Expand
Highly Cited
2006
Highly Cited
2006
Field-sensitive value analysis of embedded C programs with union types and pointer arithmetics
A. Miné
ACM SIGPLAN Conference on Languages, Compilers…
2006
Corpus ID: 2887656
We propose a memory abstraction able to lift existing numerical static analyses to C programs containing union types, pointer…
Expand
2001
2001
Simulation Fidelity Metrics for Virtual Environments Based on Memory Semantics Speaker
A. Chalmers
,
T. Troscianko
2001
Corpus ID: 16838596
1998
1998
Sirocco: cost-effective fine-grain distributed shared memory
I. Schoinas
,
B. Falsafi
,
M. Hill
,
J. Larus
,
D. Wood
Proceedings. International Conference on…
1998
Corpus ID: 12892425
Software fine-grain distributed shared memory (FGDSM) provides a simplified shared-memory programming interface with minimal or…
Expand
Highly Cited
1998
Highly Cited
1998
Retrospective: weak ordering—a new definition
S. Adve
,
M. Hill
International Symposium on Computer Architecture
1998
Corpus ID: 41513086
Review
1995
Review
1995
Reflective-memory multiprocessor
Stephen Lucci
,
I. Gertner
,
Anil Gupta
,
Uday Hegde
Proceedings of the Twenty-Eighth Annual Hawaii…
1995
Corpus ID: 2961520
Reflective memory may be thought of as hardware-supported replication of data on multiple computers. This simple mechanism has…
Expand
Highly Cited
1994
Highly Cited
1994
Application-specific protocols for user-level shared memory
B. Falsafi
,
A. Lebeck
,
+5 authors
D. Wood
Proceedings of Supercomputing '94
1994
Corpus ID: 12937575
Recent distributed shared memory (DSM) systems and proposed shared-memory machines have implemented some or all of their cache…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE