Home
>
Explore Content
>
All Issues
>
Article View
Implementation of Dead Code Elimination in CTOC
Journal of The Korea Society of Computer and Information
Abbr :
JKSCI
2007, 12(2), pp.1-8
Publisher : The Korean Society Of Computer And Information
Research Area : Computer Science
2007, 12(2), pp.1-8
Publisher : The Korean Society Of Computer And Information
Research Area : Computer Science
-
Although the Java bytecode has numerous advantages, there are also shortcomings such as slow execution speed and difficulty in analysis. Therefore, in order for the Java class file to be effectively executed under the execution environment such as the network, it is necessary to convert it into optimized code. We implements CTOC. In order to statically determine the value and type, CTOC uses the SSA Form which separates the variable according to assignment. Also, it uses a Tree Form for statements. But, due to insertion of the -function in the process of conversion into the SSA Form, the number of nodes increased. This paper shows the dead code elimination to obtain a more optimized code in SSA Form. We add new live field in each node and achieve dead code elimination in tree structures. We can confirm after dead code elimination though test results that nodes decreases.
203
Viewed
Print this page
Download PDF