On the public citation graph

Certified Memory Usage Analysis

https://doi.org/10.1007/11526841_8
0 signed · 37 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/3-540-45309-1_20openalex-snapshot
A Formal Executable Semantics of the JavaCard Platform
inferredcites →https://doi.org/10.1007/3-540-45418-7_13openalex-snapshot
On-Card Bytecode Verification for Java Card
inferredcites →https://doi.org/10.1007/3-540-45614-7_17openalex-snapshot
Development of an Embedded Verifier for Java Card Byte Code Using Formal Methods
inferredcites →https://doi.org/10.1007/978-3-540-24725-8_27openalex-snapshot
Extracting a Data Flow Analyser in Constructive Logic
inferredcites →https://doi.org/10.1007/978-3-540-30482-1_10openalex-snapshot
Multi-prover Verification of C Programs
inferredcites →https://doi.org/10.1016/j.jlap.2003.07.003openalex-snapshot
Operational semantics of the Java Card Virtual Machine
inferredcites →https://doi.org/10.1016/j.tcs.2005.06.004openalex-snapshot
Extracting a data flow analyser in constructive logic
inferredcites →https://doi.org/10.1016/s0304-3975(02)00869-1openalex-snapshot
Verified bytecode verifiers
inferredcites →https://doi.org/10.1023/b:jars.0000021014.79255.33openalex-snapshot
Heap-Bounded Assembly Language
inferredcites →https://doi.org/10.1109/dsn.2002.1028886openalex-snapshot
Formal development of an embedded verifier for Java Card byte code
inferredcites →https://doi.org/10.1145/319301.319345openalex-snapshot
From system F to typed assembly language
inferredcites →https://doi.org/10.1145/325694.325716openalex-snapshot
Resource bound certification
inferredcites →https://doi.org/10.1145/604131.604148openalex-snapshot
Static prediction of heap space usage for first-order functional programs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470611883.ch10openalex-snapshot
Security of Downloadable Applications
inferred← citeshttps://doi.org/10.1007/11547662_7openalex-snapshot
Memory Usage Verification for OO Programs
inferred← citeshttps://doi.org/10.1007/11554578_5openalex-snapshot
Formal Methods for Smartcard Security
inferred← citeshttps://doi.org/10.1007/11924661_24openalex-snapshot
A Bytecode Logic for JML and Types
inferred← citeshttps://doi.org/10.1007/978-3-319-26529-2_21openalex-snapshot
Objects in Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-540-75336-0_2openalex-snapshot
MOBIUS: Mobility, Ubiquity, Security
inferred← citeshttps://doi.org/10.1007/978-3-540-78663-4_5openalex-snapshot
Extracting Control from Data: User Interfaces of MIDP Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-92188-2_2openalex-snapshot
Certification Using the Mobius Base Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-03829-7_8openalex-snapshot
Certified Static Analysis by Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-642-03829-7_9openalex-snapshot
Resource Usage Analysis and Its Application to Resource Certification
inferred← citeshttps://doi.org/10.1007/978-3-642-21437-0_16openalex-snapshot
Certification of Safe Polynomial Memory Bounds
inferred← citeshttps://doi.org/10.1007/978-3-642-27901-0_4openalex-snapshot
SC 2: Secure Communication over Smart Cards
inferred← citeshttps://doi.org/10.1007/s10270-008-0099-7openalex-snapshot
A UML-based quantitative framework for early prediction of resource usage and load in distributed real-time systems
inferred← citeshttps://doi.org/10.1017/s0956796806005867openalex-snapshot
A module calculus for Pure Type Systems
inferred← citeshttps://doi.org/10.1109/csc.2012.24openalex-snapshot
A Formal Model for Resource Protections in Web Service Applications
inferred← citeshttps://doi.org/10.1109/isorc.2017.4openalex-snapshot
A Dynamic Memory Management Unit for Real Time Systems
inferred← citeshttps://doi.org/10.1109/sefm.2005.34openalex-snapshot
Precise analysis of memory consumption using program logics
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.1145/1296907.1296922openalex-snapshot
Heap space analysis for java bytecode
inferred← citeshttps://doi.org/10.1145/1375634.1375656openalex-snapshot
Analysing memory resource bounds for low-level programs
inferred← citeshttps://doi.org/10.1145/1542431.1542451openalex-snapshot
Parametric heap usage analysis for functional programs
inferred← citeshttps://doi.org/10.1145/1620405.1620427openalex-snapshot
A predictable Java profile
inferred← citeshttps://doi.org/10.1145/2512989.2513000openalex-snapshot
Worst-case memory consumption analysis for SCJ
inferred← citeshttps://doi.org/10.1145/3155133.3155183openalex-snapshot
A Compositional Type Systems for Finding Log Memory Bounds of Transactional Programs
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.