On the public citation graph
On algebraic abstractions for concurrent separation logics
0 signed · 58 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/11575467_5openalex-snapshot
Symbolic Execution with Separation Logic
inferredcites →https://doi.org/10.1007/978-3-319-71237-6_10openalex-snapshot
Bringing Order to the Separation Logic Jungle
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-642-14107-2_24openalex-snapshot
Concurrent Abstract Predicates
inferredcites →https://doi.org/10.1007/978-3-642-28869-2_19openalex-snapshot
Fictional Separation Logic
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-642-54833-8_16openalex-snapshot
Communicating State Transition Systems for Fine-Grained Concurrent Resources
inferredcites →https://doi.org/10.1007/978-3-642-54833-8_9openalex-snapshot
Impredicative Concurrent Abstract Predicates
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-46669-8_14openalex-snapshot
Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity
inferredcites →https://doi.org/10.1016/0304-3975(91)90224-popenalex-snapshot
The existence of refinement mappings
inferredcites →https://doi.org/10.1016/c2011-0-06993-4openalex-snapshot
The Art of Multiprocessor Programming
inferredcites →https://doi.org/10.1016/j.jlamp.2016.11.006openalex-snapshot
From probability monads to commutative effectuses
inferredcites →https://doi.org/10.1016/j.tcs.2003.11.020openalex-snapshot
Possible worlds and resources: the semantics of BI
inferredcites →https://doi.org/10.1017/cbo9781107256552openalex-snapshot
Program Logics for Certified Compilers
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.1108/03684920810907904openalex-snapshot
The Art of Multiprocessor Programming
inferredcites →https://doi.org/10.1109/lics.2007.30openalex-snapshot
Local Action and Abstract Separation Logic
inferredcites →https://doi.org/10.1109/lics.2019.8785779openalex-snapshot
Quantum Hoare Logic with Ghost Variables
inferredcites →https://doi.org/10.1145/103727.103729openalex-snapshot
Algorithms for scalable synchronization on shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/1040305.1040327openalex-snapshot
Permission accounting in separation logic
inferredcites →https://doi.org/10.1145/1159803.1159812openalex-snapshot
Polymorphism and separation in hoare type theory
inferredcites →https://doi.org/10.1145/1706299.1706322openalex-snapshot
A theory of indirection via approximation
inferredcites →https://doi.org/10.1145/2364527.2364536openalex-snapshot
Superficially substructural types
inferredcites →https://doi.org/10.1145/2429069.2429134openalex-snapshot
Subjective auxiliary state for coarse-grained concurrency
inferredcites →https://doi.org/10.1145/2737924.2737964openalex-snapshot
Mechanized verification of fine-grained concurrent programs
inferredcites →https://doi.org/10.1145/2983990.2983999openalex-snapshot
Hoare-style specifications as correctness conditions for non-linearizable concurrent objects
inferredcites →https://doi.org/10.1145/3022671.2983999openalex-snapshot
Hoare-style specifications as correctness conditions for non-linearizable concurrent objects
inferredcites →https://doi.org/10.1145/3290347openalex-snapshot
Quantitative separation logic: a logic for reasoning about probabilistic pointer programs
inferredcites →https://doi.org/10.1145/3290351openalex-snapshot
Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization
inferredcites →https://doi.org/10.1145/3290377openalex-snapshot
A separation logic for concurrent randomized programs
inferredcites →https://doi.org/10.1145/3290378openalex-snapshot
Iron: managing obligations in higher-order concurrent separation logic
inferredcites →https://doi.org/10.1145/3360587openalex-snapshot
Specifying concurrent programs in separation logic: morphisms and simulations
inferredcites →https://doi.org/10.1145/3371074openalex-snapshot
Actris: session-type based reasoning in separation logic
inferredcites →https://doi.org/10.1145/3371089openalex-snapshot
Relational proofs for quantum programs
inferredcites →https://doi.org/10.1145/3371113openalex-snapshot
The future is ours: prophecy variables in separation logic
inferredcites →https://doi.org/10.1145/3409003openalex-snapshot
SteelCore: an extensible concurrent separation logic for effectful dependently typed programs
inferredcites →https://doi.org/10.1145/361082.361093openalex-snapshot
A new solution of Dijkstra's concurrent programming problem
inferredcites →https://doi.org/10.1145/362759.362813openalex-snapshot
Concurrent control with “readers” and “writers”
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.1163/ej.9789004169920.i-344.53openalex-snapshot
Chapter Eleven. The Holy Trinity
inferredcites →https://doi.org/10.4204/eptcs.195.9openalex-snapshot
Total and Partial Computation in Categorical Quantum Foundations
inferredcites →https://doi.org/10.4230/lipics.csl.2023.18openalex-snapshot
A Type Theory for Probabilistic and Bayesian Reasoning
inferredcites →https://doi.org/10.4230/lipics.ecoop.2017.8openalex-snapshot
Concurrent Data Structures Linked in Time
inferredcites →https://doi.org/10.5555/1883978.1884012openalex-snapshot
Concurrent abstract predicates
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-031-10769-6_40openalex-snapshot
Decision Problems in a Logic for Reasoning About Reconfigurable Distributed Systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.10.022openalex-snapshot
Verification of component-based systems with recursive architectures
inferred← citeshttps://doi.org/10.1145/3563293openalex-snapshot
Local Reasoning about Parameterized Reconfigurable Distributed Systems
inferred← citeshttps://doi.org/10.1145/3571229openalex-snapshot
Higher-Order Leak and Deadlock Free Locks
inferred← citeshttps://doi.org/10.1145/3747510openalex-snapshot
Verifying Graph Algorithms in Separation Logic: A Case for an Algebraic Approach
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.