Academic
Publications
Memory consumption analysis of Java smart cards

Memory consumption analysis of Java smart cards,Pablo Giambiagi,Gerardo Schneider

Memory consumption analysis of Java smart cards   (Citations: 5)
BibTex | RIS | RefWorks Download
Memory is a scarce resource in Java smart cards. Developers and card suppliers alike would want to make sure, at compile- or load-time, that a Java Card applet will not overflow memory when performing dynamic class instantiations. Although there are good solutions to the general problem, the challenge is still out to produce a static analyser that is certified and could execute on-card. We provide a constraint-based algorithm which determines potential loops and (mutually) recursive methods. The algorithm operates on the bytecode of an applet and is written as a set of rules associating one or more constraints to each bytecode instruction. The rules are designed so that a certified analyser could be extracted from their proof of correctness. By keeping a clear separation between the rules dealing with the inter- and intra-procedural aspects of the analysis we are able to reduce the space-complexity of a previous algorithm.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Other analyses in this category include analyses to determine worst case memory (WCMC) usage [16, 11] and maximum stack depth, both of which are instrumental for ensuring that a given program can be executed within the bounds set by the platform...

    Thomas Bøgholmet al. A predictable Java profile: rationale and implementations

    • ...To do this, some works [5], [6] propose the ideas of managing memory resources by analyzing the memory affected for each bytecode instruction that appears in compiled code, but they are not actually suitable for installing on cards...

    Tuan-Hung Phamet al. Computing heap space cost of Java Card applets

    • ...Despite these difficulties, there are already a few approaches [2, 6, 8] 1 for bytecode memory resource analy-...
    • ...Giambiagi and Schneider [6] provides a slightly different solution with a model of constraints on bytecode instructions and an algorithm to operate on that model, which is similar as a CSP model on bytecode to some extent...

    Chenguang Luoet al. A Heap Model for Java Bytecode to Support Separation Logic

    • ...Others [3, 7] propose the ideas of managing memory resources by analyzing the memory affected for each bytecode instruction in compiled code...
    • ...Giambiagi and Schneider [7] analyze memory consumption by an algorithm that finds all potential loops and (mutually) recursive methods of Java Card applets...
    • ...As mentioned in their paper [7], this algorithm works directly with bytecode streams of programs without transforming them into an additional data structure such as CFG...

    Tuan-hung Phamet al. A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets

Sort by: