On the public citation graph

RustBelt meets relaxed memory

https://doi.org/10.1145/3371102
0 signed · 92 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/3-540-44898-5_4openalex-snapshot
Checking Interference with Fractional Permissions
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-76637-7_3openalex-snapshot
Local Reasoning for Storable Locks and Threads
inferredcites →https://doi.org/10.1007/978-3-540-78739-6_27openalex-snapshot
Oracle Semantics for Concurrent Separation Logic
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.1007/s10766-017-0518-xopenalex-snapshot
GPS$$+$$+: Reasoning About Fences and Relaxed Atomics
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/lics.2002.1029817openalex-snapshot
Separation logic: a logic for shared mutable data structures
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/1040305.1040327openalex-snapshot
Permission accounting in separation logic
inferredcites →https://doi.org/10.1145/1073970.1073974openalex-snapshot
Dynamic circular work-stealing deque
inferredcites →https://doi.org/10.1145/1709093.1709094openalex-snapshot
Semantic foundations for typed assembly languages
inferredcites →https://doi.org/10.1145/1925844.1926394openalex-snapshot
Mathematizing C++ concurrency
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/2660193.2660243openalex-snapshot
GPS
inferredcites →https://doi.org/10.1145/2737924.2737992openalex-snapshot
Verifying read-copy-update in a logic for weak memory
inferredcites →https://doi.org/10.1145/2813885.2737992openalex-snapshot
Verifying read-copy-update in a logic for weak memory
inferredcites →https://doi.org/10.1145/3009837.3009850openalex-snapshot
A promising semantics for relaxed-memory concurrency
inferredcites →https://doi.org/10.1145/3009837.3009855openalex-snapshot
Interactive proofs in higher-order concurrent separation logic
inferredcites →https://doi.org/10.1145/3062341.3062352openalex-snapshot
Repairing sequential consistency in C/C++11
inferredcites →https://doi.org/10.1145/3093333.3009850openalex-snapshot
A promising semantics for relaxed-memory concurrency
inferredcites →https://doi.org/10.1145/3158154openalex-snapshot
RustBelt: securing the foundations of the Rust programming language
inferredcites →https://doi.org/10.1145/3236772openalex-snapshot
MoSeL: a general, extensible modal framework for interactive proofs in separation logic
inferredcites →https://doi.org/10.1145/3293883.3295702openalex-snapshot
Verifying C11 programs operationally
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.5281/zenodo.3539236openalex-snapshot
RustBelt Meets Relaxed Memory (Artifact)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← backgroundhttps://doi.org/10.5281/zenodo.3539237zenodo-depositor-declared
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-06773-0_22openalex-snapshot
On the Termination of Borrow Checking in Featherweight Rust
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_27openalex-snapshot
Unifying Weak Memory Verification Using Potentials
inferred← citeshttps://doi.org/10.1007/978-3-032-26220-2_20openalex-snapshot
Reasoning over Relaxed Shared Memory Models: A Tutorial
inferred← citeshttps://doi.org/10.1007/978-3-032-28079-4_19openalex-snapshot
Verifying the Rust Standard Library
inferred← citeshttps://doi.org/10.1016/j.cola.2022.101154openalex-snapshot
Taming stateful computations in Rust with typestates
inferred← citeshttps://doi.org/10.1016/j.hcc.2025.100377openalex-snapshot
Enhancing concurrency bug detection in Rust programs through LLVM IR based graph visualization
inferred← citeshttps://doi.org/10.1016/j.scico.2024.103152openalex-snapshot
Taming shared mutable states of operating systems in Rust
inferred← citeshttps://doi.org/10.1109/cisce62493.2024.10653388openalex-snapshot
Towards Understanding Rust in the Era of AI for Science at an Ecosystem Scale
inferred← citeshttps://doi.org/10.1109/iccece65250.2025.10984876openalex-snapshot
Optimizing Concurrent Data Structures in Rust
inferred← citeshttps://doi.org/10.1109/qrs57517.2022.00101openalex-snapshot
CRUST: Towards a Unified Cross-Language Program Analysis Framework for Rust
inferred← citeshttps://doi.org/10.1109/qrs57517.2022.00102openalex-snapshot
Comprehensiveness, Automation and Lifecycle: A New Perspective for Rust Security
inferred← citeshttps://doi.org/10.1109/qrs62785.2024.00035openalex-snapshot
Beyond Memory Safety: an Empirical Study on Bugs and Fixes of Rust Programs
inferred← citeshttps://doi.org/10.1109/secdev61143.2024.00012openalex-snapshot
Understanding the Challenges in Detecting Vulnerabilities of Rust Applications
inferred← citeshttps://doi.org/10.1134/s0361768821060050openalex-snapshot
A Survey of Programming Language Memory Models
inferred← citeshttps://doi.org/10.1145/3381898.3397211openalex-snapshot
Verified sequential Malloc/Free
inferred← citeshttps://doi.org/10.1145/3408978openalex-snapshot
Cosmo: a concurrent separation logic for multicore OCaml
inferred← citeshttps://doi.org/10.1145/3418295openalex-snapshot
Safe Systems Programming in Rust: The Promise and the Challenge
inferred← citeshttps://doi.org/10.1145/3434285openalex-snapshot
Verifying observational robustness against a c11-style memory model
inferred← citeshttps://doi.org/10.1145/3443420openalex-snapshot
A Lightweight Formalism for Reference Lifetimes and Borrowing in Rust
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/3453483.3454036openalex-snapshot
RefinedC: automating the foundational verification of C code with refined ownership types
inferred← citeshttps://doi.org/10.1145/3453483.3454081openalex-snapshot
Automatically enforcing fresh and consistent inputs in intermittent systems
inferred← citeshttps://doi.org/10.1145/3453483.3454082openalex-snapshot
Modular data-race-freedom guarantees in the promising semantics
inferred← citeshttps://doi.org/10.1145/3466642openalex-snapshot
Memory-Safety Challenge Considered Solved? An In-Depth Study with All Rust CVEs
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/3477132.3483570openalex-snapshot
Rudra
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/3542948openalex-snapshot
SafeDrop: Detecting Memory Deallocation Bugs of Rust Programs via Static Data-flow Analysis
inferred← citeshttps://doi.org/10.1145/3547631openalex-snapshot
Later credits: resourceful reasoning for the later modality
inferred← citeshttps://doi.org/10.1145/3563292openalex-snapshot
CAAT: consistency as a theory
inferred← citeshttps://doi.org/10.1145/3575693.3575729openalex-snapshot
Probabilistic Concurrency Testing for Weak Memory Programs
inferred← citeshttps://doi.org/10.1145/3580285openalex-snapshot
Mechanised Operational Reasoning for C11 Programs with Relaxed Dependencies
inferred← citeshttps://doi.org/10.1145/3586037openalex-snapshot
Verus: Verifying Rust Programs using Linear Ghost Types
inferred← citeshttps://doi.org/10.1145/3591250openalex-snapshot
A Type System for Safe Intermittent Computing
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/3597503.3639136openalex-snapshot
Is unsafe an Achilles' Heel? A Comprehensive Study of Safety Requirements in Unsafe Rust Programming
inferred← citeshttps://doi.org/10.1145/3607856openalex-snapshot
Dependent Session Protocols in Separation Logic from First Principles (Functional Pearl)
inferred← citeshttps://doi.org/10.1145/3622798openalex-snapshot
Leaf: Modularity for Temporary Sharing in Separation Logic
inferred← citeshttps://doi.org/10.1145/3622820openalex-snapshot
Spirea: A Mechanized Concurrent Separation Logic for Weak Persistent Memory
inferred← citeshttps://doi.org/10.1145/3622827openalex-snapshot
Modular Verification of Safe Memory Reclamation in Concurrent Separation Logic
inferred← citeshttps://doi.org/10.1145/3624738openalex-snapshot
A Closer Look at the Security Risks in the Rust Ecosystem
inferred← citeshttps://doi.org/10.1145/3626183.3659966openalex-snapshot
When Is Parallelism Fearless and Zero-Cost with Rust?
inferred← citeshttps://doi.org/10.1145/3632848openalex-snapshot
An Iris Instance for Verifying CompCert C Programs
inferred← citeshttps://doi.org/10.1145/3632853openalex-snapshot
DisLog: A Separation Logic for Disentanglement
inferred← citeshttps://doi.org/10.1145/3632863openalex-snapshot
An Axiomatic Basis for Computer Programming on the Relaxed Arm-A Architecture: The AxSL Logic
inferred← citeshttps://doi.org/10.1145/3656384openalex-snapshot
A Proof Recipe for Linearizability in Relaxed Memory Separation Logic
inferred← citeshttps://doi.org/10.1145/3676954openalex-snapshot
A Logical Approach to Type Soundness
inferred← citeshttps://doi.org/10.1145/3704903openalex-snapshot
Generically Automating Separation Logic by Functors, Homomorphisms, and Modules
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/3729248openalex-snapshot
Verifying Lock-Free Traversals in Relaxed Memory Separation Logic
inferred← citeshttps://doi.org/10.1145/3729250openalex-snapshot
Nola: Later-Free Ghost State for Verifying Termination in Iris
inferred← citeshttps://doi.org/10.1145/3764860.3768337openalex-snapshot
Modal Verification Patterns for Systems Software
inferred← citeshttps://doi.org/10.1145/3779212.3790129openalex-snapshot
Arm Weak Memory Consistency on Apple Silicon: What Is It Good For?
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/3828682openalex-snapshot
Completeness of Iris-Based Program Logics
inferred← citeshttps://doi.org/10.1145/3839465openalex-snapshot
A Formal Account of the Wasm 3.0 Concurrency Model
inferred← citeshttps://doi.org/10.1145/3839507openalex-snapshot
RGSep under Release/Acquire Consistency
inferred← citeshttps://doi.org/10.14722/ndss.2022.24078openalex-snapshot
Cross-Language Attacks
inferred← citeshttps://doi.org/10.2139/ssrn.5194144openalex-snapshot
Memory consistency models made EPR :Decidable verification of a fragment of the Promising Semantics
inferred← citeshttps://doi.org/10.31436/iiumej.v27i2.4361openalex-snapshot
TSGL-Rust: Teaching Concurrency Through Compile-Time Enforcement via Rust-Based Visualization of Classical Synchronization Problems
inferred← citeshttps://doi.org/10.48550/arxiv.2108.01418openalex-snapshot
Owicki-Gries Reasoning for C11 Programs with Relaxed Dependencies (Extended Version)
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.