Pham, Hung T.Truong, Anh-HoangTruong, Ninh-Thuan2020-12-102020-12-1020082008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologieshttps://hdl.handle.net/11299/217305Associated research group: Critical Systems Research GroupWe 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.Report