On the public citation graph
Decoupling lock-free data structures from memory reclamation for static analysis
0 signed · 97 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/11817963_44openalex-snapshot
Formal Verification of a Lazy Concurrent List-Based Set Algorithm
inferredcites →https://doi.org/10.1007/3-540-45414-4_21openalex-snapshot
A Pragmatic Implementation of Non-blocking Linked-lists
inferredcites →https://doi.org/10.1007/978-3-319-03077-7_21openalex-snapshot
SPIN as a Linearizability Checker under Weak Memory Models
inferredcites →https://doi.org/10.1007/978-3-319-21668-3_1openalex-snapshot
Poling: SMT Aided Linearizability Proofs
inferredcites →https://doi.org/10.1007/978-3-319-63390-9_28openalex-snapshot
Proving Linearizability Using Forward Simulations
inferredcites →https://doi.org/10.1007/978-3-319-66706-5_9openalex-snapshot
Effect Summaries for Thread-Modular Analysis
inferredcites →https://doi.org/10.1007/978-3-540-30232-2_7openalex-snapshot
Formal Verification of a Practical Lock-Free Queue Algorithm
inferredcites →https://doi.org/10.1007/978-3-540-70545-1_37openalex-snapshot
Thread Quantification for Concurrent Shape Analysis
inferredcites →https://doi.org/10.1007/978-3-540-73368-3_49openalex-snapshot
Comparison Under Abstraction for Verifying Linearizability
inferredcites →https://doi.org/10.1007/978-3-642-02652-2_21openalex-snapshot
Experience with Model Checking Linearizability
inferredcites →https://doi.org/10.1007/978-3-642-04355-0_28openalex-snapshot
Nonblocking Algorithms and Backward Simulation
inferredcites →https://doi.org/10.1007/978-3-642-05089-3_21openalex-snapshot
Model Checking Linearizability via Refinement
inferredcites →https://doi.org/10.1007/978-3-642-10672-9_5openalex-snapshot
Abstract Transformers for Thread Correlation Analysis
inferredcites →https://doi.org/10.1007/978-3-642-12002-2_25openalex-snapshot
Simplifying Linearizability Proofs with Reduction and Abstraction
inferredcites →https://doi.org/10.1007/978-3-642-14295-6_40openalex-snapshot
Automatically Proving Linearizability
inferredcites →https://doi.org/10.1007/978-3-642-14295-6_41openalex-snapshot
Model Checking of Linearizability of Concurrent List Implementations
inferredcites →https://doi.org/10.1007/978-3-642-15375-4_27openalex-snapshot
Reasoning about Optimistic Concurrency Using a Program Logic for History
inferredcites →https://doi.org/10.1007/978-3-642-23283-1_16openalex-snapshot
Formal Verification of a Lock-Free Stack with Hazard Pointers
inferredcites →https://doi.org/10.1007/978-3-642-31424-7_21openalex-snapshot
How to Prove Algorithms Linearisable
inferredcites →https://doi.org/10.1007/978-3-642-36742-7_23openalex-snapshot
An Integrated Specification and Verification Technique for Highly Concurrent Data Structures
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_15openalex-snapshot
Verifying Concurrent Memory Reclamation Algorithms with Grace
inferredcites →https://doi.org/10.1007/978-3-642-39176-7_20openalex-snapshot
Model Checking Unbounded Concurrent Lists
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_9openalex-snapshot
Partial Orders for Efficient Bounded Model Checking of Concurrent Software
inferredcites →https://doi.org/10.1007/978-3-642-40184-8_18openalex-snapshot
Aspect-Oriented Linearizability Proofs
inferredcites →https://doi.org/10.1007/978-3-662-46669-8_14openalex-snapshot
Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity
inferredcites →https://doi.org/10.1007/978-3-662-48653-5_25openalex-snapshot
Modular Verification of Concurrency-Aware Linearizability
inferredcites →https://doi.org/10.1007/978-3-662-53413-7_4openalex-snapshot
Automated Verification of Linearization Policies
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_24openalex-snapshot
Proving Linearizability Using Partial Orders
inferredcites →https://doi.org/10.1007/s00165-009-0130-yopenalex-snapshot
Proving linearizability with temporal logic
inferredcites →https://doi.org/10.1007/s00165-012-0250-7openalex-snapshot
Using refinement calculus techniques to prove linearizability
inferredcites →https://doi.org/10.1007/s10009-016-0415-4openalex-snapshot
An integrated specification and verification technique for highly concurrent data structures
inferredcites →https://doi.org/10.1016/0168-0072(91)90066-uopenalex-snapshot
Verification of concurrent programs: the automata-theoretic framework*
inferredcites →https://doi.org/10.1016/j.entcs.2005.04.026openalex-snapshot
Verifying Concurrent Data Structures by Simulation
inferredcites →https://doi.org/10.1109/iceccs.2007.39openalex-snapshot
Reasoning about Nonblocking Concurrency using Reduction
inferredcites →https://doi.org/10.1109/ispan.2005.42openalex-snapshot
Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
inferredcites →https://doi.org/10.1109/tpds.2008.167openalex-snapshot
Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
inferredcites →https://doi.org/10.1109/tse.2012.82openalex-snapshot
Verifying Linearizability via Optimized Refinement Checking
inferredcites →https://doi.org/10.1145/1007912.1007945openalex-snapshot
DCAS is not a silver bullet for nonblocking algorithm design
inferredcites →https://doi.org/10.1145/1062247.1062249openalex-snapshot
Nonblocking memory management support for dynamic-sized data structures
inferredcites →https://doi.org/10.1145/1190215.1190261openalex-snapshot
Modular verification of a non-blocking stack
inferredcites →https://doi.org/10.1145/1190216.1190261openalex-snapshot
Modular verification of a non-blocking stack
inferredcites →https://doi.org/10.1145/1375581.1375598openalex-snapshot
Deriving linearizable fine-grained concurrent objects
inferredcites →https://doi.org/10.1145/1835698.1835722openalex-snapshot
Verifying linearizability with hindsight
inferredcites →https://doi.org/10.1145/1889997.1890001openalex-snapshot
Mechanically verified proof obligations for linearizability
inferredcites →https://doi.org/10.1145/1985793.1986037openalex-snapshot
Scalable automatic linearizability checking
inferredcites →https://doi.org/10.1145/1993806.1993821openalex-snapshot
On the power of hardware transactional memory to simplify memory management
inferredcites →https://doi.org/10.1145/2103621.2103711openalex-snapshot
A rely-guarantee-based simulation for verifying concurrent program transformations
inferredcites →https://doi.org/10.1145/2103656.2103711openalex-snapshot
A rely-guarantee-based simulation for verifying concurrent program transformations
inferredcites →https://doi.org/10.1145/248052.248106openalex-snapshot
Simple, fast, and practical non-blocking and blocking concurrent queue algorithms
inferredcites →https://doi.org/10.1145/2491956.2462189openalex-snapshot
Modular verification of linearizability with non-fixed linearization points
inferredcites →https://doi.org/10.1145/2506164.2506174openalex-snapshot
Multi-core systems modeling for formal verification of parallel algorithms
inferredcites →https://doi.org/10.1145/2576235openalex-snapshot
Rely-Guarantee-Based Simulation for Compositional Verification of Concurrent Program Transformations
inferredcites →https://doi.org/10.1145/2676726.2676963openalex-snapshot
A Scalable, Correct Time-Stamped Stack
inferredcites →https://doi.org/10.1145/2737924.2737964openalex-snapshot
Mechanized verification of fine-grained concurrent programs
inferredcites →https://doi.org/10.1145/2737924.2737983openalex-snapshot
Monitoring refinement via symbolic reasoning
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/2755573.2755579openalex-snapshot
Efficient Memory Management for Lock-Free Data Structures with Optimistic Access
inferredcites →https://doi.org/10.1145/2767386.2767436openalex-snapshot
Reclaiming Memory for Lock-Free Data Structures
inferredcites →https://doi.org/10.1145/2814270.2814298openalex-snapshot
Automatic memory reclamation for lock-free data structures
inferredcites →https://doi.org/10.1145/2926697.2926699openalex-snapshot
Fast non-intrusive memory reclamation for highly-concurrent data structures
inferredcites →https://doi.org/10.1145/2935764.2935790openalex-snapshot
Fast and Robust Memory Reclamation for Concurrent Data Structures
inferredcites →https://doi.org/10.1145/3092255.3092274openalex-snapshot
Type-assisted automatic garbage collection for lock-free data structures
inferredcites →https://doi.org/10.1145/3092282.3092287openalex-snapshot
Stateless model checking of the Linux kernel's hierarchical read-copy-update (tree RCU)
inferredcites →https://doi.org/10.1145/3158113openalex-snapshot
Sound, complete, and tractable linearizability monitoring for concurrent collections
inferredcites →https://doi.org/10.1145/3158125openalex-snapshot
Go with the flow: compositional abstractions for concurrent data structures
inferredcites →https://doi.org/10.1145/3178487.3178488openalex-snapshot
Interval-based memory reclamation
inferredcites →https://doi.org/10.1145/571825.571829openalex-snapshot
Safe memory reclamation for dynamic lock-free objects using atomic reads and writes
inferredcites →https://doi.org/10.1145/69575.69577openalex-snapshot
Tentative steps toward a development method for interfering programs
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.4230/lipics.ecoop.2017.8openalex-snapshot
Concurrent Data Structures Linked in Time
inferredcites →https://doi.org/10.48550/arxiv.1410.6268openalex-snapshot
Verifying linearizability: A comparative survey
inferredcites →https://doi.org/10.48550/arxiv.1504.00204openalex-snapshot
Faster linearizability checking via $P$-compositionality
inferredcites →https://doi.org/10.48550/arxiv.1701.06104openalex-snapshot
Verifying Concurrent Stacks by Divergence-Sensitive Bisimulation
inferredcites →https://doi.org/10.6083/m4gh9fvbopenalex-snapshot
Exploiting deferred destruction an analysis of read-copy-update techniques in operating system kernels
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-030-17184-1_4openalex-snapshot
Safe Deferred Memory Reclamation with Types
inferred← citeshttps://doi.org/10.1007/978-3-031-98668-0_3openalex-snapshot
Arithmetizing Shape Analysis
inferred← citeshttps://doi.org/10.1007/s10009-022-00648-0openalex-snapshot
Parameterized verification of systems with component identities, using view abstraction
inferred← citeshttps://doi.org/10.1145/3371136openalex-snapshot
Pointer life cycle types for lock-free data structures with memory reclamation
inferred← citeshttps://doi.org/10.1145/3385412.3385978openalex-snapshot
A marriage of pointer- and epoch-based reclamation
inferred← citeshttps://doi.org/10.1145/3385412.3386029openalex-snapshot
Verifying concurrent search structure templates
inferred← citeshttps://doi.org/10.1145/3563337openalex-snapshot
A concurrent program logic with a future and history
inferred← citeshttps://doi.org/10.1145/3572848.3577491openalex-snapshot
The ERA Theorem for Safe Memory Reclamation
inferred← citeshttps://doi.org/10.1145/3583668.3594564openalex-snapshot
The ERA Theorem for Safe Memory Reclamation
inferred← citeshttps://doi.org/10.1145/3622827openalex-snapshot
Modular Verification of Safe Memory Reclamation in Concurrent Separation Logic
inferred← citeshttps://doi.org/10.1145/3716312openalex-snapshot
Will It Fit? Verifying Heap Space Bounds of Concurrent Programs under Garbage Collection
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.