On the public citation graph
Memory Usage Verification for OO Programs
0 signed · 68 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.1006/inco.1996.2613openalex-snapshot
Region-Based Memory Management
inferredcites →https://doi.org/10.1007/11949374openalex-snapshot
Software engineering education in the modern age : Software Education and Training Sessions at the International Conference on Software Engineering, ICSE 2005, St. Louis, MO, USA, May 15-21, 2005 : revised lectures
inferredcites →https://doi.org/10.1007/3-540-45337-7openalex-snapshot
ECOOP 2001 — Object-Oriented Programming
inferredcites →https://doi.org/10.1023/b:jars.0000021014.79255.33openalex-snapshot
Heap-Bounded Assembly Language
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/icse.1998.671113openalex-snapshot
Promises: limited specifications for analysis and manipulation
inferredcites →https://doi.org/10.1109/icse.2005.1553561openalex-snapshot
Verifying safety policies with size properties and alias controls
inferredcites →https://doi.org/10.1145/135226.135233openalex-snapshot
A practical algorithm for exact array dependence analysis
inferredcites →https://doi.org/10.1145/209936.209941openalex-snapshot
Software caching and computation migration in Olden
inferredcites →https://doi.org/10.1145/277650.277732openalex-snapshot
Eliminating array bound checking through dependent types
inferredcites →https://doi.org/10.1145/317636.317785openalex-snapshot
Recursion and dynamic data-structures in bounded space
inferredcites →https://doi.org/10.1145/582419.582421openalex-snapshot
Reconsidering custom memory allocation
inferredcites →https://doi.org/10.1145/582419.582448openalex-snapshot
Alias annotations for program understanding
inferredcites →https://doi.org/10.1145/604131.604148openalex-snapshot
Static prediction of heap space usage for first-order functional programs
inferredcites →https://doi.org/10.1145/949305.949332openalex-snapshot
Declaring and checking non-null types in an object-oriented language
inferredcites →https://doi.org/10.1145/949331.949332openalex-snapshot
Declaring and checking non-null types in an object-oriented language
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.1656openalex-snapshot
Quantitative dynamic‐memory analysis for Java
inferred← citeshttps://doi.org/10.1007/11693024_3openalex-snapshot
Type-Based Amortised Heap-Space Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-28034-9_21openalex-snapshot
A Type System for Counting Logs of Multi-threaded Nested Transactional Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-46750-4_6openalex-snapshot
Calculating Statically Maximum Log Memory Used by Multi-threaded Transactional Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-00590-9_14openalex-snapshot
Amortised Memory Analysis Using the Depth of Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-02444-3_12openalex-snapshot
A Type System for Usage of Software Components
inferred← citeshttps://doi.org/10.1007/978-3-642-04761-9_14openalex-snapshot
Memory Usage Verification Using Hip/Sleek
inferred← citeshttps://doi.org/10.1007/978-3-642-10672-9_21openalex-snapshot
Asymptotic Resource Usage Bounds
inferred← citeshttps://doi.org/10.1007/978-3-642-11957-6_6openalex-snapshot
Amortised Resource Analysis with Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-37036-6_32openalex-snapshot
Automatic Type Inference for Amortised Heap-Space Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-40561-7_15openalex-snapshot
Compositional Static Analysis for Implicit Join Synchronization in a Transactional Setting
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.065openalex-snapshot
Proving Resource Consumption of Low-level Programs Using Automated Theorem Provers
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.11.003openalex-snapshot
Static Resource Analysis for Java Bytecode Using Amortisation and Separation Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.11.006openalex-snapshot
Complete and Platform-Independent Calling Context Profiling for the Java Virtual Machine
inferred← citeshttps://doi.org/10.1016/j.scico.2012.10.008openalex-snapshot
Heap space analysis for garbage collected languages
inferred← citeshttps://doi.org/10.1016/j.scico.2017.06.010openalex-snapshot
State-taint analysis for detecting resource bugs
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.07.032openalex-snapshot
A type system for counting instances of software components
inferred← citeshttps://doi.org/10.1109/apsec.2008.72openalex-snapshot
A Heap Model for Java Bytecode to Support Separation Logic
inferred← citeshttps://doi.org/10.1109/hpcc.2011.42openalex-snapshot
A Framework for Automated Learning of Application Memory Usage Behaviour
inferred← citeshttps://doi.org/10.1109/icsamos.2007.4285742openalex-snapshot
The Weight-Watcher Service and its Lightweight Implementation
inferred← citeshttps://doi.org/10.1109/sefm.2008.30openalex-snapshot
A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets
inferred← citeshttps://doi.org/10.1109/tase.2010.24openalex-snapshot
Stack Bound Inference for Abstract Java Bytecode
inferred← citeshttps://doi.org/10.1109/tase.2016.17openalex-snapshot
State-Taint Analysis for Detecting Resource Bugs
inferred← citeshttps://doi.org/10.1109/tvlsi.2008.2002049openalex-snapshot
Symbolic Polynomial Maximization Over Convex Sets and Its Application to Memory Requirement Estimation
inferred← citeshttps://doi.org/10.1145/1296907.1296922openalex-snapshot
Heap space analysis for java bytecode
inferred← citeshttps://doi.org/10.1145/1375634.1375655openalex-snapshot
Parametric prediction of heap memory requirements
inferred← citeshttps://doi.org/10.1145/1375634.1375656openalex-snapshot
Analysing memory resource bounds for low-level programs
inferred← citeshttps://doi.org/10.1145/1542431.1542450openalex-snapshot
Live heap space analysis for languages with garbage collection
inferred← citeshttps://doi.org/10.1145/1542431.1542451openalex-snapshot
Parametric heap usage analysis for functional programs
inferred← citeshttps://doi.org/10.1145/1620405.1620426openalex-snapshot
On transforming Java-like programs into memory-predictable code
inferred← citeshttps://doi.org/10.1145/1806651.1806671openalex-snapshot
Parametric inference of memory requirements for garbage collected languages
inferred← citeshttps://doi.org/10.1145/1837855.1806671openalex-snapshot
Parametric inference of memory requirements for garbage collected languages
inferred← citeshttps://doi.org/10.1145/2078861.2078863openalex-snapshot
Making the common case the only case with anticipatory memory allocation
inferred← citeshttps://doi.org/10.1145/2350716.2350722openalex-snapshot
A type system for finding upper resource bounds of multi-threaded programs with nested transactions
inferred← citeshttps://doi.org/10.1145/2790449.2790524openalex-snapshot
Static analysis of cloud elasticity
inferred← citeshttps://doi.org/10.1145/3125374.3125382openalex-snapshot
Towards a Green Ranking for Programming Languages
inferred← citeshttps://doi.org/10.1145/3155133.3155183openalex-snapshot
A Compositional Type Systems for Finding Log Memory Bounds of Transactional Programs
inferred← citeshttps://doi.org/10.1145/3498672openalex-snapshot
A separation logic for heap space under garbage collection
inferred← citeshttps://doi.org/10.1145/3571218openalex-snapshot
A High-Level Separation Logic for Heap Space under Garbage Collection (Extended Version)
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.2168/lmcs-7(2:17)2011openalex-snapshot
Amortised Resource Analysis with Separation Logic
inferred← citeshttps://doi.org/10.2298/csis110302054lopenalex-snapshot
Quantitative analysis for symbolic heap bounds of CPS software
inferred← citeshttps://doi.org/10.4204/eptcs.139.1openalex-snapshot
On Verifying Resource Contracts using Code Contracts
inferred← citeshttps://doi.org/10.5282/edoc.14983openalex-snapshot
Amortised resource analysis for object-oriented programs
inferred← citeshttps://doi.org/10.5381/jot.2006.5.5.a2openalex-snapshot
A Static Analysis for Synthesizing Parametric Specifications of Dynamic Memory Consumption.
inferred← citeshttps://doi.org/10.5445/ir/1000014087openalex-snapshot
Deductive Verification of Safety-Critical Java Programs
inferred← citeshttps://doi.org/10.5555/1960475.1960492openalex-snapshot
Making the common case the only case with anticipatory memory allocation
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.