On the public citation graph

Quantitative separation logic: a logic for reasoning about probabilistic pointer programs

https://doi.org/10.1145/3290347
0 signed · 92 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/3-540-45931-6_28openalex-snapshot
A Semantic Basis for Local Reasoning
inferredcites →https://doi.org/10.1007/978-0-230-37405-8_1openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1007/978-3-319-89884-1_5openalex-snapshot
An Assertion-Based Program Logic for Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-540-74061-2_6openalex-snapshot
Formalised Inductive Reasoning in the Logic of Bunched Implications
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-39799-8_34openalex-snapshot
Probabilistic Program Analysis with Martingales
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/b138392openalex-snapshot
Abstraction, Refinement and Proof for Probabilistic Systems
inferredcites →https://doi.org/10.1007/bf01211249openalex-snapshot
Proof rules for recursive procedures
inferredcites →https://doi.org/10.1007/s00450-013-0251-7openalex-snapshot
Quantitative reactive modeling and verification
inferredcites →https://doi.org/10.1007/s10817-010-9179-9openalex-snapshot
Quantitative Separation Logic and Programs with Lists
inferredcites →https://doi.org/10.1016/b978-0-12-622760-4.x5000-6openalex-snapshot
Handbook of Analysis and Its Foundations
inferredcites →https://doi.org/10.1016/j.peva.2013.11.004openalex-snapshot
Operational versus weakest pre-expectation semantics for the probabilistic guarded command language
inferredcites →https://doi.org/10.1016/j.scico.2010.07.004openalex-snapshot
Automated verification of shape, size and bag properties via user-defined predicates in separation logic
inferredcites →https://doi.org/10.1016/s0020-0190(01)00230-7openalex-snapshot
Randomized splay trees: Theoretical and experimental results
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1093/comjnl/5.1.10openalex-snapshot
Quicksort
inferredcites →https://doi.org/10.1109/lics.2002.1029817openalex-snapshot
Separation logic: a logic for shared mutable data structures
inferredcites →https://doi.org/10.1109/sfcs.1979.38openalex-snapshot
Semantics of probabilistic programs
inferredcites →https://doi.org/10.1109/sfcs.1989.63531openalex-snapshot
Randomized search trees
inferredcites →https://doi.org/10.1145/1328438.1328469openalex-snapshot
Relational inductive shape analysis
inferredcites →https://doi.org/10.1145/1328897.1328469openalex-snapshot
Relational inductive shape analysis
inferredcites →https://doi.org/10.1145/1988042.1988050openalex-snapshot
BI as an assertion language for mutable data structures
inferredcites →https://doi.org/10.1145/229542.229547openalex-snapshot
Probabilistic predicate transformers
inferredcites →https://doi.org/10.1145/274787.274812openalex-snapshot
Randomized binary search trees
inferredcites →https://doi.org/10.1145/277651.277660openalex-snapshot
Fast set operations using treaps
inferredcites →https://doi.org/10.1145/2837614.2837639openalex-snapshot
Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
inferredcites →https://doi.org/10.1145/2914770.2837639openalex-snapshot
Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
inferredcites →https://doi.org/10.1145/2933575.2935317openalex-snapshot
Reasoning about Recursive Probabilistic Programs
inferredcites →https://doi.org/10.1145/2958738openalex-snapshot
Verifying quantitative reliability for programs that execute on unreliable hardware
inferredcites →https://doi.org/10.1145/3009837.3009855openalex-snapshot
Interactive proofs in higher-order concurrent separation logic
inferredcites →https://doi.org/10.1145/3093333.3009855openalex-snapshot
Interactive proofs in higher-order concurrent separation logic
inferredcites →https://doi.org/10.1145/3158121openalex-snapshot
A new proof rule for almost-sure termination
inferredcites →https://doi.org/10.1145/3192366.3192394openalex-snapshot
Bounded expectations: resource analysis for probabilistic programs
inferredcites →https://doi.org/10.1145/3290377openalex-snapshot
A separation logic for concurrent randomized programs
inferredcites →https://doi.org/10.1145/3296979.3192394openalex-snapshot
Bounded expectations: resource analysis for probabilistic programs
inferredcites →https://doi.org/10.1145/360204.375719openalex-snapshot
BI as an assertion language for mutable data structures
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/373243.375719openalex-snapshot
BI as an assertion language for mutable data structures
inferredcites →https://doi.org/10.1145/6490.6494openalex-snapshot
Countable nondeterminism and random assignment
inferredcites →https://doi.org/10.1145/78973.78977openalex-snapshot
Skip lists: a probabilistic alternative to balanced trees
inferredcites →https://doi.org/10.1145/800061.808758openalex-snapshot
A probabilistic PDL
inferredcites →https://doi.org/10.13189/ujcmj.2013.010301openalex-snapshot
Axiomatic Basis for Computer Programming
inferredcites →https://doi.org/10.2140/pjm.1979.82.43openalex-snapshot
Constructive versions of Tarski’s fixed point theorems
inferredcites →https://doi.org/10.2168/lmcs-7(2:17)2011openalex-snapshot
Amortised Resource Analysis with Separation Logic
inferredcites →https://doi.org/10.2307/2291177openalex-snapshot
Markov Decision Processes: Discrete Stochastic Dynamic Programming.
inferredcites →https://doi.org/10.2307/2325085openalex-snapshot
Two Notes on Notation
inferredcites →https://doi.org/10.3233/978-1-58603-782-6-289openalex-snapshot
The Algebraic Interpretation of Quantifiers: Intuitionistic and Classical
inferredcites →https://doi.org/10.4324/9780203011683.axaopenalex-snapshot
Appendix A
inferredcites →https://doi.org/10.48550/arxiv.1603.02922openalex-snapshot
Reasoning about Recursive Probabilistic Programs
inferredcites →https://doi.org/10.48550/arxiv.1711.03588openalex-snapshot
A New Proof Rule for Almost-Sure Termination

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-68446-4_12openalex-snapshot
Generating Functions for Probabilistic Programs
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-13188-2_4openalex-snapshot
Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-17715-6_24openalex-snapshot
A Specification Logic for Programs in the Probabilistic Guarded Command Language
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-75783-9_11openalex-snapshot
J-P: MDP. FP. PP
inferred← citeshttps://doi.org/10.1007/978-3-031-75783-9_6openalex-snapshot
Symbolic Quantitative Information Flow for Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-90897-2_9openalex-snapshot
Quantifier Elimination and Craig Interpolation: The Quantitative Way
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.1109/lics52264.2021.9470712openalex-snapshot
A Bunched Logic for Conditional Independence
inferred← citeshttps://doi.org/10.1145/3371105openalex-snapshot
Aiming low is harder: induction for lower bounds in probabilistic program verification
inferred← citeshttps://doi.org/10.1145/3434286openalex-snapshot
On algebraic abstractions for concurrent separation logics
inferred← citeshttps://doi.org/10.1145/3434320openalex-snapshot
Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning
inferred← citeshttps://doi.org/10.1145/3434333openalex-snapshot
A pre-expectation calculus for probabilistic sensitivity
inferred← citeshttps://doi.org/10.1145/3498719openalex-snapshot
A separation logic for negative dependence
inferred← citeshttps://doi.org/10.1145/3527310openalex-snapshot
Weighted programming: a programming paradigm for specifying mathematical models
inferred← citeshttps://doi.org/10.1145/3534927openalex-snapshot
A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions
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/3579834openalex-snapshot
Omnisemantics: Smooth Handling of Nondeterminism
inferred← citeshttps://doi.org/10.1145/3586045openalex-snapshot
Outcome Logic: A Unifying Foundation for Correctness and Incorrectness Reasoning
inferred← citeshttps://doi.org/10.1145/3586051openalex-snapshot
Lower Bounds for Possibly Divergent Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3591226openalex-snapshot
Lilac: A Modal Separation Logic for Conditional Probability
inferred← citeshttps://doi.org/10.1145/3591263openalex-snapshot
Automated Expected Value Analysis of Recursive Programs
inferred← citeshttps://doi.org/10.1145/3622870openalex-snapshot
A Deductive Verification Infrastructure for Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3632868openalex-snapshot
Asynchronous Probabilistic Couplings in Higher-Order Separation Logic
inferred← citeshttps://doi.org/10.1145/3632935openalex-snapshot
Programmatic Strategy Synthesis: Resolving Nondeterminism in Probabilistic Programs
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/3674635openalex-snapshot
Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs
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/3720433openalex-snapshot
QbC: Quantum Correctness by Construction
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/3779031.3779109openalex-snapshot
Modular Specifications and Implementations of Random Samplers in Higher-Order Separation Logic
inferred← citeshttps://doi.org/10.1145/3815573openalex-snapshot
Reasoning about Parameterized Recursive Quantum Programs with Ancilla Data and Probabilistic Control
inferred← citeshttps://doi.org/10.2139/ssrn.7361162openalex-snapshot
Local Reasoning about Probabilistic Behaviour for Classical-Quantum Programs
inferred← citeshttps://doi.org/10.21941/kcss/2021/7openalex-snapshot
Tagungsband zum 21. Kolloquium Programmiersprachen und Grundlagen der Programmierung
inferred← citeshttps://doi.org/10.48550/arxiv.2107.11679openalex-snapshot
Reasoning about Recursive Quantum Programs
inferred← citeshttps://doi.org/10.70675/0060a957z6f8ez44e2z9a5dze9b2f3193fcbopenalex-snapshot
Logiques de séparation : complexité, expressivité, calculs
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.