mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Towards constructing the SSA form using reaching definitions over dominance frontiers
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0002-4872-1208
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0002-0401-1036
2019 (English)In: Proceedings - 19th IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM 2019, Institute of Electrical and Electronics Engineers Inc. , 2019, p. 23-33Conference paper, Published paper (Refereed)
Abstract [en]

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 computationally expensive part of converting any program into its SSA form. The most widely-used φ-function placement algorithms are based on computing dominance frontiers. However, this kind of algorithms works under the limiting assumption that all variables are defined at the beginning of the program, which is not the case for local variables. In this paper, we introduce an innovative algorithm based on computing reaching definitions, only assuming that global variables and formal parameters are defined at the beginning of the program. We implemented our algorithm and compared it to a well-known dominance frontiers-based algorithm in the Clang/LLVM compiler framework by performing experiments on a benchmarking suite for Perl. The results of our experiments show that, besides a few computationally expensive cases, our algorithm is fairly efficient, and most notably it produces up to 169% and on an average 74% fewer φ-functions than the reference dominance frontiers-based algorithm. 

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc. , 2019. p. 23-33
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:mdh:diva-46796DOI: 10.1109/SCAM.2019.00012ISI: 000529322000003Scopus ID: 2-s2.0-85077814605ISBN: 9781728149370 (print)OAI: oai:DiVA.org:mdh-46796DiVA, id: diva2:1387975
Conference
19th IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM 2019; Cleveland; United States; 30 September 2019 through 1 October 2019
Available from: 2020-01-23 Created: 2020-01-23 Last updated: 2020-05-20Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Masud, Abu NaserCiccozzi, Federico

Search in DiVA

By author/editor
Masud, Abu NaserCiccozzi, Federico
By organisation
Embedded Systems
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf