DocumentCode :
3339923
Title :
Dead Code Elimination in CTOC
Author :
Kim, Ki-Tae ; Kim, Je-Min ; Yoo, Weon-Hee
Author_Institution :
Inha Univ., Inchoen
fYear :
2007
fDate :
20-22 Aug. 2007
Firstpage :
584
Lastpage :
588
Abstract :
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 Phi-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.
Keywords :
Java; systems analysis; tree data structures; Java bytecode; dead code elimination; tree form; tree structures; Application software; Computer science; Conference management; Engineering management; Information analysis; Java; Merging; Optimization methods; Software engineering; Tree data structures;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Software Engineering Research, Management & Applications, 2007. SERA 2007. 5th ACIS International Conference on
Conference_Location :
Busan
Print_ISBN :
0-7695-2867-8
Type :
conf
DOI :
10.1109/SERA.2007.69
Filename :
4296989
Link To Document :
بازگشت