On the public citation graph

Making weak memory models fair

https://doi.org/10.1145/3485475
0 signed · 67 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-10007-5_47openalex-snapshot
On the semantics of fair parallelism
inferredcites →https://doi.org/10.1007/3-540-10843-2_22openalex-snapshot
Impartiality, justice and fairness: The ethics of concurrent termination
inferredcites →https://doi.org/10.1007/978-1-4612-4886-6openalex-snapshot
Fairness
inferredcites →https://doi.org/10.1007/978-3-030-03592-1_19openalex-snapshot
Store Buffer Reduction in the Presence of Mixed-Size Accesses and Misalignment
inferredcites →https://doi.org/10.1007/978-3-030-81685-8_20openalex-snapshot
GenMC: A Model Checker for Weak Memory Models
inferredcites →https://doi.org/10.1007/978-3-030-91014-3_17openalex-snapshot
Verifying and Optimizing the HMCS Lock for Arm Servers
inferredcites →https://doi.org/10.1007/978-3-319-96142-2_21openalex-snapshot
Reasoning About TSO Programs Using Reduction and Abstraction
inferredcites →https://doi.org/10.1007/978-3-642-03359-9_27openalex-snapshot
A Better x86 Memory Model: x86-TSO
inferredcites →https://doi.org/10.1007/978-3-642-22012-8_34openalex-snapshot
Deciding Robustness against Total Store Ordering
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_29openalex-snapshot
Checking and Enforcing Robustness against TSO
inferredcites →https://doi.org/10.1007/978-3-662-43951-7_14openalex-snapshot
Robustness against Power is PSpace-complete
inferredcites →https://doi.org/10.1109/tc.1979.1675439openalex-snapshot
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
inferredcites →https://doi.org/10.1109/tse.1977.229904openalex-snapshot
Proving the Correctness of Multiprocess Programs
inferredcites →https://doi.org/10.1145/103727.103729openalex-snapshot
Algorithms for scalable synchronization on shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/1040305.1040336openalex-snapshot
The Java memory model
inferredcites →https://doi.org/10.1145/1785414.1785443openalex-snapshot
x86-TSO
inferredcites →https://doi.org/10.1145/1925844.1926394openalex-snapshot
Mathematizing C++ concurrency
inferredcites →https://doi.org/10.1145/1926385.1926394openalex-snapshot
Mathematizing C++ concurrency
inferredcites →https://doi.org/10.1145/2103621.2103717openalex-snapshot
Clarifying and compiling C/C++ concurrency
inferredcites →https://doi.org/10.1145/2103656.2103717openalex-snapshot
Clarifying and compiling C/C++ concurrency
inferredcites →https://doi.org/10.1145/2535838.2535877openalex-snapshot
Verifying eventual consistency of optimistic replication systems
inferredcites →https://doi.org/10.1145/2627752openalex-snapshot
Herding Cats
inferredcites →https://doi.org/10.1145/2676726.2676995openalex-snapshot
Common Compiler Optimisations are Invalid in the C11 Memory Model and what we can do about it
inferredcites →https://doi.org/10.1145/2688500.2688503openalex-snapshot
High performance locks for multi-level NUMA systems
inferredcites →https://doi.org/10.1145/2837614.2837615openalex-snapshot
Modelling the ARMv8 architecture, operationally: concurrency and ISA
inferredcites →https://doi.org/10.1145/2837614.2837643openalex-snapshot
Taming release-acquire consistency
inferredcites →https://doi.org/10.1145/3009837.3009850openalex-snapshot
A promising semantics for relaxed-memory concurrency
inferredcites →https://doi.org/10.1145/3062341.3062352openalex-snapshot
Repairing sequential consistency in C/C++11
inferredcites →https://doi.org/10.1145/3158105openalex-snapshot
Effective stateless model checking for C/C++ concurrency
inferredcites →https://doi.org/10.1145/3158107openalex-snapshot
Simplifying ARM concurrency: multicopy-atomic axiomatic and operational models for ARMv8
inferredcites →https://doi.org/10.1145/3173162.3177156openalex-snapshot
Frightening Small Children and Disconcerting Grown-ups
inferredcites →https://doi.org/10.1145/3192366.3192421openalex-snapshot
Bounding data races in space and time
inferredcites →https://doi.org/10.1145/3290382openalex-snapshot
Bridging the gap between programming languages and hardware weak memory models
inferredcites →https://doi.org/10.1145/3290383openalex-snapshot
Grounding thin-air reads with event structures
inferredcites →https://doi.org/10.1145/3314221.3314604openalex-snapshot
Robustness against release/acquire semantics
inferredcites →https://doi.org/10.1145/3314221.3314609openalex-snapshot
Model checking for weakly consistent libraries
inferredcites →https://doi.org/10.1145/3360559openalex-snapshot
Weakening WebAssembly
inferredcites →https://doi.org/10.1145/3360568openalex-snapshot
A formalization of Java’s concurrent access modes
inferredcites →https://doi.org/10.1145/3385412.3385973openalex-snapshot
Repairing and mechanising the JavaScript relaxed memory model
inferredcites →https://doi.org/10.1145/3428262openalex-snapshot
Pomsets with preconditions: a simple model of relaxed memory
inferredcites →https://doi.org/10.1145/3434285openalex-snapshot
Verifying observational robustness against a c11-style memory model
inferredcites →https://doi.org/10.1145/3445814.3446748openalex-snapshot
VSync: push-button verification and optimization for synchronization primitives on weak memory models
inferredcites →https://doi.org/10.1145/3485475openalex-snapshot
Making weak memory models fair
inferredcites →https://doi.org/10.4230/lipics.concur.2015.58openalex-snapshot
A Framework for Transactional Consistency Models with Atomic Visibility
inferredcites →https://doi.org/10.4230/lipics.disc.2017.23openalex-snapshot
Consistency Models with Global Operation Sequencing and their Composition
inferredcites →https://doi.org/10.4230/lipics.ecoop.2017.17openalex-snapshot
Strong Logic for Weak Memory: Reasoning About Release-Acquire Consistency in Iris
inferredcites →https://doi.org/10.5281/zenodo.5496482openalex-snapshot
Making Weak Memory Models Fair: OOPSLA 2021 artifact

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-99336-8_12openalex-snapshot
Probabilistic Total Store Ordering
inferred← citeshttps://doi.org/10.1007/978-3-031-37706-8_10openalex-snapshot
Overcoming Memory Weakness with Unified Fairness
inferred← citeshttps://doi.org/10.1007/978-3-031-37706-8_12openalex-snapshot
Unblocking Dynamic Partial Order Reduction
inferred← citeshttps://doi.org/10.1007/978-3-031-66676-6_5openalex-snapshot
A Rely-Guarantee Framework for Proving Deadlock Freedom Under Causal Consistency
inferred← citeshttps://doi.org/10.1007/978-3-031-98208-8_8openalex-snapshot
Portability of Optimizations from SC to TSO
inferred← citeshttps://doi.org/10.1007/978-3-032-26204-2_6openalex-snapshot
Towards Proving Liveness on Weak Memory
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104892openalex-snapshot
Fairness and communication-based semantics for session-typed languages
inferred← citeshttps://doi.org/10.1134/s0361768821060050openalex-snapshot
A Survey of Programming Language Memory Models
inferred← citeshttps://doi.org/10.1145/3485508openalex-snapshot
Specifying and testing GPU workgroup progress models
inferred← citeshttps://doi.org/10.1145/3519939.3523718openalex-snapshot
Sequential reasoning for optimizing compilers under weak memory concurrency
inferred← citeshttps://doi.org/10.1145/3563352openalex-snapshot
Implementing and verifying release-acquire transactional memory in C11
inferred← citeshttps://doi.org/10.1145/3591253openalex-snapshot
Fair Operational Semantics
inferred← citeshttps://doi.org/10.1145/3622855openalex-snapshot
Static Analysis of Memory Models for SMT Encodings
inferred← citeshttps://doi.org/10.1145/3704908openalex-snapshot
Relaxed Memory Concurrency Re-executed
inferred← citeshttps://doi.org/10.1145/3715096openalex-snapshot
A Brookes-Style Denotational Semantics for Release/Acquire Concurrency
inferred← citeshttps://doi.org/10.1145/3776680openalex-snapshot
Parametrised Verification of Intel-x86 Programs
inferred← citeshttps://doi.org/10.1145/3776687openalex-snapshot
Recurrence Sets for Proving Fair Non-termination under Axiomatic Memory Consistency Models
inferred← citeshttps://doi.org/10.17586/2226-1494-2022-22-3-517-527openalex-snapshot
Mechanization of pomset languages in the Coq proof assistant for the specification of weak memory models
inferred← citeshttps://doi.org/10.20944/preprints202305.0049.v1openalex-snapshot
Analysis of Concurrent Systems Based on Interval Order
showing the first 19 of 20 · page through all 20
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.