On the public citation graph
Progress of concurrent objects with partial methods
0 signed · 46 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-319-33693-0_13openalex-snapshot
Towards a Thread-Local Proof Technique for Starvation Freedom
inferredcites →https://doi.org/10.1007/978-3-540-74061-2_15openalex-snapshot
Modular Safety Checking for Fine-Grained Concurrency
inferredcites →https://doi.org/10.1007/978-3-642-00590-9_19openalex-snapshot
Abstraction for Concurrent Objects
inferredcites →https://doi.org/10.1007/978-3-642-22012-8_36openalex-snapshot
Liveness-Preserving Atomicity Abstraction
inferredcites →https://doi.org/10.1007/978-3-642-25873-2_22openalex-snapshot
On the Nature of Progress
inferredcites →https://doi.org/10.1007/978-3-642-32940-1_19openalex-snapshot
Linearizability with Ownership Transfer
inferredcites →https://doi.org/10.1007/978-3-642-40184-8_17openalex-snapshot
Characterizing Progress Properties of Concurrent Objects via Contextual Refinements
inferredcites →https://doi.org/10.1007/978-3-662-49498-1_8openalex-snapshot
Modular Termination Verification for Non-blocking Concurrency
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_24openalex-snapshot
Proving Linearizability Using Partial Orders
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_34openalex-snapshot
A Higher-Order Logic for Concurrent Termination-Preserving Refinement
inferredcites →https://doi.org/10.1016/c2011-0-06993-4openalex-snapshot
The Art of Multiprocessor Programming
inferredcites →https://doi.org/10.1109/lics.2013.18openalex-snapshot
Quantitative Reasoning for Proving Lock-Freedom
inferredcites →https://doi.org/10.1145/103727.103729openalex-snapshot
Algorithms for scalable synchronization on shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/1480881.1480886openalex-snapshot
Proving that non-blocking algorithms don't block
inferredcites →https://doi.org/10.1145/1594834.1480886openalex-snapshot
Proving that non-blocking algorithms don't block
inferredcites →https://doi.org/10.1145/2429069.2429111openalex-snapshot
Logical relations for fine-grained concurrency
inferredcites →https://doi.org/10.1145/2491956.2462189openalex-snapshot
Modular verification of linearizability with non-fixed linearization points
inferredcites →https://doi.org/10.1145/2603088.2603123openalex-snapshot
Compositional verification of termination-preserving refinement of concurrent programs
inferredcites →https://doi.org/10.1145/2837614.2837635openalex-snapshot
A program logic for concurrent objects under fair scheduling
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.3929/ethz-a-010341095openalex-snapshot
Modular Verification of Finite Blocking in Non-terminating Programs
inferredcites →https://doi.org/10.4230/lipics.ecoop.2015.664openalex-snapshot
Modular Termination Verification
inferredcites →https://doi.org/10.5555/3026877.3026928openalex-snapshot
CertiKOS: an extensible architecture for building certified concurrent OS 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-81688-9_2openalex-snapshot
Ghost Signals: Verifying Termination of Busy Waiting
inferred← citeshttps://doi.org/10.1007/978-3-031-40436-8_5openalex-snapshot
Specifying and Reasoning About Shared-Variable Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-032-30693-7_26openalex-snapshot
Intuitive Verification of Sequential Programs Using Hybrid Reasoning
inferred← citeshttps://doi.org/10.1007/s11390-021-1671-7openalex-snapshot
Verifying Contextual Refinement with Ownership Transfer
inferred← citeshttps://doi.org/10.1007/s12652-021-03454-9openalex-snapshot
Formal design and verification of system task in intelligent transportation systems based on micro-kernel architecture
inferred← citeshttps://doi.org/10.1016/j.sysarc.2023.103046openalex-snapshot
ThreadAbs: A template to build verified thread-local interfaces with software scheduler abstractions
inferred← citeshttps://doi.org/10.1016/j.sysarc.2023.103049openalex-snapshot
SimplMM: A simplified and abstract multicore hardware model for large scale system software formal verification
inferred← citeshttps://doi.org/10.1109/tits.2022.3224385openalex-snapshot
A Formal Approach to Design and Security Verification of Operating Systems for Intelligent Transportation Systems Based on Object Model
inferred← citeshttps://doi.org/10.1145/3360587openalex-snapshot
Specifying concurrent programs in separation logic: morphisms and simulations
inferred← citeshttps://doi.org/10.1145/3427761.3428345openalex-snapshot
A separation logic to verify termination of busy-waiting for abrupt program exit
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/3477082openalex-snapshot
TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs
inferred← citeshttps://doi.org/10.1145/3498689openalex-snapshot
Simuliris: a separation logic framework for verifying concurrent program optimizations
inferred← citeshttps://doi.org/10.1145/3632851openalex-snapshot
Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement
inferred← citeshttps://doi.org/10.1145/3632889openalex-snapshot
Deadlock-Free Separation Logic: Linearity Yields Progress for Dependent Higher-Order Message Passing
inferred← citeshttps://doi.org/10.1145/3720525openalex-snapshot
Lilo: A Higher-Order, Relational Concurrent Separation Logic for Liveness
inferred← citeshttps://doi.org/10.4204/eptcs.282.2openalex-snapshot
Some Challenges of Specifying Concurrent Program Components
inferred← citeshttps://doi.org/10.48550/arxiv.2007.10215openalex-snapshot
A Separation Logic to Verify Termination of Busy-Waiting for Abrupt Program Exit: Technical Report
inferred← citeshttps://doi.org/10.48550/arxiv.2010.11762openalex-snapshot
Ghost Signals: Verifying Termination of Busy-Waiting (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.