Please use this identifier to cite or link to this item:
|Title:||A fast algorithm to compute heap memory bounds of Java Card applets||Authors:||Pham, T.-H.
|Issue Date:||2008||Citation:||Pham, T.-H., Truong, A.-H., Truong, N.-T., Chin, W.-N. (2008). A fast algorithm to compute heap memory bounds of Java Card applets. Proceedings - 6th IEEE International Conference on Software Engineering and Formal Methods, SEFM 2008 : 259-267. ScholarBank@NUS Repository. https://doi.org/10.1109/SEFM.2008.30||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.||Source Title:||Proceedings - 6th IEEE International Conference on Software Engineering and Formal Methods, SEFM 2008||URI:||http://scholarbank.nus.edu.sg/handle/10635/42213||ISBN:||9780769534374||DOI:||10.1109/SEFM.2008.30|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.