| dc.contributor.author |
Pham, T.H. |
|
| dc.contributor.author |
Truong, A.H. |
|
| dc.contributor.author |
Truong, N.T. |
|
| dc.contributor.author |
Chin, W.N. |
|
| dc.date.accessioned |
2011-05-05T02:54:20Z |
|
| dc.date.available |
2011-05-05T02:54:20Z |
|
| dc.date.issued |
2008 |
|
| dc.identifier.citation |
Page : 259-267 |
vi |
| dc.identifier.isbn |
9.78E+12 |
|
| dc.identifier.uri |
http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/6573 |
|
| dc.description.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 actual
heap bounds of the programs. The experiment shows that our tool returns good estimation of heap bounds,
runs fast, and has a small memory footprint. ?? 2008 IEEE. |
vi |
| dc.language.iso |
en |
vi |
| dc.publisher |
Proceedings - 6th IEEE International Conference on Software Engineering and Formal Methods, SEFM 2008 |
vi |
| dc.subject |
Computer programming languages |
vi |
| dc.subject |
Computer software |
vi |
| dc.subject |
Clustering algorithms |
vi |
| dc.subject |
Java programming language |
vi |
| dc.subject |
Software engineering |
vi |
| dc.subject |
Directed Acyclic graphs |
vi |
| dc.subject |
Control Flow graphs |
vi |
| dc.subject |
Applets |
vi |
| dc.subject |
Fast algorithms |
vi |
| dc.subject |
Prototype tools |
vi |
| dc.title |
A fast algorithm to compute heap memory bounds of Java Card applets |
vi |
| dc.type |
Article |
vi |