Computing heap space cost of Java Card applets
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Computing heap space cost of Java Card applets
Published Date
2008
Publisher
Type
Report
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.
Keywords
Description
Associated research group: Critical Systems Research Group
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies
Suggested citation
Pham, Hung T.; Truong, Anh-Hoang; Truong, Ninh-Thuan. (2008). Computing heap space cost of Java Card applets. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/217305.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.