Static Single Assignment Form for Java Bytecodes in CTOC


The KIPS Transactions:PartD, Vol. 13, No. 7, pp. 939-946, Dec. 2006
10.3745/KIPSTD.2006.13.7.939,   PDF Download:

Abstract

Although the Java bytecode has numerous advantages, there are also shortcomings such as slow execution speed and difficulty in analysis. In order to overcome such disadvantages, bytecode analysis and optimization must be performed. We implements CTOC for optimized codes. An extended CFG must be first created in order to analyze and optimize a bytecode. Due to unique bytecode properties, the existing CFG must be expanded according to the bytecode. Furthermore, the CFG must be converted into SSA Form for a static analysis, for which calculation is required for various information such as the dominate relation, dominator tree, immediate dominator, ￠-function, rename, and dominance frontier. This paper describes the algorithm and the process for converting the existing CFG into the SSA Form. The graph that incorporates the SSA Form is later used for type inference and optimization.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. T. Kim and W. H. Yoo, "Static Single Assignment Form for Java Bytecodes in CTOC," The KIPS Transactions:PartD, vol. 13, no. 7, pp. 939-946, 2006. DOI: 10.3745/KIPSTD.2006.13.7.939.

[ACM Style]
Ki Tae Kim and Weon Hee Yoo. 2006. Static Single Assignment Form for Java Bytecodes in CTOC. The KIPS Transactions:PartD, 13, 7, (2006), 939-946. DOI: 10.3745/KIPSTD.2006.13.7.939.