On the public citation graph

Automated lemma synthesis in symbolic-heap separation logic

https://doi.org/10.1145/3158097
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/11575467_5openalex-snapshot
Symbolic Execution with Separation Logic
inferredcites →https://doi.org/10.1007/11804192_6openalex-snapshot
Smallfoot: Modular Automatic Assertion Checking 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/978-3-319-08867-9_47openalex-snapshot
Automating Separation Logic with Trees and Data
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-12736-1_17openalex-snapshot
Compositional Entailment Checking for a Fragment of 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-319-24953-7_7openalex-snapshot
On Automated Lemma Generation for Separation Logic with Inductive Definitions
inferredcites →https://doi.org/10.1007/978-3-319-41528-4_21openalex-snapshot
Satisfiability Modulo Heap-Based Programs
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-30538-5_9openalex-snapshot
A Decidable Fragment of Separation Logic
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_39openalex-snapshot
Linear Invariant Generation Using Non-linear Constraint Solving
inferredcites →https://doi.org/10.1007/978-3-540-70545-1_34openalex-snapshot
Enhancing Program Verification with Lemmas
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
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-22438-6_12openalex-snapshot
Automated Cyclic Entailment Proofs in Separation Logic
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-662-46669-8_26openalex-snapshot
Spatial Interpolants
inferredcites →https://doi.org/10.1007/s10817-010-9179-9openalex-snapshot
Quantitative Separation Logic and Programs with Lists
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.1093/logcom/exq052openalex-snapshot
Sequent calculi for induction and infinite descent
inferredcites →https://doi.org/10.1109/fmcad.2013.6679385openalex-snapshot
Syntax-guided synthesis
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/125826.125848openalex-snapshot
The Omega test: a fast and practical integer programming algorithm for dependence analysis
inferredcites →https://doi.org/10.1145/1449764.1449782openalex-snapshot
jStar
inferredcites →https://doi.org/10.1145/1993498.1993563openalex-snapshot
Separation logic + superposition calculus = heap theorem prover
inferredcites →https://doi.org/10.1145/2491956.2462169openalex-snapshot
Natural proofs for structure, data, and separation
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.1145/2737924.2737984openalex-snapshot
Automatic induction proofs of data-structures in imperative programs
inferredcites →https://doi.org/10.1145/2837614.2837621openalex-snapshot
Model checking for symbolic-heap separation logic with inductive predicates
inferredcites →https://doi.org/10.3233/sat190107openalex-snapshot
Report on SL-COMP 2014
inferredcites →https://doi.org/10.48550/arxiv.1301.5139openalex-snapshot
The Tree Width of Separation Logic with Recursive Definitions

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-11245-5_4openalex-snapshot
Automatic Program Repair Using Formal Verification and Expression Templates
inferred← citeshttps://doi.org/10.1007/978-3-030-34175-6_19openalex-snapshot
Completeness of Cyclic Proofs for Symbolic Heaps with Inductive Definitions
inferred← citeshttps://doi.org/10.1007/978-3-030-67067-2_17openalex-snapshot
Automated Repair of Heap-Manipulating Programs Using Deductive Synthesis
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-99336-8_3openalex-snapshot
Foundations for Entailment Checking in Quantitative Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_23openalex-snapshot
An Efficient Cyclic Entailment Procedure in a Fragment of Separation Logic
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-90643-5_18openalex-snapshot
Cyclone: A Heterogeneous Tool for Verifying Infinite Descent
inferred← citeshttps://doi.org/10.1007/s00165-018-0471-5openalex-snapshot
Automated mutual induction proof in separation logic
inferred← citeshttps://doi.org/10.1007/s10009-021-00628-wopenalex-snapshot
SL-COMP: competition of solvers for separation logic
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/exad068openalex-snapshot
The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions
inferred← citeshttps://doi.org/10.11309/jssst.37.1_125openalex-snapshot
Spatial Factorization in Cyclic-Proof System for Separation Logic
inferred← citeshttps://doi.org/10.11309/jssst.37.1_39openalex-snapshot
Failure of cut-elimination in cyclic proofs of separation logic
inferred← citeshttps://doi.org/10.1145/3453483.3454036openalex-snapshot
RefinedC: automating the foundational verification of C code with refined ownership types
inferred← citeshttps://doi.org/10.1145/3453483.3454087openalex-snapshot
Cyclic program synthesis
inferred← citeshttps://doi.org/10.1145/3498725openalex-snapshot
Software model-checking as cyclic-proof search
inferred← citeshttps://doi.org/10.1145/3519939.3523432openalex-snapshot
Diaframe: automated verification of fine-grained concurrent programs in Iris
inferred← citeshttps://doi.org/10.1145/3519939.3523434openalex-snapshot
Islaris: verification of machine code against authoritative ISA semantics
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/3563354openalex-snapshot
Model-guided synthesis of inductive lemmas for FOL with least fixpoints
inferred← citeshttps://doi.org/10.1145/3622834openalex-snapshot
Equality Saturation Theory Exploration à la Carte
inferred← citeshttps://doi.org/10.1145/3632888openalex-snapshot
The Complex(ity) Landscape of Checking Infinite Descent
inferred← citeshttps://doi.org/10.1145/3644033openalex-snapshot
Proceedings of the 2024 IEEE/ACM 12th International Conference on Formal Methods in Software Engineering (FormaliSE)
inferred← citeshttps://doi.org/10.1145/3674653openalex-snapshot
CCLemma: E-Graph Guided Lemma Discovery for Inductive Equational Proofs
inferred← citeshttps://doi.org/10.1145/3704903openalex-snapshot
Generically Automating Separation Logic by Functors, Homomorphisms, and Modules
inferred← citeshttps://doi.org/10.2197/ipsjjip.33.445openalex-snapshot
Cyclic-proof Systems for Symbolic Heaps Require Cut Formulas Outside Initial Signatures
inferred← citeshttps://doi.org/10.29007/qwd8openalex-snapshot
Harrsh: A Tool for Unied Reasoning about Symbolic-Heap Separation Logic
inferred← citeshttps://doi.org/10.29007/vkmjopenalex-snapshot
Beyond Symbolic Heaps: Deciding Separation Logic With Inductive Definitions
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.