On the public citation graph

Verifying observational robustness against a c11-style memory model

https://doi.org/10.1145/3434285
0 signed · 66 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/978-3-030-81688-9openalex-snapshot
Computer Aided Verification
inferredcites →https://doi.org/10.1007/978-3-540-70545-1_12openalex-snapshot
Effective Program Verification for Relaxed Memory Models
inferredcites →https://doi.org/10.1007/978-3-642-14107-2_23openalex-snapshot
Reasoning about the Implementation of Concurrency Abstractions on x86-TSO
inferredcites →https://doi.org/10.1007/978-3-642-19835-9_3openalex-snapshot
Sound and Complete Monitoring of Sequential Consistency for Relaxed Memory Models
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-22110-1_6openalex-snapshot
Stability in Weak Memory Models
inferredcites →https://doi.org/10.1007/978-3-642-22306-8_10openalex-snapshot
A Verification-Based Approach to Memory Fence Insertion in Relaxed Memory Systems
inferredcites →https://doi.org/10.1007/978-3-642-28869-2_2openalex-snapshot
What’s Decidable about Weak Memory Models?
inferredcites →https://doi.org/10.1007/978-3-642-33651-5_3openalex-snapshot
Show No Weakness: Sequentially Consistent Specifications of TSO Libraries
inferredcites →https://doi.org/10.1007/978-3-642-36742-7_24openalex-snapshot
A Verification-Based Approach to Memory Fence Insertion in PSO Memory Systems
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.1007/978-3-662-46669-8_13openalex-snapshot
The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_17openalex-snapshot
Tackling Real-Life Relaxed Concurrency with FSL++
inferredcites →https://doi.org/10.1016/0743-7315(92)90052-oopenalex-snapshot
Programming for different memory consistency models
inferredcites →https://doi.org/10.1109/32.588521openalex-snapshot
The model checker SPIN
inferredcites →https://doi.org/10.1109/sfcs.1977.16openalex-snapshot
Lower bounds for natural proof systems
inferredcites →https://doi.org/10.1145/1071610.1071615openalex-snapshot
Making snapshot isolation serializable
inferredcites →https://doi.org/10.1145/1073970.1073974openalex-snapshot
Dynamic circular work-stealing deque
inferredcites →https://doi.org/10.1145/1250734.1250737openalex-snapshot
CheckFence
inferredcites →https://doi.org/10.1145/1706299.1706303openalex-snapshot
On the verification problem for weak memory models
inferredcites →https://doi.org/10.1145/1925844.1926394openalex-snapshot
Mathematizing C++ concurrency
inferredcites →https://doi.org/10.1145/2247684.2247688openalex-snapshot
Can seqlocks get along with programming language memory models?
inferredcites →https://doi.org/10.1145/2254064.2254115openalex-snapshot
Dynamic synthesis for relaxed memory models
inferredcites →https://doi.org/10.1145/2509136.2509532openalex-snapshot
Relaxed separation logic
inferredcites →https://doi.org/10.1145/2618128.2618134openalex-snapshot
Outlawing ghosts
inferredcites →https://doi.org/10.1145/2627752openalex-snapshot
Herding Cats
inferredcites →https://doi.org/10.1145/2837614.2837615openalex-snapshot
Modelling the ARMv8 architecture, operationally: concurrency and ISA
inferredcites →https://doi.org/10.1145/2994593openalex-snapshot
Don’t Sit on the Fence
inferredcites →https://doi.org/10.1145/3062341.3062352openalex-snapshot
Repairing sequential consistency in C/C++11
inferredcites →https://doi.org/10.1145/3079856.3080206openalex-snapshot
Chasing Away RAts
inferredcites →https://doi.org/10.1145/3158105openalex-snapshot
Effective stateless model checking for C/C++ concurrency
inferredcites →https://doi.org/10.1145/3192366.3192415openalex-snapshot
Static serializability analysis for causal consistency
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/3293883.3295702openalex-snapshot
Verifying C11 programs operationally
inferredcites →https://doi.org/10.1145/3314221.3314604openalex-snapshot
Robustness against release/acquire semantics
inferredcites →https://doi.org/10.1145/3314221.3314649openalex-snapshot
Verification of programs under the release-acquire semantics
inferredcites →https://doi.org/10.1145/3371102openalex-snapshot
RustBelt meets relaxed memory
inferredcites →https://doi.org/10.1145/3434285openalex-snapshot
Verifying observational robustness against a c11-style memory model
inferredcites →https://doi.org/10.4230/lipics.concur.2016.7openalex-snapshot
Robustness against Consistency Models with Atomic Visibility
inferredcites →https://doi.org/10.4230/lipics.concur.2018.41openalex-snapshot
Automated Detection of Serializability Violations Under Weak Consistency
inferredcites →https://doi.org/10.4230/lipics.concur.2019.30openalex-snapshot
Robustness Against Transactional Causal Consistency.
inferredcites →https://doi.org/10.4230/lipics.ecoop.2020.11openalex-snapshot
Owicki-Gries Reasoning for C11 RAR

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-91118-7_3openalex-snapshot
Sufficient Conditions for Robustness of RDMA Programs
inferred← citeshttps://doi.org/10.1007/978-3-032-26220-2_12openalex-snapshot
Complexity of Consistency Testing for the Release-Acquire Semantics
inferred← citeshttps://doi.org/10.1007/s11036-022-01989-5openalex-snapshot
Modeling and Verifying PSO Memory Model Using CSP
inferred← citeshttps://doi.org/10.1145/3477132.3483560openalex-snapshot
Formal Verification of a Multiprocessor Hypervisor on Arm Relaxed Memory Hardware
inferred← citeshttps://doi.org/10.1145/3485475openalex-snapshot
Making weak memory models fair
inferred← citeshttps://doi.org/10.1145/3519939.3523719openalex-snapshot
Lasagne: a static binary translator for weak memory model architectures
inferred← citeshttps://doi.org/10.1145/3563352openalex-snapshot
Implementing and verifying release-acquire transactional memory in C11
inferred← citeshttps://doi.org/10.1145/3575693.3575729openalex-snapshot
Probabilistic Concurrency Testing for Weak Memory Programs
inferred← citeshttps://doi.org/10.1145/3591251openalex-snapshot
Optimal Reads-From Consistency Checking for C11-Style Memory Models
inferred← citeshttps://doi.org/10.1145/3591297openalex-snapshot
Putting Weak Memory in Order via a Promising Intermediate Representation
inferred← citeshttps://doi.org/10.1145/3632908openalex-snapshot
How Hard Is Weak-Memory Testing?
inferred← citeshttps://doi.org/10.1145/3656425openalex-snapshot
Verification under Intel-x86 with Persistency
inferred← citeshttps://doi.org/10.1145/3669940.3707269openalex-snapshot
Robustness Verification for Checking Crash Consistency of Non-volatile Memory
inferred← citeshttps://doi.org/10.1145/3689749openalex-snapshot
Extending the C/C++ Memory Model with Inline Assembly
inferred← citeshttps://doi.org/10.1145/3689802openalex-snapshot
Automated Robustness Verification of Concurrent Data Structure Libraries against Relaxed Memory Models
inferred← citeshttps://doi.org/10.1145/3704908openalex-snapshot
Relaxed Memory Concurrency Re-executed
inferred← citeshttps://doi.org/10.1145/3729277openalex-snapshot
Dynamic Robustness Verification against Weak Memory
inferred← citeshttps://doi.org/10.1145/3776680openalex-snapshot
Parametrised Verification of Intel-x86 Programs
inferred← citeshttps://doi.org/10.1145/3776690openalex-snapshot
Miri: Practical Undefined Behavior Detection for Rust
inferred← citeshttps://doi.org/10.1145/3839465openalex-snapshot
A Formal Account of the Wasm 3.0 Concurrency Model
inferred← citeshttps://doi.org/10.48550/arxiv.2108.06944openalex-snapshot
Verifying C11-Style Weak Memory Libraries via Refinement
showing the first 21 of 22 · page through all 22
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.