On the public citation graph
Pomsets with preconditions: a simple model of relaxed memory
0 signed · 74 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.1007/3-540-16042-6_21openalex-snapshot
A proof technique for rely/guarantee properties
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-319-48989-6_29openalex-snapshot
Explaining Relaxed Memory Models with Program Transformations
inferredcites →https://doi.org/10.1007/978-3-319-89884-1_13openalex-snapshot
A Separation Logic for a Promising Semantics
inferredcites →https://doi.org/10.1007/978-3-540-71316-6_23openalex-snapshot
The Java Memory Model: Operationally, Denotationally, Axiomatically
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-642-82453-1_5openalex-snapshot
In Transition From Global to Modular Temporal Reasoning about Programs
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(88)90124-7openalex-snapshot
The equational theory of pomsets
inferredcites →https://doi.org/10.1098/rsta.2015.0406openalex-snapshot
Compositional relaxed concurrency
inferredcites →https://doi.org/10.1109/71.242161openalex-snapshot
A unified formalization of four shared-memory models
inferredcites →https://doi.org/10.1109/cgo.2017.7863732openalex-snapshot
Formalizing the concurrency semantics of an LLVM fragment
inferredcites →https://doi.org/10.1109/sp.2019.00047openalex-snapshot
The Code That Never Ran: Modeling Attacks on Speculative Evaluation
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.1981.230844openalex-snapshot
Proofs of Networks of Processes
inferredcites →https://doi.org/10.1145/1926385.1926394openalex-snapshot
Mathematizing C++ concurrency
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/2837614.2837615openalex-snapshot
Modelling the ARMv8 architecture, operationally: concurrency and ISA
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/2837614.2837637openalex-snapshot
Overhauling SC atomics in C11 and OpenCL
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.3009839openalex-snapshot
Mixed-size concurrency: ARM, POWER, C/C++11, and SC
inferredcites →https://doi.org/10.1145/3062341.3062352openalex-snapshot
Repairing sequential consistency in C/C++11
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/3192366.3192421openalex-snapshot
Bounding data races in space and time
inferredcites →https://doi.org/10.1145/325164.325100openalex-snapshot
Weak ordering---a new definition
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.3314624openalex-snapshot
Promising-ARM/RISC-V: a simpler and faster operational concurrency model
inferredcites →https://doi.org/10.1145/3385412.3385973openalex-snapshot
Repairing and mechanising the JavaScript relaxed memory model
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.17863/cam.21258openalex-snapshot
Simplifying ARM concurrency: multicopy-atomic axiomatic and operational models for ARMv8
inferredcites →https://doi.org/10.23638/lmcs-15(1:33)2019openalex-snapshot
On Thin Air Reads: Towards an Event Structures Model of Relaxed Memory
inferredcites →https://doi.org/10.23638/lmcs-15(2:10)2019openalex-snapshot
A Denotational Semantics for SPARC TSO
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-81685-8_20openalex-snapshot
GenMC: A Model Checker for Weak Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-030-90870-6_13openalex-snapshot
Owicki-Gries Reasoning for C11 Programs with Relaxed Dependencies
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-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.1134/s0361768821060050openalex-snapshot
A Survey of Programming Language Memory Models
inferred← citeshttps://doi.org/10.1145/3453483.3454082openalex-snapshot
Modular data-race-freedom guarantees in the promising semantics
inferred← citeshttps://doi.org/10.1145/3498716openalex-snapshot
The leaky semicolon: compositional semantic dependencies for relaxed-memory concurrency
inferred← citeshttps://doi.org/10.1145/3519939.3523718openalex-snapshot
Sequential reasoning for optimizing compilers under weak memory concurrency
inferred← citeshttps://doi.org/10.1145/3545117openalex-snapshot
Unifying Operational Weak Memory Verification: An Axiomatic Approach
inferred← citeshttps://doi.org/10.1145/3563315openalex-snapshot
Model checking for a multi-execution memory model
inferred← citeshttps://doi.org/10.1145/3563352openalex-snapshot
Implementing and verifying release-acquire transactional memory in C11
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/3695053.3731102openalex-snapshot
Precise exceptions in relaxed architectures
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/3839465openalex-snapshot
A Formal Account of the Wasm 3.0 Concurrency Model
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.48550/arxiv.2108.01418openalex-snapshot
Owicki-Gries Reasoning for C11 Programs with Relaxed Dependencies (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.2108.06944openalex-snapshot
Verifying C11-Style Weak Memory Libraries via Refinement
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.