On the public citation graph
A separation logic for concurrent randomized programs
0 signed · 82 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-89884-1_8openalex-snapshot
Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda Calculus
inferredcites →https://doi.org/10.1007/978-3-540-71316-6_13openalex-snapshot
On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning
inferredcites →https://doi.org/10.1007/978-3-540-74407-8_18openalex-snapshot
A Marriage of Rely/Guarantee and Separation Logic
inferredcites →https://doi.org/10.1007/978-3-642-02444-3_16openalex-snapshot
A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq
inferredcites →https://doi.org/10.1007/978-3-642-03359-9_30openalex-snapshot
A Hoare Logic for the State Monad
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-15375-4_27openalex-snapshot
Reasoning about Optimistic Concurrency Using a Program Logic for History
inferredcites →https://doi.org/10.1007/978-3-642-31113-0_1openalex-snapshot
Probabilistic Relational Hoare Logics for Computer-Aided Security Proofs
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-662-44202-9_9openalex-snapshot
TaDA: A Logic for Time and Data Abstraction
inferredcites →https://doi.org/10.1007/978-3-662-46666-7_4openalex-snapshot
The Foundational Cryptography Framework
inferredcites →https://doi.org/10.1007/978-3-662-46678-0_18openalex-snapshot
Step-Indexed Logical Relations for Probability
inferredcites →https://doi.org/10.1007/978-3-662-48899-7_27openalex-snapshot
Relational Reasoning via Probabilistic Coupling
inferredcites →https://doi.org/10.1007/978-3-662-49498-1_15openalex-snapshot
Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_26openalex-snapshot
The Essence of Higher-Order Concurrent Separation Logic
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.1007/bf01934993openalex-snapshot
Approximate counting: A detailed analysis
inferredcites →https://doi.org/10.1016/0022-0000(81)90036-2openalex-snapshot
Semantics of probabilistic programs
inferredcites →https://doi.org/10.1016/j.entcs.2005.12.113openalex-snapshot
On Combining Probability and Nondeterminism
inferredcites →https://doi.org/10.1016/j.entcs.2009.01.002openalex-snapshot
Semantic Domains for Combining Probability and Non-Determinism
inferredcites →https://doi.org/10.1016/j.jlamp.2014.09.003openalex-snapshot
Full abstraction for non-deterministic and probabilistic extensions of PCF I: The angelic cases
inferredcites →https://doi.org/10.1016/j.scico.2007.09.002openalex-snapshot
Proofs of randomized algorithms in Coq
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.035openalex-snapshot
Resources, concurrency, and local reasoning
inferredcites →https://doi.org/10.1016/j.tcs.2016.01.016openalex-snapshot
Probabilistic rely-guarantee calculus
inferredcites →https://doi.org/10.1017/s0956796808006953openalex-snapshot
Hoare type theory, polymorphism and separation
inferredcites →https://doi.org/10.1017/s0960129505005074openalex-snapshot
Distributing probability over non-determinism
inferredcites →https://doi.org/10.1145/1480881.1480922openalex-snapshot
Local rely-guarantee reasoning
inferredcites →https://doi.org/10.1145/1993636.1993687openalex-snapshot
Linearizable implementations do not suffice for randomized distributed computation
inferredcites →https://doi.org/10.1145/229542.229547openalex-snapshot
Probabilistic predicate transformers
inferredcites →https://doi.org/10.1145/2500365.2500600openalex-snapshot
Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency
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/3009837.3009877openalex-snapshot
A relational model of types-and-effects in higher-order concurrent separation logic
inferredcites →https://doi.org/10.1145/3009837.3009896openalex-snapshot
Coupling proofs are probabilistic product programs
inferredcites →https://doi.org/10.1145/359619.359627openalex-snapshot
Counting large numbers of events in small registers
inferredcites →https://doi.org/10.1145/360933.360975openalex-snapshot
Guarded commands, nondeterminacy and formal derivation of programs
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.1145/78973.78977openalex-snapshot
Skip lists: a probabilistic alternative to balanced trees
inferredcites →https://doi.org/10.1145/964001.964003openalex-snapshot
Simple relational correctness proofs for static analyses and program transformations
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-59152-6_2openalex-snapshot
Verified Textbook Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-99336-8_3openalex-snapshot
Foundations for Entailment Checking in Quantitative Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-50521-8_8openalex-snapshot
Local Reasoning About Probabilistic Behaviour for Classical–Quantum Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-91118-7_13openalex-snapshot
A Program Logic for Concurrent Randomized Programs in the Oblivious Adversary Model
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.12.018openalex-snapshot
An adaptation-complete proof system for local reasoning about cloud storage systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.09.015openalex-snapshot
Reasoning about block-based cloud storage systems via separation logic
inferred← citeshttps://doi.org/10.1017/s0956796821000137openalex-snapshot
A trustful monad for axiomatic reasoning with probability and nondeterminism
inferred← citeshttps://doi.org/10.1109/csf61375.2024.00041openalex-snapshot
Probability from Possibility: Probabilistic Confidentiality for Storage Systems Under Nondeterminism
inferred← citeshttps://doi.org/10.1145/3290347openalex-snapshot
Quantitative separation logic: a logic for reasoning about probabilistic pointer programs
inferred← citeshttps://doi.org/10.1145/3408992openalex-snapshot
Raising expectations: automating expected cost analysis with types
inferred← citeshttps://doi.org/10.1145/3434286openalex-snapshot
On algebraic abstractions for concurrent separation logics
inferred← citeshttps://doi.org/10.1145/3437992.3439927openalex-snapshot
CertRL: formalizing convergence proofs for value and policy iteration in Coq
inferred← citeshttps://doi.org/10.1145/3473598openalex-snapshot
Higher-order probabilistic adversarial computations: categorical semantics and program logics
inferred← citeshttps://doi.org/10.1145/3498719openalex-snapshot
A separation logic for negative dependence
inferred← citeshttps://doi.org/10.1145/3571195openalex-snapshot
Step-Indexed Logical Relations for Countable Nondeterminism and Probabilistic Choice
inferred← citeshttps://doi.org/10.1145/3571259openalex-snapshot
Probabilistic Resource-Aware Session Types
inferred← citeshttps://doi.org/10.1145/3573105.3575675openalex-snapshot
A Formalization of Doob’s Martingale Convergence Theorems in mathlib
inferred← citeshttps://doi.org/10.1145/3576915.3623105openalex-snapshot
A Generic Methodology for the Modular Verification of Security Protocol Implementations
inferred← citeshttps://doi.org/10.1145/3586045openalex-snapshot
Outcome Logic: A Unifying Foundation for Correctness and Incorrectness Reasoning
inferred← citeshttps://doi.org/10.1145/3591226openalex-snapshot
Lilac: A Modal Separation Logic for Conditional Probability
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/3632868openalex-snapshot
Asynchronous Probabilistic Couplings in Higher-Order Separation Logic
inferred← citeshttps://doi.org/10.1145/3649821openalex-snapshot
Outcome Separation Logic: Local Reasoning for Correctness and Incorrectness with Computational Effects
inferred← citeshttps://doi.org/10.1145/3649839openalex-snapshot
Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security Proofs
inferred← citeshttps://doi.org/10.1145/3674632openalex-snapshot
Almost-Sure Termination by Guarded Refinement
inferred← citeshttps://doi.org/10.1145/3674635openalex-snapshot
Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3689491.3691814openalex-snapshot
Unified Analysis Techniques for Programs with Outcomes
inferred← citeshttps://doi.org/10.1145/3689753openalex-snapshot
Tachis: Higher-Order Separation Logic with Credits for Expected Costs
inferred← citeshttps://doi.org/10.1145/3704855openalex-snapshot
A Demonic Outcome Logic for Randomized Nondeterminism
inferred← citeshttps://doi.org/10.1145/3704876openalex-snapshot
A Quantitative Probabilistic Relational Hoare Logic
inferred← citeshttps://doi.org/10.1145/3704894openalex-snapshot
Bluebell: An Alliance of Relational Lifting and Independence for Probabilistic Reasoning
inferred← citeshttps://doi.org/10.1145/3747514openalex-snapshot
Modular Reasoning about Error Bounds for Concurrent Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3776651openalex-snapshot
Probabilistic Concurrent Reasoning in Outcome Logic: Independence, Conditioning, and Invariants
inferred← citeshttps://doi.org/10.1145/3776696openalex-snapshot
Bayesian Separation Logic: A Logical Foundation and Axiomatic Semantics for Probabilistic Programming
inferred← citeshttps://doi.org/10.1145/3808265openalex-snapshot
Contextual Refinement of Higher-Order Concurrent Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3808321openalex-snapshot
GradInf: Gradient Estimation as Probabilistic Inference
inferred← citeshttps://doi.org/10.1145/3830439.3831276openalex-snapshot
A Cost-Aware Probability Monad for Liquid Haskell
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.