On the public citation graph

Memory consistency models made EPR :Decidable verification of a fragment of the Promising Semantics

https://doi.org/10.2139/ssrn.5194144
0 signed · 33 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-53291-8_12openalex-snapshot
Ivy: A Multi-modal Verification Tool for Distributed Algorithms
inferredcites →https://doi.org/10.1007/978-3-030-67087-0_4openalex-snapshot
On the State Reachability Problem for Concurrent Programs Under Power
inferredcites →https://doi.org/10.1007/978-3-031-22337-2_24openalex-snapshot
Consistency and Persistency in Program Verification: Challenges and Opportunities
inferredcites →https://doi.org/10.1007/978-3-031-30823-9_6openalex-snapshot
Optimal Stateless Model Checking for Causal Consistency
inferredcites →https://doi.org/10.1007/978-3-031-56222-8_1openalex-snapshot
Fairness and Liveness Under Weak Consistency
inferredcites →https://doi.org/10.1007/978-3-031-56222-8_7openalex-snapshot
On Verifying Concurrent Programs Under Weak Consistency Models: Decidability and Complexity
inferredcites →https://doi.org/10.1007/978-3-031-65627-9_13openalex-snapshot
Toward Liveness Proofs at Scale
inferredcites →https://doi.org/10.1007/978-3-319-63387-9_2openalex-snapshot
Program Verification Under Weak Memory Consistency Using Separation Logic
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-662-47666-6_25openalex-snapshot
Owicki-Gries Reasoning for Weak Memory Models
inferredcites →https://doi.org/10.1145/1706299.1706303openalex-snapshot
On the verification problem for weak memory models
inferredcites →https://doi.org/10.1145/2509136.2509532openalex-snapshot
Relaxed separation logic
inferredcites →https://doi.org/10.1145/2660193.2660243openalex-snapshot
GPS
inferredcites →https://doi.org/10.1145/2837614.2837622openalex-snapshot
Chapar: certified causally consistent distributed key-value stores
inferredcites →https://doi.org/10.1145/2908080.2908118openalex-snapshot
Ivy: safety verification by interactive generalization
inferredcites →https://doi.org/10.1145/3009837.3009850openalex-snapshot
A promising semantics for relaxed-memory concurrency
inferredcites →https://doi.org/10.1145/3140568openalex-snapshot
Paxos made EPR: decidable reasoning about distributed protocols
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/3192366.3192421openalex-snapshot
Bounding data races in space and time
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.3314624openalex-snapshot
Promising-ARM/RISC-V: a simpler and faster operational concurrency model
inferredcites →https://doi.org/10.1145/3314221.3314649openalex-snapshot
Verification of programs under the release-acquire semantics
inferredcites →https://doi.org/10.1145/3360580openalex-snapshot
Mergeable replicated data types
inferredcites →https://doi.org/10.1145/3371102openalex-snapshot
RustBelt meets relaxed memory
inferredcites →https://doi.org/10.1145/3385412.3385966openalex-snapshot
Decidable verification under a causally consistent shared 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/3505273openalex-snapshot
What’s Decidable About Causally Consistent Shared Memory?
inferredcites →https://doi.org/10.1145/3519939.3523724openalex-snapshot
RunTime-assisted convergence in replicated data types
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.ecoop.2017.17openalex-snapshot
Strong Logic for Weak Memory: Reasoning About Release-Acquire Consistency in Iris
inferredcites →https://doi.org/10.48550/arxiv.1806.08416openalex-snapshot
Automated Detection of Serializability Violations under Weak Consistency
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.