On the public citation graph
Cosmo: a concurrent separation logic for multicore OCaml
0 signed · 41 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.1994.1093openalex-snapshot
A Syntactic Approach to Type Soundness
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_25openalex-snapshot
Java and the Java Memory Model — A Unified, Machine-Checked Formalisation
inferredcites →https://doi.org/10.1007/978-3-642-32027-9openalex-snapshot
Concurrent Programming: Algorithms, Principles, and Foundations
inferredcites →https://doi.org/10.1007/978-3-662-46669-8_30openalex-snapshot
A Separation Logic for Fictional Sequential Consistency
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/j.entcs.2011.09.018openalex-snapshot
Step-Indexed Kripke Model of Separation Logic for Storable Locks
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.035openalex-snapshot
Resources, concurrency, and local reasoning
inferredcites →https://doi.org/10.1017/s0956796818000151openalex-snapshot
Iris from the ground up: A modular foundation for higher-order concurrent separation logic
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/1047659.1040327openalex-snapshot
Permission accounting in separation logic
inferredcites →https://doi.org/10.1145/1190216.1190261openalex-snapshot
Modular verification of a non-blocking stack
inferredcites →https://doi.org/10.1145/1925844.1926394openalex-snapshot
Mathematizing C++ concurrency
inferredcites →https://doi.org/10.1145/3062341.3062352openalex-snapshot
Repairing sequential consistency in C/C++11
inferredcites →https://doi.org/10.1145/3140587.3062352openalex-snapshot
Repairing sequential consistency in C/C++11
inferredcites →https://doi.org/10.1145/3158154openalex-snapshot
RustBelt: securing the foundations of the Rust programming language
inferredcites →https://doi.org/10.1145/3192366.3192421openalex-snapshot
Bounding data races in space and time
inferredcites →https://doi.org/10.1145/3335772.3335935openalex-snapshot
How to make a multiprocessor computer that correctly executes multiprocess programs
inferredcites →https://doi.org/10.1145/3360568openalex-snapshot
A formalization of Java’s concurrent access modes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1145/3453483.3454031openalex-snapshot
Transfinite Iris: resolving an existential dilemma of step-indexed separation logic
inferred← citeshttps://doi.org/10.1145/3473571openalex-snapshot
Formal verification of a concurrent bounded queue in a weak memory model
inferred← citeshttps://doi.org/10.1145/3497775.3503689openalex-snapshot
Mechanized verification of a fine-grained concurrent queue from meta’s folly library
inferred← citeshttps://doi.org/10.1145/3519939.3523432openalex-snapshot
Diaframe: automated verification of fine-grained concurrent programs in Iris
inferred← citeshttps://doi.org/10.1145/3519939.3523451openalex-snapshot
Compass: strong and compositional library specifications in relaxed memory separation logic
inferred← citeshttps://doi.org/10.1145/3622823openalex-snapshot
Melocoton: A Program Logic for Verified Interoperability Between OCaml and C
inferred← citeshttps://doi.org/10.1145/3622827openalex-snapshot
Modular Verification of Safe Memory Reclamation in Concurrent Separation Logic
inferred← citeshttps://doi.org/10.1145/3632853openalex-snapshot
DisLog: A Separation Logic for Disentanglement
inferred← citeshttps://doi.org/10.1145/3656384openalex-snapshot
A Proof Recipe for Linearizability in Relaxed Memory Separation Logic
inferred← citeshttps://doi.org/10.1145/3729246openalex-snapshot
Verifying General-Purpose RCU for Reclamation in Relaxed Memory Separation Logic
inferred← citeshttps://doi.org/10.1145/3729311openalex-snapshot
PulseCore: An Impredicative Concurrent Separation Logic for Dependently Typed Programs
inferred← citeshttps://doi.org/10.1145/3786762openalex-snapshot
An Axiomatic Basis for Computer Programming on Relaxed Hardware Architectures: The AxSL Logics
inferred← citeshttps://doi.org/10.1145/3808303openalex-snapshot
Backwards-Compatible Row-Based Exceptions in ML
inferred← citeshttps://doi.org/10.1145/3808337openalex-snapshot
A Verified Parallel Scheduler for OCaml 5
inferred← citeshttps://doi.org/10.70675/95fceee8z06bbz48ccz8b06z87fb9e672ea8openalex-snapshot
Proof-oriented domain-specific language design for high-assurance software
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.