On the public citation graph

Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard

0 signed · 24 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-17465-1_18openalex-snapshot
Effective Entailment Checking for Separation Logic with Inductive Definitions
inferredcites →https://doi.org/10.1007/978-3-319-11936-6_15openalex-snapshot
Deciding Entailments in Inductive Separation Logic with Tree Automata
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-642-22110-1_15openalex-snapshot
SLAyer: Memory Safety for Systems-Level Code
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_29openalex-snapshot
Predator: A Practical Tool for Checking Manipulation of Dynamic Data Structures Using Separation Logic
inferredcites →https://doi.org/10.1007/978-3-642-38574-2_2openalex-snapshot
The Tree Width of Separation Logic with Recursive Definitions
inferredcites →https://doi.org/10.1007/978-3-642-54830-7_27openalex-snapshot
Foundations for Decision Problems in Separation Logic with General Inductive Predicates
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_23openalex-snapshot
Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic
inferredcites →https://doi.org/10.1109/lics.2002.1029817openalex-snapshot
Separation logic: a logic for shared mutable data structures
inferredcites →https://doi.org/10.1145/2603088.2603091openalex-snapshot
A decision procedure for satisfiability in separation logic with inductive predicates
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-79876-5_11openalex-snapshot
Unifying Decidable Entailments in Separation Logic with Inductive Definitions
inferred← citeshttps://doi.org/10.1007/978-3-030-91014-3_14openalex-snapshot
Towards Efficient Shape Analysis with Tree Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-43513-3_23openalex-snapshot
Testing the Satisfiability of Formulas in Separation Logic with Permissions
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-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.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/3563293openalex-snapshot
Local Reasoning about Parameterized Reconfigurable Distributed Systems
inferred← citeshttps://doi.org/10.29007/8l13openalex-snapshot
Tree-Verifiable Graph Grammars
inferred← citeshttps://doi.org/10.4230/lipics.csl.2021.20openalex-snapshot
Decidable Entailments in Separation Logic with Inductive Definitions: Beyond Established Systems
inferred← citeshttps://doi.org/10.46298/fi.11318openalex-snapshot
Tractable and Intractable Entailment Problems in Separation Logic with Inductively Defined Predicates
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.