You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

More precise construction of static single assignment programs using reaching definitions

Fulltext:


Publication Type:

Journal article

Venue:

Journal of Systems and Software

DOI:

https://doi.org/10.1016/j.jss.2020.110590


Abstract

The Static Single Assignment (SSA) form is an intermediate representation used for the analysis and optimization of programs in modern compilers. The φ-function placement is the most com- putationally expensive part of converting any program into its SSA form. The most widely-used φ-function placement algorithms are based on computing dominance frontiers (DF). However, this kind of algorithms works under the limiting assumption that all variables are defined at the be- ginning of the program, which is not the case for local variables. In this paper, we introduce an innovative φ-placement algorithm based on computing reaching definitions (RD), which generates a precise number of φ-functions. We provided theorems and proofs showing the correctness and the theoretical computational complexity of our algorithms. We implemented our approach and a well-known DF-based algorithm in the Clang/LLVM compiler framework, and performed experi- ments on a number of benchmarks. The results show that the limiting assumption of the DF-based algorithm when compared with the more accurate results of our RD-based approach leads to gen- erating up to 87% (69% on average) superfluous φ-functions on all benchmarks, and thus brings about a significant precision loss. Moreover, even though our approach computes more informa- tion to generate precise results, it is able to analyze up to 92.96% procedures (65.63% on average) of all benchmarks with execution time within twice the execution time of the reference DF-based approach.

Bibtex

@article{Masud5788,
author = {Abu Naser Masud and Federico Ciccozzi},
title = {More precise construction of static single assignment programs using reaching definitions},
isbn = {0164-1212},
volume = {166},
number = {110590},
month = {April},
year = {2020},
journal = {Journal of Systems and Software},
url = {http://www.es.mdh.se/publications/5788-}
}