Constructing A Loop Tree in CTOC


The KIPS Transactions:PartD, Vol. 15, No. 2, pp. 197-206, Apr. 2008
10.3745/KIPSTD.2008.15.2.197,   PDF Download:

Abstract

The CTOC framework was implemented to efficiently perform analysis and optimization of the Java bytecode that is often being used lately. In order to analyze and optimize the bytecode from the CTOC, the eCFG was first generated. Due to the bytecode characteristics of difficult analysis, the existing bytecode was expanded to be suitable for control flow analysis, and the control flow graph was drawn. We called eCFG(extended Control Flow Graph). Furthermore, the eCFG was converted into the SSA Form for a static analysis. Many loops were found in the conversion program. The previous CTOC performed conversion directly into the SSA Form without processing the loops. However, processing the loops prior to the SSA Form conversion allows more efficient generation of the SSA Form. This paper examines the process of finding the loops prior to converting the eCFG into the SSA Form in order to efficiently process the loops, and exhibits the procedures for generating the loop tree.


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, J. M. Kim, W. H. Yoo, "Constructing A Loop Tree in CTOC," The KIPS Transactions:PartD, vol. 15, no. 2, pp. 197-206, 2008. DOI: 10.3745/KIPSTD.2008.15.2.197.

[ACM Style]
Ki Tae Kim, Je Min Kim, and Weon Hee Yoo. 2008. Constructing A Loop Tree in CTOC. The KIPS Transactions:PartD, 15, 2, (2008), 197-206. DOI: 10.3745/KIPSTD.2008.15.2.197.