Issue No.07 - July (2007 vol.33)
Konstantinos Blekas , IEEE
Apostolos V. Zarras , IEEE
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TSE.2007.1021
Pattern-based Java bytecode compression techniques rely on the identification of identical instruction sequences that occur more than once. Each occurrence of such a sequence is substituted by a single instruction. The sequence defines a pattern that is used for extending the standard bytecode instruction set with the instruction that substitutes the pattern occurrences in the original bytecode. Alternatively, the pattern may be stored in a dictionary that serves for the bytecode decompression. In this case, the instruction that substitutes the pattern in the original bytecode serves as an index to the dictionary. In this paper, we investigate a bytecode compression technique that considers a more general case of patterns. Specifically, we employ the use of an advanced pattern discovery technique that allows locating patterns of an arbitrary length, which may contain a variable number of wildcards in place of certain instruction opcodes or operands. We evaluate the benefits and the limitations of this technique in various scenarios that aim at compressing the reference implementation of MIDP, a standard Java environment for the development of applications for mobile devices.
Java, compression (coding).
Dimitris Saougkos, George Manis, Konstantinos Blekas, Apostolos V. Zarras, "Revisiting Java Bytecode Compression for Embedded and Mobile Computing Environments", IEEE Transactions on Software Engineering, vol.33, no. 7, pp. 478-495, July 2007, doi:10.1109/TSE.2007.1021