On the public citation graph
The leaky semicolon: compositional semantic dependencies for relaxed-memory concurrency
0 signed · 60 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1996.0056openalex-snapshot
Full Abstraction for a Shared-Variable Parallel Language
inferredcites →https://doi.org/10.1007/3-540-15648-8_22openalex-snapshot
Some constructions for order-theoretic models of concurrency
inferredcites →https://doi.org/10.1007/978-3-030-44914-8_22openalex-snapshot
Modular Relaxed Dependencies in Weak Memory Concurrency
inferredcites →https://doi.org/10.1007/978-3-030-54997-8_31openalex-snapshot
PrideMM: Second Order Model Checking for Memory Consistency Models
inferredcites →https://doi.org/10.1007/978-3-540-70592-5_3openalex-snapshot
On Validity of Program Transformations in the Java Memory Model
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-11957-6_17openalex-snapshot
Generative Operational Semantics for Relaxed Memory Models
inferredcites →https://doi.org/10.1007/978-3-662-46669-8_12openalex-snapshot
The Problem of Programming Language Concurrency Semantics
inferredcites →https://doi.org/10.1016/0304-3975(77)90044-5openalex-snapshot
LCF considered as a programming language
inferredcites →https://doi.org/10.1016/0304-3975(77)90053-6openalex-snapshot
Fully abstract models of typed λ-calculi
inferredcites →https://doi.org/10.1016/0304-3975(88)90124-7openalex-snapshot
The equational theory of pomsets
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.035openalex-snapshot
Resources, concurrency, and local reasoning
inferredcites →https://doi.org/10.1109/lics.1992.185532openalex-snapshot
References, local variables and operational reasoning
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.1145/1926385.1926394openalex-snapshot
Mathematizing C++ concurrency
inferredcites →https://doi.org/10.1145/232627.232649openalex-snapshot
A theory of weak bisimulation for core CML
inferredcites →https://doi.org/10.1145/2837614.2837616openalex-snapshot
A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions
inferredcites →https://doi.org/10.1145/2933575.2934536openalex-snapshot
On Thin Air Reads Towards an Event Structures Model of Relaxed Memory
inferredcites →https://doi.org/10.1145/3009837.3009850openalex-snapshot
A promising semantics for relaxed-memory concurrency
inferredcites →https://doi.org/10.1145/3062341.3062343openalex-snapshot
Taming undefined behavior in LLVM
inferredcites →https://doi.org/10.1145/3062341.3062352openalex-snapshot
Repairing sequential consistency in C/C++11
inferredcites →https://doi.org/10.1145/3192366.3192421openalex-snapshot
Bounding data races in space and time
inferredcites →https://doi.org/10.1145/3276495openalex-snapshot
Reconciling high-level optimizations and low-level code in LLVM
inferredcites →https://doi.org/10.1145/3290383openalex-snapshot
Grounding thin-air reads with event structures
inferredcites →https://doi.org/10.1145/3314221.3314611openalex-snapshot
Accelerating sequential consistency for Java with speculative compilation
inferredcites →https://doi.org/10.1145/3385412.3385973openalex-snapshot
Repairing and mechanising the JavaScript relaxed memory model
inferredcites →https://doi.org/10.1145/3385412.3386010openalex-snapshot
Promising 2.0: global optimizations in relaxed memory concurrency
inferredcites →https://doi.org/10.1145/3428262openalex-snapshot
Pomsets with preconditions: a simple model of relaxed memory
inferredcites →https://doi.org/10.1145/3453483.3454082openalex-snapshot
Modular data-race-freedom guarantees in the promising semantics
inferredcites →https://doi.org/10.1145/3462206openalex-snapshot
Safe-by-default Concurrency for Modern Programming Languages
inferredcites →https://doi.org/10.1145/360933.360975openalex-snapshot
Guarded commands, nondeterminacy and formal derivation of programs
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.4230/lipics.snapl.2015.177openalex-snapshot
The Silently Shifting Semicolon
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-031-17244-1_5openalex-snapshot
Separation of Concerning Things: A Simpler Basis for Defining and Programming with the C/C++ Memory Model
inferred← citeshttps://doi.org/10.1007/978-3-031-21037-2_1openalex-snapshot
An Algebraic Theory for Shared-State Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-031-27481-7_17openalex-snapshot
Reasoning About Promises in Weak Memory Models with Event Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-27481-7_18openalex-snapshot
A Fine-Grained Semantics for Arrays and Pointers Under Weak Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8_5openalex-snapshot
A Denotational Approach to Release/Acquire Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-031-78750-8_5openalex-snapshot
Formalisation of a New Weak Semantics for AuDaLa
inferred← citeshttps://doi.org/10.1007/978-3-031-98668-0_18openalex-snapshot
Structural Operational Semantics for Functional and Security Verification of Pipelined Processors
inferred← citeshttps://doi.org/10.1007/978-3-032-22749-2_13openalex-snapshot
jMT: Testing Correctness of Java Memory Models
inferred← citeshttps://doi.org/10.1145/3470496.3533045openalex-snapshot
Mixed-proxy extensions for the NVIDIA PTX memory consistency model
inferred← citeshttps://doi.org/10.1145/3563315openalex-snapshot
Model checking for a multi-execution memory model
inferred← citeshttps://doi.org/10.1145/3580285openalex-snapshot
Mechanised Operational Reasoning for C11 Programs with Relaxed Dependencies
inferred← citeshttps://doi.org/10.1145/3591297openalex-snapshot
Putting Weak Memory in Order via a Promising Intermediate Representation
inferred← citeshttps://doi.org/10.1145/3656399openalex-snapshot
Compositional Semantics for Shared-Variable Concurrency
inferred← citeshttps://doi.org/10.1145/3703595.3705890openalex-snapshot
Monadic Interpreters for Concurrent Memory Models
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/3721089openalex-snapshot
Symbolic MRD: Dynamic Memory, Undefined Behaviour, and Extrinsic Choice
inferred← citeshttps://doi.org/10.1145/3808297openalex-snapshot
SIMT-Step Execution: A Flexible Operational Semantics for GPU Subgroup Behavior
inferred← citeshttps://doi.org/10.1145/3839465openalex-snapshot
A Formal Account of the Wasm 3.0 Concurrency Model
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.