article · 2011
An approach for pointer optimization using SSA based intermediate representation
Deodatta Barhate, Anil K. Sarje
Cited by 0Abstract and details only
Abstract
In optimizing compilers, most of the optimizing algorithms are applied on intermediate representation. Optimizing algorithms such as constant propagation can be applied on intermediate code using data flow analysis which is expensive regarding compilation time. Also for pointer variables, these algorithms cannot be applied directly on pointers as pointers are difficult to analyse. In this paper, new approach for applying optimization algorithms such as constant propagation on pointer variables has been proposed. To avoid data flow analysis, static single assignment (SSA) form is used for intermediate representation and for pointers, alias classes are used. So using SSA and each alias class as a single variable, constant propagation algorithm can be applied on pointer variables very efficiently.
Cite this paper
Barhate, D., & Sarje, A. K. (2011). An approach for pointer optimization using SSA based intermediate representation. https://doi.org/10.1109/icrtit.2011.5972428
Barhate, Deodatta, and Anil K. Sarje. “An approach for pointer optimization using SSA based intermediate representation.” vol. 1694, 2011, pp. 398–401, https://doi.org/10.1109/icrtit.2011.5972428.
Barhate, Deodatta, and Anil K. Sarje. 2011. “An approach for pointer optimization using SSA based intermediate representation.” https://doi.org/10.1109/icrtit.2011.5972428.
Barhate, D. and Sarje, A.K. (2011) ‘An approach for pointer optimization using SSA based intermediate representation’. Available at: https://doi.org/10.1109/icrtit.2011.5972428.
@article{barhate2011approach,
title = {{An approach for pointer optimization using SSA based intermediate representation}},
author = {Barhate, Deodatta and Sarje, Anil K.},
volume = {1694},
pages = {398--401},
year = {2011},
doi = {10.1109/icrtit.2011.5972428}
}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
Estimating the Impact of Scalable Pointer Analysis on Optimization
Manuvir Das, Ben Liblit, Manuel A. Fähndrich et al. · Lecture notes in computer science · 2001
Cited by 75
Intraprocedural Alias Analysis for Pointer Array
Chuanqi Zhu · 1999
Cited by 0
Interprocedural pointer alias analysis
Michael Hind, Michael Burke, Paul R. Carini et al. · ACM Transactions on Programming Languages and Systems · 1999
Cited by 221Open access
Developing practical program analyses for programs with pointers
Donglin Liang, Mary Jean Harrold · UPT. Syiah Kuala University Library (Syiah Kuala University) · 2002
Cited by 0Open access
Computing Must and May Alias to Detect Null Pointer Dereference
Xiaodong Ma, Ji Wang, Wei Dong · Communications in computer and information science · 2008
Cited by 9
Dynamic Pointer Alias Analysis Framework for Vectorization
Fangyi Li · 2015
Cited by 0
DFA&OPT-MetaFrame: A tool kit for program analysis and optimization
Marion Klein, Dirk Koschützki, Jens Knoop et al. · Lecture notes in computer science · 1996
Cited by 19
Heap analysis and optimizations for threaded programs
Xinan Tang, Rakesh Ghiya, Laurie Jane Hendren et al. · International Conference on Parallel Architectures and Compilation Techniques (PACT) · 2002
Cited by 7