article · Proceedings. The 8th Russian-Korean International Symposium on Science and Technology, 2004. KORUS 2004. · 2005
Modification of the ssapre algorithm for semantic code motion
Cited by 0Abstract and details only
Abstract
Code motion (CM) is a technique for program transformation aimed at removing program statements that are redundant due to recomputing previously produced values. Such transformations improve the program performance and decrease its size, so redundancy elimination is employed by all optimizing compilers. Most of the algorithms used in production compilers perform syntactic code motion [1] in the sense that they find and remove redundancy between lexically identical expressions. This paper presents an improvement over the well-known SSAPRE algorithm that was previously limited to syntactic code motion. The proposed modification increases the algorithm strength by capturing the redundancy carried through assignment statements, including code patterns that cannot be optimized by any existing CM technique. The presented algorithm can be thought of as semantic code motion.
Cite this paper
Gurchenkov, D. (2005). Modification of the ssapre algorithm for semantic code motion. Proceedings. The 8th Russian-Korean International Symposium on Science and Technology, 2004. KORUS 2004., 1, 51–55. https://doi.org/10.1109/korus.2004.1555271
Gurchenkov, D.S. “Modification of the ssapre algorithm for semantic code motion.” Proceedings. The 8th Russian-Korean International Symposium on Science and Technology, 2004. KORUS 2004., vol. 1, 2005, pp. 51–55, https://doi.org/10.1109/korus.2004.1555271.
Gurchenkov, D.S. 2005. “Modification of the ssapre algorithm for semantic code motion.” Proceedings. The 8th Russian-Korean International Symposium on Science and Technology, 2004. KORUS 2004. 1: 51–55. https://doi.org/10.1109/korus.2004.1555271.
Gurchenkov, D. (2005) ‘Modification of the ssapre algorithm for semantic code motion’, Proceedings. The 8th Russian-Korean International Symposium on Science and Technology, 2004. KORUS 2004., 1, pp. 51–55. Available at: https://doi.org/10.1109/korus.2004.1555271.
@article{gurchenkov2005modification,
title = {{Modification of the ssapre algorithm for semantic code motion}},
author = {Gurchenkov, D.S.},
journal = {Proceedings. The 8th Russian-Korean International Symposium on Science and Technology, 2004. KORUS 2004.},
volume = {1},
pages = {51--55},
year = {2005},
doi = {10.1109/korus.2004.1555271}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Compiling with code-size constraints
Mayur Naik, Jens Palsberg · ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES) · 2002
Cited by 26
Compiling with code-size constraints
Mayur Naik, Jens Palsberg · ACM Transactions on Embedded Computing Systems · 2004
Cited by 19
Compiling with code-size constraints
Mayur Naik, Jens Palsberg · 2002
Cited by 0
Compiling with code-size constraints
Mayur Naik, Jens Palsberg · ACM SIGPLAN Notices · 2002
Cited by 0
Code optimization as a side effect of instruction scheduling
Rajiv Gupta · IEEE International Conference on High Performance Computing, Data, and Analytics · 2002
Cited by 7
An Efficient Code Generation Algorithm for Code Size Reduction Using 1-Offset P-Code Queue Computation Model
Arquimedes Canedo, Abderazek Ben Abdallah, Masahiro Sowa · Springer eBooks · 2007
Cited by 5
Code size and performance optimization for mobile JavaScript just-in-time compiler
Seong‐Won Lee, Soo‐Mook Moon, Won-Ki Jung et al. · 2010
Cited by 9
Optimizing ML with run-time code generation
Peter Lee, Mark Leone · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · 1996
Cited by 198Open access