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.
2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies
Associated research group: Critical Systems Research Group
Pham, Hung T.; Truong, Anh-Hoang; Truong, Ninh-Thuan.
Computing heap space cost of Java Card applets.
Retrieved from the University of Minnesota Digital Conservancy,
Content distributed via the University of Minnesota's Digital Conservancy may be subject to additional license and use restrictions applied by the depositor.