RSSA: a reversible SSA form
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Standard
RSSA : a reversible SSA form. / Mogensen, Torben Ægidius.
Perspectives of System Informatics: 10th International Andrei Ershov Informatics Conference, PSI 2015, Revised Selected Papers. ed. / Manuel Mazzara; Andrei Voronkov. Springer, 2016. p. 203-217 (Lecture notes in computer science, Vol. 9609).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - GEN
T1 - RSSA
T2 - 10th International Andrei Ershov Informatics Conference on Perspectives of System Informatics, PSI 2015
AU - Mogensen, Torben Ægidius
PY - 2016
Y1 - 2016
N2 - The SSA form (Static Single Assignment form) is used in compilers as an intermediate language as an alternative to traditional three-address code because code in SSA form is easier to analyse and optimize using data-flow analysis such as common-subexpression elimination, value numbering, register allocation and so on. We introduce RSSA, a reversible variant of the SSA form suitable as an intermediate language for reversible programming languages that are compiled to reversible machine language. The main issues in making SSA reversible are the unsuitability for SSA of the reversible updates and exchanges that are traditional in reversible languages and the need for ϕ-nodes on both joins and splits of control-flow. The first issue is handled by making selected uses of a variable destroy the variable and the latter by adding parameters to labels. We show how programs in the reversible intermediate language RIL can be translated into RSSA and discuss copy propagation, constant propagation and register allocation in the context of RSSA.
AB - The SSA form (Static Single Assignment form) is used in compilers as an intermediate language as an alternative to traditional three-address code because code in SSA form is easier to analyse and optimize using data-flow analysis such as common-subexpression elimination, value numbering, register allocation and so on. We introduce RSSA, a reversible variant of the SSA form suitable as an intermediate language for reversible programming languages that are compiled to reversible machine language. The main issues in making SSA reversible are the unsuitability for SSA of the reversible updates and exchanges that are traditional in reversible languages and the need for ϕ-nodes on both joins and splits of control-flow. The first issue is handled by making selected uses of a variable destroy the variable and the latter by adding parameters to labels. We show how programs in the reversible intermediate language RIL can be translated into RSSA and discuss copy propagation, constant propagation and register allocation in the context of RSSA.
U2 - 10.1007/978-3-319-41579-6_16
DO - 10.1007/978-3-319-41579-6_16
M3 - Article in proceedings
AN - SCOPUS:84979084439
SN - 978-3-319-41578-9
T3 - Lecture notes in computer science
SP - 203
EP - 217
BT - Perspectives of System Informatics
A2 - Mazzara, Manuel
A2 - Voronkov, Andrei
PB - Springer
Y2 - 24 August 2015 through 27 August 2015
ER -
ID: 168284239