On the public citation graph

Outcome Separation Logic: Local Reasoning for Correctness and Incorrectness with Computational Effects

0 signed · 64 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/11575467_5openalex-snapshot
Symbolic Execution with Separation Logic
inferredcites →https://doi.org/10.1007/3-540-44802-0_1openalex-snapshot
Local Reasoning about Programs that Alter Data Structures
inferredcites →https://doi.org/10.1007/3-540-45306-7_10openalex-snapshot
Interprocedural Shape Analysis for Recursive Programs
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-3-030-53291-8_14openalex-snapshot
Local Reasoning About the Presence of Bugs: Incorrectness Separation Logic
inferredcites →https://doi.org/10.1007/978-3-319-17524-9_1openalex-snapshot
Moving Fast with Software Verification
inferredcites →https://doi.org/10.1007/978-3-540-30538-5_9openalex-snapshot
A Decidable Fragment of Separation Logic
inferredcites →https://doi.org/10.1007/978-3-540-70583-3_29openalex-snapshot
A Simple Model of Separation Logic for Higher-Order Store
inferredcites →https://doi.org/10.1007/978-3-540-71389-0_8openalex-snapshot
Relational Parametricity and Separation Logic
inferredcites →https://doi.org/10.1007/978-3-540-73368-3_22openalex-snapshot
Shape Analysis for Composite Data Structures
inferredcites →https://doi.org/10.1007/978-3-642-54830-7_28openalex-snapshot
A Coalgebraic Approach to Linear-Time Logics
inferredcites →https://doi.org/10.1007/978-3-662-48899-7_27openalex-snapshot
Relational Reasoning via Probabilistic Coupling
inferredcites →https://doi.org/10.1007/bfb0092872openalex-snapshot
A categorical approach to probability theory
inferredcites →https://doi.org/10.1016/0890-5401(91)90052-4openalex-snapshot
Notions of computation and monads
inferredcites →https://doi.org/10.1016/j.jlamp.2015.08.002openalex-snapshot
Relation lifting, a survey
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.035openalex-snapshot
Resources, concurrency, and local reasoning
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/lics.2007.30openalex-snapshot
Local Action and Abstract Separation Logic
inferredcites →https://doi.org/10.1109/lics52264.2021.9470608openalex-snapshot
A Logic for Locally Complete Abstract Interpretations
inferredcites →https://doi.org/10.1109/lics52264.2021.9470712openalex-snapshot
A Bunched Logic for Conditional Independence
inferredcites →https://doi.org/10.1109/sefm.2009.33openalex-snapshot
Completeness of Pointer Program Verification by Separation Logic
inferredcites →https://doi.org/10.1145/1480881.1480917openalex-snapshot
Compositional shape analysis by means of bi-abduction
inferredcites →https://doi.org/10.1145/199448.199528openalex-snapshot
Monad transformers and modular interpreters
inferredcites →https://doi.org/10.1145/2049697.2049700openalex-snapshot
Compositional Shape Analysis by Means of Bi-Abduction
inferredcites →https://doi.org/10.1145/229542.229547openalex-snapshot
Probabilistic predicate transformers
inferredcites →https://doi.org/10.1145/2429069.2429094openalex-snapshot
Meta-theory à la carte
inferredcites →https://doi.org/10.1145/2500365.2500587openalex-snapshot
Modular monadic meta-theory
inferredcites →https://doi.org/10.1145/2676726.2676980openalex-snapshot
Iris
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/3290377openalex-snapshot
A separation logic for concurrent randomized programs
inferredcites →https://doi.org/10.1145/3338112openalex-snapshot
Scaling static analyses at Facebook
inferredcites →https://doi.org/10.1145/3371078openalex-snapshot
Incorrectness logic
inferredcites →https://doi.org/10.1145/3371123openalex-snapshot
A probabilistic separation logic
inferredcites →https://doi.org/10.1145/3385412.3386014openalex-snapshot
Gillian, part i: a multi-language platform for symbolic execution
inferredcites →https://doi.org/10.1145/3498695openalex-snapshot
Concurrent incorrectness separation logic
inferredcites →https://doi.org/10.1145/3498719openalex-snapshot
A separation logic for negative dependence
inferredcites →https://doi.org/10.1145/3527310openalex-snapshot
Weighted programming: a programming paradigm for specifying mathematical models
inferredcites →https://doi.org/10.1145/3527325openalex-snapshot
Finding real bugs in big programs with incorrectness logic
inferredcites →https://doi.org/10.1145/3582267openalex-snapshot
A Correctness and Incorrectness Program Logic
inferredcites →https://doi.org/10.1145/3586045openalex-snapshot
Outcome Logic: A Unifying Foundation for Correctness and Incorrectness Reasoning
inferredcites →https://doi.org/10.1145/360933.360975openalex-snapshot
Guarded commands, nondeterminacy and formal derivation of programs
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/3649821openalex-snapshot
Outcome Separation Logic: Local Reasoning for Correctness and Incorrectness with Computational Effects
inferredcites →https://doi.org/10.1145/3656437openalex-snapshot
Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.18154/rwth-2022-08746openalex-snapshot
Towards Concurrent Quantitative Separation Logic
inferredcites →https://doi.org/10.4204/eptcs.126.2openalex-snapshot
From Branching to Linear Time, Coalgebraically
inferredcites →https://doi.org/10.4230/lipics.ecoop.2023.19openalex-snapshot
Exact Separation Logic (Extended Version)

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-91121-7_10openalex-snapshot
Compositional Shape Analysis with Shared Abduction and Biabductive Loop Acceleration
inferred← citeshttps://doi.org/10.1007/978-981-97-8943-6_13openalex-snapshot
Relative Completeness of Incorrectness Separation Logic
inferred← citeshttps://doi.org/10.1016/j.jlamp.2026.101187openalex-snapshot
Compositional backward shape analysis by means of bi-abduction
inferred← citeshttps://doi.org/10.1145/3689491.3691814openalex-snapshot
Unified Analysis Techniques for Programs with Outcomes
inferred← citeshttps://doi.org/10.1145/3689720openalex-snapshot
Non-termination Proving at Scale
inferred← citeshttps://doi.org/10.1145/3689740openalex-snapshot
Quantitative Weakest Hyper Pre: Unifying Correctness and Incorrectness Hyperproperties via Predicate Transformers
inferred← citeshttps://doi.org/10.1145/3704850openalex-snapshot
On Extending Incorrectness Logic with Backwards Reasoning
inferred← citeshttps://doi.org/10.1145/3704855openalex-snapshot
A Demonic Outcome Logic for Randomized Nondeterminism
inferred← citeshttps://doi.org/10.1145/3720486openalex-snapshot
Revealing Sources of (Memory) Errors via Backward Analysis
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/3776719openalex-snapshot
Foundational Multi-Modal Program Verifiers
inferred← citeshttps://doi.org/10.1145/3808328openalex-snapshot
Hyper Separation Logic
inferred← citeshttps://doi.org/10.1145/3839520openalex-snapshot
Infinitary Relational Logic
inferred← citeshttps://doi.org/10.2139/ssrn.7519211openalex-snapshot
Local Reasoning about Probabilistic Programs with Unbounded Loops
showing the first 15 of 16 · page through all 16
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.