Static Single Assignment Form for Java Bytecodes in CTOC 


Vol. 13,  No. 7, pp. 939-946, Dec.  2006
10.3745/KIPSTD.2006.13.7.939


PDF
  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
  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.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals