참고문헌
- Bodik, R., Gupta, R. and Soffa, M.L., 'Complete removal of reducdant computations,' Proceed-ings of ACM Conference on Programming Language Design and Implementaion, Vol.33, No.5, pp. 1-14, New York, June 1998
- Cai, Q. and Xue. J., ' Optimal and Efficient speculation based partial reducdancy elimination,' Proceedings of the 1st IEEE/ACM International Symposium on Code Generation and optimization, pp.91-102, 2003 https://doi.org/10.1109/CGO.2003.1191536
- Gupta, R., Berson, D.A. and Fang, J, Z., 'Path profile guided partial reducdancy elimination using speculation,' Proceedings of the 1998 International conference on Computer Languages, pp.230-239, 1998 https://doi.org/10.1109/ICCL.1998.674173
- Horspoolm R.N. and Ho, H.C., 'Partial redundancy elimination driven by a cost-benefit an-alysis,' Proceedings of 8th Israeli Conference on Computer systems and Software Engineering, pp. 111-118, june 1997 https://doi.org/10.1109/ICCSSE.1997.599882
- Knoop, J., Ruthing, O. and Steffen, B., 'Optimal code motion: theory and practics,' ACM Transactions on Programming Languages and Systems, Vol.16 , No.4, pp. 1117-1155,1994 https://doi.org/10.1145/183432.183443
- Knoop, J., Ruthing, O. and Steffen, B., 'Partial dead code elimination,' In Proc. ACM SIG-PLAN Conference on Programming Language Design and Implementation'94, of ACM SIG-PLAN Notices, Vol.29, No.6 pp.147-158, Orlando, FL, June 1994
- Morel, E. and Renvoise, C., 'Global optimization by suppression of partial redundancies,' Communications of the ACM, Vol.22, No.2, pp. 96-103, 1979 https://doi.org/10.1145/359060.359069
- Scholz, B., Horspool, N. and Knoop, J., 'Optimizing for space and time usage with specula-tive partial redundancy elimination,' ACM SIGPLAN Notices, proceedings of the 2004 ACM SIGPLAN/SIGBED conference on Language, compilers, and tools for embedded systems, Vol.39, No.7, pp.221-230, June 2004 https://doi.org/10.1145/998300.997195