On the public citation graph

A probabilistic separation logic

https://doi.org/10.1145/3371123
0 signed · 42 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-94-017-0091-7openalex-snapshot
The Semantics and Proof Theory of the Logic of Bunched Implications
inferredcites →https://doi.org/10.1016/0022-0000(85)90012-1openalex-snapshot
A probabilistic PDL
inferredcites →https://doi.org/10.1017/cbo9781107337756openalex-snapshot
Secure Multiparty Computation and Secret Sharing
inferredcites →https://doi.org/10.1145/3371118openalex-snapshot
A language for probabilistically oblivious computation
inferredcites →https://doi.org/10.1145/3371123openalex-snapshot
A probabilistic separation logic
inferredcites →https://doi.org/10.1201/b17668openalex-snapshot
Introduction to Modern Cryptography
inferredcites →https://doi.org/10.2307/421090openalex-snapshot
The Logic of Bunched Implications

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-53288-8_11openalex-snapshot
Verification of Quantitative Hyperproperties Using Trace Enumeration Relations
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-71162-6_10openalex-snapshot
Combining Classical and Probabilistic Independence Reasoning to Verify the Security of Oblivious Algorithms
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.1007/978-3-031-91121-7_11openalex-snapshot
SMT-Boosted Security Types for Low-Level MPC
inferred← citeshttps://doi.org/10.1007/978-981-96-0602-3_2openalex-snapshot
An Assertion-Based Logic for Local Reasoning about Probabilistic Programs
inferred← citeshttps://doi.org/10.1109/csf61375.2024.00040openalex-snapshot
On Separation Logic, Computational Independence, and Pseudorandomness
inferred← citeshttps://doi.org/10.1109/csf68417.2026.00033openalex-snapshot
Formal Verification of Probing Security via Conditional Independence
inferred← citeshttps://doi.org/10.1109/sp61157.2025.00181openalex-snapshot
Is MPC Secure? Leveraging Neural Network Classifiers to Detect Data Leakage Vulnerabilities in MPC Implementations
inferred← citeshttps://doi.org/10.1145/3434286openalex-snapshot
On algebraic abstractions for concurrent separation logics
inferred← citeshttps://doi.org/10.1145/3490421openalex-snapshot
Conditional Independence by Typing
inferred← citeshttps://doi.org/10.1145/3498691openalex-snapshot
Twist: sound reasoning for purity and entanglement in Quantum programs
inferred← citeshttps://doi.org/10.1145/3498719openalex-snapshot
A separation logic for negative dependence
inferred← citeshttps://doi.org/10.1145/3563768.3565547openalex-snapshot
Proving Obliviousness of Probabilistic Algorithms with Formal Verification
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/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/3656437openalex-snapshot
Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties
inferred← citeshttps://doi.org/10.1145/3656448openalex-snapshot
Compiling Probabilistic Programs for Variable Elimination with Information Flow
inferred← citeshttps://doi.org/10.1145/3661814.3662132openalex-snapshot
Equivalence and Conditional Independence in Atomic Sheaf Logic
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/3678232.3678246openalex-snapshot
Language-Based Security for Low-Level MPC
inferred← citeshttps://doi.org/10.1145/3689753openalex-snapshot
Tachis: Higher-Order Separation Logic with Credits for Expected Costs
inferred← citeshttps://doi.org/10.1145/3704877openalex-snapshot
Approximate Relational Reasoning for Higher-Order Probabilistic Programs
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/3743131openalex-snapshot
Outcome Logic: A Unified Approach to the Metatheory of Program Logics with Branching Effects
inferred← citeshttps://doi.org/10.1145/3776651openalex-snapshot
Probabilistic Concurrent Reasoning in Outcome Logic: Independence, Conditioning, and Invariants
inferred← citeshttps://doi.org/10.1145/3776730openalex-snapshot
Cryptis: Cryptographic Reasoning in Separation Logic
inferred← citeshttps://doi.org/10.2139/ssrn.7361162openalex-snapshot
Local Reasoning about Probabilistic Behaviour for Classical-Quantum Programs
inferred← citeshttps://doi.org/10.2139/ssrn.7519211openalex-snapshot
Local Reasoning about Probabilistic Programs with Unbounded Loops
inferred← citeshttps://doi.org/10.70675/0060a957z6f8ez44e2z9a5dze9b2f3193fcbopenalex-snapshot
Logiques de séparation : complexité, expressivité, calculs
showing the first 34 of 35 · page through all 35
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.