On the public citation graph
A separation logic for heap space under garbage collection
0 signed · 59 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/cpe.1656openalex-snapshot
Quantitative dynamic‐memory analysis for Java
inferredcites →https://doi.org/10.1007/11547662_7openalex-snapshot
Memory Usage Verification for OO Programs
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-540-69738-1_18openalex-snapshot
Automated Verification of Shape and Size Properties Via Separation Logic
inferredcites →https://doi.org/10.1007/978-3-642-04027-6_24openalex-snapshot
Efficient Type-Checking for Amortised Heap-Space Analysis
inferredcites →https://doi.org/10.1007/978-3-642-04761-9_14openalex-snapshot
Memory Usage Verification Using Hip/Sleek
inferredcites →https://doi.org/10.1007/978-3-642-05089-3_23openalex-snapshot
“Carbon Credits” for Resource-Bounded Computations Using Amortised Analysis
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_10openalex-snapshot
A Discipline for Program Verification Based on Backpointers and Its Use in Observational Disjointness
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_32openalex-snapshot
Automatic Type Inference for Amortised Heap-Space Analysis
inferredcites →https://doi.org/10.1007/s10817-016-9398-9openalex-snapshot
Type-Based Cost Analysis for Lazy Functional Languages
inferredcites →https://doi.org/10.1007/s10817-018-9487-zopenalex-snapshot
A Verified Generational Garbage Collector for CakeML
inferredcites →https://doi.org/10.1016/0304-3975(92)90014-7openalex-snapshot
The revised report on the syntactic theories of sequential control and state
inferredcites →https://doi.org/10.1016/j.scico.2012.10.008openalex-snapshot
Heap space analysis for garbage collected languages
inferredcites →https://doi.org/10.1016/j.tcs.2007.09.003openalex-snapshot
A program logic for resources
inferredcites →https://doi.org/10.1016/s0890-5401(03)00009-9openalex-snapshot
Linear types and non-size-increasing polynomial time computation
inferredcites →https://doi.org/10.1016/s1571-0661(05)80286-5openalex-snapshot
Space-Profiling Semantics of the Call-by-Value Lambda Calculus and the CPS Transformation
inferredcites →https://doi.org/10.1017/s0956796810000146openalex-snapshot
Space profiling for parallel functional programs
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.1023/b:jars.0000021014.79255.33openalex-snapshot
Heap-Bounded Assembly Language
inferredcites →https://doi.org/10.1109/lics.1999.782641openalex-snapshot
Linear types and non-size-increasing polynomial time computation
inferredcites →https://doi.org/10.1109/lics.2011.46openalex-snapshot
Separation Logic in the Presence of Garbage Collection
inferredcites →https://doi.org/10.1145/1040305.1040327openalex-snapshot
Permission accounting in separation logic
inferredcites →https://doi.org/10.1145/1250734.1250788openalex-snapshot
A general framework for certifying garbage collectors and their mutators
inferredcites →https://doi.org/10.1145/1296907.1296922openalex-snapshot
Heap space analysis for java bytecode
inferredcites →https://doi.org/10.1145/1375634.1375655openalex-snapshot
Parametric prediction of heap memory requirements
inferredcites →https://doi.org/10.1145/1375634.1375656openalex-snapshot
Analysing memory resource bounds for low-level programs
inferredcites →https://doi.org/10.1145/1542431.1542450openalex-snapshot
Live heap space analysis for languages with garbage collection
inferredcites →https://doi.org/10.1145/1707801.1706327openalex-snapshot
Static determination of quantitative resource usage for higher-order programs
inferredcites →https://doi.org/10.1145/174675.177855openalex-snapshot
Implementation of the typed call-by-value λ-calculus using a stack of regions
inferredcites →https://doi.org/10.1145/1806651.1806671openalex-snapshot
Parametric inference of memory requirements for garbage collected languages
inferredcites →https://doi.org/10.1145/224164.224182openalex-snapshot
Abstract models of memory management
inferredcites →https://doi.org/10.1145/2362389.2362393openalex-snapshot
Multivariate amortized resource analysis
inferredcites →https://doi.org/10.1145/2364527.2364575openalex-snapshot
Automatic amortised analysis of dynamic memory allocation for lazy functional programs
inferredcites →https://doi.org/10.1145/2666356.2594301openalex-snapshot
End-to-end verification of stack-space bounds for C programs
inferredcites →https://doi.org/10.1145/3093333.3009842openalex-snapshot
Towards automatic resource bound analysis for OCaml
inferredcites →https://doi.org/10.1145/317636.317785openalex-snapshot
Recursion and dynamic data-structures in bounded space
inferredcites →https://doi.org/10.1145/3360597openalex-snapshot
Certifying graph-manipulating C programs via localizations within data structures
inferredcites →https://doi.org/10.1145/3408998openalex-snapshot
Separation logic for sequential programs (functional pearl)
inferredcites →https://doi.org/10.1145/3428272openalex-snapshot
Do you have space for dessert? a verified space cost semantics for CakeML programs
inferredcites →https://doi.org/10.1145/3437992.3439930openalex-snapshot
Contextual refinement of the Michael-Scott queue (proof pearl)
inferredcites →https://doi.org/10.1145/3473581openalex-snapshot
Automatic amortized resource analysis with the Quantum physicist’s method
inferredcites →https://doi.org/10.1145/3498672openalex-snapshot
A separation logic for heap space under garbage collection
inferredcites →https://doi.org/10.1145/362790.362798openalex-snapshot
A nonrecursive list compacting algorithm
inferredcites →https://doi.org/10.1145/367487.367501openalex-snapshot
A method for overlapping and erasure of lists
inferredcites →https://doi.org/10.1145/640128.604148openalex-snapshot
Static prediction of heap space usage for first-order functional programs
inferredcites →https://doi.org/10.5381/jot.2006.5.5.a2openalex-snapshot
A Static Analysis for Synthesizing Parametric Specifications of Dynamic Memory Consumption.
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-27481-7_18openalex-snapshot
A Fine-Grained Semantics for Arrays and Pointers Under Weak Memory Models
inferred← citeshttps://doi.org/10.1145/3544885.3544887openalex-snapshot
A flat reachability-based measure for CakeML’s cost semantics
inferred← citeshttps://doi.org/10.1145/3607840openalex-snapshot
FP²: Fully in-Place Functional Programming
inferred← citeshttps://doi.org/10.1145/3622827openalex-snapshot
Modular Verification of Safe Memory Reclamation in Concurrent Separation Logic
inferred← citeshttps://doi.org/10.1145/3689755openalex-snapshot
Realistic Realizability: Specifying ABIs You Can Count On
inferred← citeshttps://doi.org/10.1145/3703595.3705876openalex-snapshot
The Nextgen Modality: A Modality for Non-Frame-Preserving Updates in Separation Logic
inferred← citeshttps://doi.org/10.1145/3716312openalex-snapshot
Will It Fit? Verifying Heap Space Bounds of Concurrent Programs under Garbage Collection
inferred← citeshttps://doi.org/10.1145/3729246openalex-snapshot
Verifying General-Purpose RCU for Reclamation in Relaxed Memory Separation Logic
inferred← citeshttps://doi.org/10.1145/3729248openalex-snapshot
Verifying Lock-Free Traversals in Relaxed Memory Separation Logic
showing the first 9 of 10 · page through all 10
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.