On the public citation graph

A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions

0 signed · 25 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-3-030-45190-5openalex-snapshot
Tools and Algorithms for the Construction and Analysis of Systems
inferredcites →https://doi.org/10.1007/978-3-319-48989-6_40openalex-snapshot
Automated Mutual Explicit Induction Proof in Separation Logic
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-662-53622-3_7openalex-snapshot
Extremal Graph Theory
inferredcites →https://doi.org/10.1007/s10009-015-0372-3openalex-snapshot
Witnessing the elimination of magic wands
inferredcites →https://doi.org/10.1016/j.ic.2011.12.003openalex-snapshot
On the almighty wand
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.1017/s0956796818000151openalex-snapshot
Iris from the ground up: A modular foundation for higher-order concurrent separation logic
inferredcites →https://doi.org/10.1145/2049697.2049700openalex-snapshot
Compositional Shape Analysis by Means of Bi-Abduction
inferredcites →https://doi.org/10.1145/3158097openalex-snapshot
Automated lemma synthesis in symbolic-heap separation logic
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/3380809openalex-snapshot
The Bernays-Schönfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates
inferredcites →https://doi.org/10.18154/rwth-2020-00940openalex-snapshot
Automated reasoning and randomization in separation logic
inferredcites →https://doi.org/10.2140/pjm.1979.82.43openalex-snapshot
Constructive versions of Tarski’s fixed point theorems
inferredcites →https://doi.org/10.29007/f5whopenalex-snapshot
Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard

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-57246-3_11openalex-snapshot
Deciding Boolean Separation Logic via Small Models
inferred← citeshttps://doi.org/10.1007/978-3-031-62687-6_11openalex-snapshot
An EXPTIME-Complete Entailment Problem in Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-63501-4_9openalex-snapshot
What Is Decidable in Separation Logic Beyond Progress, Connectivity and Establishment?
inferred← citeshttps://doi.org/10.1007/978-3-032-04167-8_5openalex-snapshot
Deciding Satisfiability for Overlaid Symbolic Heaps
inferred← citeshttps://doi.org/10.1007/978-3-032-32592-1_3openalex-snapshot
A Superposition Calculus for Separation Logic
inferred← citeshttps://doi.org/10.1007/s10817-025-09728-7openalex-snapshot
A Direct Procedure to Test Entailment in a Separation Logic of Relations
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114854openalex-snapshot
Restriction on cut rule in cyclic-proof system for symbolic heaps
inferred← citeshttps://doi.org/10.1093/logcom/exag008openalex-snapshot
An EXPTIME-complete entailment problem in separation logic
inferred← citeshttps://doi.org/10.29007/8l13openalex-snapshot
Tree-Verifiable Graph Grammars
inferred← citeshttps://doi.org/10.46298/fi.11318openalex-snapshot
Tractable and Intractable Entailment Problems in Separation Logic with Inductively Defined Predicates
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.