On the public citation graph
Formal verification of a concurrent bounded queue in a weak memory model
0 signed · 61 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/978-3-030-44914-8_11openalex-snapshot
Verifying Visibility-Based Weak Consistency
inferredcites →https://doi.org/10.1007/978-3-540-28644-8_2openalex-snapshot
A Semantics for Concurrent 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-37036-6_11openalex-snapshot
Modular Reasoning about Separation of Concurrent Data Structures
inferredcites →https://doi.org/10.1007/978-3-662-44202-9_9openalex-snapshot
TaDA: A Logic for Time and Data Abstraction
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.1007/978-3-662-49122-5_20openalex-snapshot
A Program Logic for C11 Memory Fences
inferredcites →https://doi.org/10.1007/s00165-019-00499-8openalex-snapshot
Linearizability on hardware weak memory models
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/lics.2002.1029817openalex-snapshot
Separation logic: a logic for shared mutable data structures
inferredcites →https://doi.org/10.1109/sbac-pad.2013.8openalex-snapshot
Correct and Efficient Bounded FIFO Queues
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/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/1926385.1926394openalex-snapshot
Mathematizing C++ concurrency
inferredcites →https://doi.org/10.1145/1926385.1926417openalex-snapshot
Expressive modular fine-grained concurrency specification
inferredcites →https://doi.org/10.1145/2442516.2442524openalex-snapshot
Correct and efficient work-stealing for weak memory models
inferredcites →https://doi.org/10.1145/3062341.3062352openalex-snapshot
Repairing sequential consistency in C/C++11
inferredcites →https://doi.org/10.1145/3167132.3167333openalex-snapshot
Verified compilation of linearizable data structures
inferredcites →https://doi.org/10.1145/3192366.3192421openalex-snapshot
Bounding data races in space and time
inferredcites →https://doi.org/10.1145/3290373openalex-snapshot
Weak-consistency specification via visibility relaxation
inferredcites →https://doi.org/10.1145/3290381openalex-snapshot
On library correctness under weak memory consistency: specifying and verifying concurrent libraries under declarative consistency models
inferredcites →https://doi.org/10.1145/3360568openalex-snapshot
A formalization of Java’s concurrent access modes
inferredcites →https://doi.org/10.1145/3371113openalex-snapshot
The future is ours: prophecy variables in separation logic
inferredcites →https://doi.org/10.1145/3408978openalex-snapshot
Cosmo: a concurrent separation logic for multicore OCaml
inferredcites →https://doi.org/10.1145/3410229openalex-snapshot
Coq Proof Scripts for Article: Cosmo: A Concurrent Separation Logic for Multicore OCaml
inferredcites →https://doi.org/10.1145/3437992.3439930openalex-snapshot
Contextual refinement of the Michael-Scott queue (proof pearl)
inferredcites →https://doi.org/10.1145/3437992.3439931openalex-snapshot
Reasoning about monotonicity in separation logic
inferredcites →https://doi.org/10.1145/3473586openalex-snapshot
Theorems for free from separation logic specifications
inferredcites →https://doi.org/10.1145/3497775.3503689openalex-snapshot
Mechanized verification of a fine-grained concurrent queue from meta’s folly library
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.46298/lmcs-17(3:9)2021openalex-snapshot
ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10817-024-09701-wopenalex-snapshot
Refinement of Parallel Algorithms Down to LLVM: Applied to Practically Efficient Parallel Sorting
inferred← citeshttps://doi.org/10.1145/3497775.3503681openalex-snapshot
Applying formal verification to microkernel IPC at meta
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.3523451openalex-snapshot
Compass: strong and compositional library specifications in relaxed memory separation logic
inferred← citeshttps://doi.org/10.1145/3571246openalex-snapshot
An Operational Approach to Library Abstraction under Relaxed Memory Concurrency
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/3622820openalex-snapshot
Spirea: A Mechanized Concurrent Separation Logic for Weak Persistent Memory
inferred← citeshttps://doi.org/10.1145/3656384openalex-snapshot
A Proof Recipe for Linearizability in Relaxed Memory Separation Logic
inferred← citeshttps://doi.org/10.1145/3689732openalex-snapshot
Verified Lock-Free Session Channels with Linking
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/3729248openalex-snapshot
Verifying Lock-Free Traversals in Relaxed Memory Separation Logic
inferred← citeshttps://doi.org/10.1145/3808337openalex-snapshot
A Verified Parallel Scheduler for OCaml 5
inferred← citeshttps://doi.org/10.1145/3828682openalex-snapshot
Completeness of Iris-Based Program Logics
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.