CTOC에서 자바 바이트코드 최적화를 위한 Value Numbering

다국어 초록 (Multilingual Abstract)

Redundant expressions must be eliminated in order to apply optimization for expressions in SSA　Form from CTOC. This paper applied VN(Value Numbering) for this purpose. In order to carry out VN, SSAGraph must be first generated to maintain the information in the SSA Form, equivalent nodes must be found and SCC(Strongly Connected Component) generated. Equivalent nodes are assigned with an identical valnum through SCC. We could confirm elimiations for many nodes that added at SSA Form process after VN. The valnum can be applied in optimization and type inference.

참고문헌 (Reference)

1 "“정적 단일 배정 형태를 위한 정적 타입 배정에 관한 연구”" 6 (6): 117-126, 2006

2 "“바이트코드를 위한 정적 단일 배정문 기반의 정적 타입 추론”" 11 (11): 87-96, 2006

3 "“CTOC에서 자바 바이트코드를 이용한 제어 흐름 분석에 관한 연구”" 6 (6): 160-169, 2006

4 "Symbolic Evaluation and the Global Value Graph" 104-118,

5 "Programming Languages and Their Compilers: Preliminary Notes, Courant Inst" New York Univ preliminary (preliminary): 1969

6 "Java Program Analysis: A New Approach Using Java Virtual Machine Bytecodes"

7 "Detecting Equality of Variables in Programs" 1-11,

8 "Advanced Compiler Design and Implementation" Morgan Kaufmann Publishers 1997