University of Minnesota
Software Engineering Center
/

You are here

Computing heap space cost of Java Card applets

Date of Publication: 
July 2008
Associated Research Groups: 
Publication Files: 
Abstract: 
We introduce an approach to find upper bounds of heap space for Java Card applets. Our approach analyzes and transforms bytecodes of Java Card applets into equivalent programs in a language that already has a type system for finding the sharp upper bounds of resource use. We then point out a linear-time algorithm to compute the maximum heap units that may be allocated during the lifetime of Java Card applets. We also have implemented a prototype tool and tested it on several examples and the results are good.
Venue: 
2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies
bibtex: 
@InProceedings{pham.08.rivfa, author = {Tuan-Hung Pham and Anh-Hoang Truong and Ninh-Thuan Truong}, title = {{C}omputing heap space cost of {J}ava {C}ard applets}, booktitle = {Contributions to the 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing \& Communication Technologies}, pages = {190--196}, year = {2008}, editor = {Akim Demaille and Tru Cao and Bao Ho}, address = {University of Science --- Vietnam National University Ho Chi Minh City}, month = {July}, }