2008 Sixth IEEE International Conference on Software Engineering and Formal Methods 2008
DOI: 10.1109/sefm.2008.30
|View full text |Cite
|
Sign up to set email alerts
|

A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets

Abstract: We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then collapses cycles of the CFG to produce a directed acyclic graph (DAG). Based on the DAG, we propose a linear-time algorithm to solve the problem of finding the single-source largest path in it. We also have implemented a prototype tool, tested it on several sample applications, and then compared the bounds found by our tool with the actu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2008
2008
2017
2017

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…Second, provide flexible judgment method and decision module can use a single element to make the decision, can also use the combination of elements to make the decision. It depends on the use of smart card specific environment and security access level [15].…”
Section: A Advantage Of Feature Setmentioning
confidence: 99%
“…Second, provide flexible judgment method and decision module can use a single element to make the decision, can also use the combination of elements to make the decision. It depends on the use of smart card specific environment and security access level [15].…”
Section: A Advantage Of Feature Setmentioning
confidence: 99%