@techreport{shapiro69representation,
author = {Shapiro, R. M. and Saint, H.},
title = {The representation of algorithms},
number = {RADC-TR-69-313},
volume = {II},
institution = {Rome Air Development Center},
month = sep,
year = {1969},
url = {http://www.cs.rice.edu/~keith/512/OpenPapers/Shapiro-Saint-V2.pdf},
abstract = {early inspiration for SSA. Discusses variable names, data dependence, control flow, graphical notation, etc.}
}
@article{lengauer79fast,
title = {A fast algorithm for finding dominators in a flowgraph},
author = {Thomas Lengauer and Robert E. Tarjan},
journal = {ACM Transactions on Programming Languages and Systems},
volume = {1},
number = {1},
pages = {121--141},
month = {Jul},
year = {1979},
abstract = {the classic paper on how to compute dominators quickly.},
url = {http://doi.acm.org/10.1145/357062.357071}
}
@article{reif82symbolic,
title = {Symbolic Program Analysis in Almost Linear Time},
author = {Reif, J. H. and Tarjan, R. E.},
journal = {SIAM Journal on Computing},
month = {Feb},
year = {1982},
volume = {11},
number = {1},
pages = {81--93},
url = {http://link.aip.org/link/?SMJ/11/81/1},
abstract = { ***The date is wrong on the top of the paper.*** In
this paper an "optimal" algorithm is given to compute simple join
birthpoints. An earlier version appeared in POPL}
}
@inproceedings{reif77symbolic,
title = {Symbolic Evaluation and the Global Value Graph},
author = {Reif, J. H. and Lewis, H. R.},
booktitle = {Proceedings of the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages},
year = {1977},
pages = {104--118},
url = {http://doi.acm.org/10.1145/512950.512961},
abstract = { global value graph (pre-SSA IR) for linear time constant propagation}
}
@article{reif86efficient,
title = {Efficent Symbolic Analysis of Programs},
author = {Reif, J. H. and Lewis, H. R.},
journal = {Journal of Computer and System Sciences},
volume = {32},
number = {3},
month = {Jun},
year = {1986},
pages = {280--313},
url = {http://dx.doi.org/10.1016/0022-0000(86)90031-0},
abstract = { linear algorithm is given to perform constant
propagation in time linear in the size of the use-definition chains.
Updated version of Reif77 and Reif82 }
}
This file was generated by bibtex2html 1.96.