On the public citation graph

Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction

https://doi.org/10.1145/2835490
0 signed · 63 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/11874683_32openalex-snapshot
On the Expressive Power of Graph Logic
inferredcites →https://doi.org/10.1007/3-540-44802-0_18openalex-snapshot
Modal Logic and the Two-Variable Fragment
inferredcites →https://doi.org/10.1007/3-540-45294-x_10openalex-snapshot
Computability and Complexity Results for a Spatial Assertion Language for Data Structures
inferredcites →https://doi.org/10.1007/3-540-61604-7_60openalex-snapshot
On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
inferredcites →https://doi.org/10.1007/978-3-319-03542-0_7openalex-snapshot
Separation Logic Modulo Theories
inferredcites →https://doi.org/10.1007/978-3-319-06686-8_10openalex-snapshot
Separation Logic with One Quantified Variable
inferredcites →https://doi.org/10.1007/978-3-319-21401-6_34openalex-snapshot
Automated Theorem Proving for Assertions in Separation Logic with All Connectives
inferredcites →https://doi.org/10.1007/978-3-319-21668-3_6openalex-snapshot
Deciding Local Theory Extensions via E-matching
inferredcites →https://doi.org/10.1007/978-3-540-30124-0_15openalex-snapshot
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
inferredcites →https://doi.org/10.1007/978-3-540-74407-8_18openalex-snapshot
A Marriage of Rely/Guarantee and Separation Logic
inferredcites →https://doi.org/10.1007/978-3-540-74407-8_7openalex-snapshot
Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
inferredcites →https://doi.org/10.1007/978-3-642-00596-1_6openalex-snapshot
Separating Graph Logic from MSO
inferredcites →https://doi.org/10.1007/978-3-642-23217-6_16openalex-snapshot
Tractable Reasoning in a Fragment of 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-39799-8_54openalex-snapshot
Automating Separation Logic Using SMT
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_55openalex-snapshot
SeLoger: A Tool for Graph-Based Reasoning in Separation Logic
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-642-54862-8_9openalex-snapshot
GRASShopper
inferredcites →https://doi.org/10.1007/978-3-642-59207-2openalex-snapshot
The Classical Decision Problem
inferredcites →https://doi.org/10.1007/978-94-009-8384-7_4openalex-snapshot
Expressive Functional Completeness in Tense Logic (Preliminary report)
inferredcites →https://doi.org/10.1007/bfb0023464openalex-snapshot
Undecidability results on two-variable logics
inferredcites →https://doi.org/10.1007/s001530050130openalex-snapshot
Undecidability results on two-variable logics
inferredcites →https://doi.org/10.1007/s10817-010-9179-9openalex-snapshot
Quantitative Separation Logic and Programs with Lists
inferredcites →https://doi.org/10.1007/s13209-009-0008-5openalex-snapshot
Informal care and labour force participation among middle-aged women in Spain
inferredcites →https://doi.org/10.1016/b978-0-12-708240-0.50013-7openalex-snapshot
Expressive Power of Query Languages**Authors addresses: Serge Abiteboul, INRIA, B.P. 105, 78153 Le Chesnay CEDEX, France (abitebou@inria.inria.fr); Victor Vianu, CSE 0114, U.C. San Diego, La Jolla, CA 92093-0114, USA (vianu@cs.ucsd.edu). Work supported in part by an INRIA-NSF cooperation grant, by…
inferredcites →https://doi.org/10.1016/j.ic.2006.10.006openalex-snapshot
Expressiveness and complexity of graph logic
inferredcites →https://doi.org/10.1016/j.ic.2011.12.003openalex-snapshot
On the almighty wand
inferredcites →https://doi.org/10.1016/s0019-9958(83)80051-5openalex-snapshot
Temporal logic can be more expressive
inferredcites →https://doi.org/10.1093/logcom/1.4.453openalex-snapshot
A Modal Logic for Chopping Intervals
inferredcites →https://doi.org/10.1093/logcom/exn066openalex-snapshot
Tableaux and Resource Graphs for 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.1142/9789814271059_0007openalex-snapshot
Reasoning about Heap Manipulating Programs using Automata Techniques
inferredcites →https://doi.org/10.1145/1516512.1516515openalex-snapshot
Two-variable logic on data trees and XML reasoning
inferredcites →https://doi.org/10.1145/2049697.2049700openalex-snapshot
Compositional Shape Analysis by Means of Bi-Abduction
inferredcites →https://doi.org/10.1145/2422085.2422091openalex-snapshot
Nondeterministic Phase Semantics and the Undecidability of Boolean BI
inferredcites →https://doi.org/10.1145/2535838.2535864openalex-snapshot
Proof search for propositional abstract separation logics via labelled sequents
inferredcites →https://doi.org/10.1145/2535838.2535871openalex-snapshot
A proof system for separation logic with magic wand
inferredcites →https://doi.org/10.1145/2542667openalex-snapshot
Undecidability of Propositional Separation Logic and Its Neighbours
inferredcites →https://doi.org/10.1145/2578855.2535864openalex-snapshot
Proof search for propositional abstract separation logics via labelled sequents
inferredcites →https://doi.org/10.1145/2578855.2535871openalex-snapshot
A proof system for separation logic with magic wand
inferredcites →https://doi.org/10.1145/2603088.2603142openalex-snapshot
Expressive completeness of separation logic with two variables and no separating conjunction
inferredcites →https://doi.org/10.1145/2632362.2632376openalex-snapshot
Satisfiability modulo abstraction for separation logic with linked lists
inferredcites →https://doi.org/10.1145/2724711openalex-snapshot
Two-Variable Separation Logic and Its Inner Circle
inferredcites →https://doi.org/10.1145/357146.357150openalex-snapshot
Ten Years of Hoare's Logic: A Survey—Part I
inferredcites →https://doi.org/10.1145/73560.73582openalex-snapshot
A temporal fixpoint calculus
inferredcites →https://doi.org/10.2168/lmcs-10(1:14)2014openalex-snapshot
A Proof of Kamp's theorem
inferredcites →https://doi.org/10.2307/421196openalex-snapshot
On the Decision Problem for Two-Variable First-Order Logic
inferredcites →https://doi.org/10.3233/978-1-60750-606-5-695openalex-snapshot
Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
inferredcites →https://doi.org/10.3233/sat190107openalex-snapshot
Report on SL-COMP 2014
inferredcites →https://doi.org/10.4230/lipics.ecoop.2015.614openalex-snapshot
Lightweight Support for Magic Wands in an Automatic Verifier
inferredcites →https://doi.org/10.48550/arxiv.cs/0410073openalex-snapshot
On Spatial Conjunction as Second-Order Logic
inferredcites →https://doi.org/10.7146/brics.v4i5.18784openalex-snapshot
First-Order Logic with Two Variables and Unary Temporal Logic

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-43513-3_22openalex-snapshot
The Logic of Separation Logic: Models and Proofs
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/978-3-319-89366-2_26openalex-snapshot
The Effects of Adding Reachability Predicates in Propositional Separation Logic
inferred← citeshttps://doi.org/10.1016/j.apal.2021.103063openalex-snapshot
Separation logic and logics with team semantics
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.1016/j.tcs.2025.115372openalex-snapshot
Expressive completeness of separation logic in block-based cloud storage systems
inferred← citeshttps://doi.org/10.1093/logcom/exz019openalex-snapshot
The power of modal separation logics
inferred← citeshttps://doi.org/10.1145/3197383openalex-snapshot
Modular Labelled Sequent Calculi for Abstract Separation Logics
inferred← citeshttps://doi.org/10.1145/3380809openalex-snapshot
The Bernays-Schönfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates
inferred← citeshttps://doi.org/10.1145/3448269openalex-snapshot
The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic
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.