ssa2.bib

@article{cytron91efficiently,
  author = {Ron Cytron and Jeanne Ferrante and Barry K. Rosen and Mark
                  N. Wegman and F. Kenneth Zadeck},
  title = {Efficiently Computing Static Single Assignment Form and the
                  Control Dependence Graph},
  journal = {ACM Transactions on Programming Languages and Systems},
  volume = {13},
  number = {4},
  month = {Oct},
  publisher = {ACM Press},
  pages = {451--490},
  year = {1991},
  abstract = {The most important paper in the field. Comprehensive yet
                  readable. Note there was an earlier version at POPL 89.},
  url = {http://doi.acm.org/10.1145/115372.115320}
}

@article{wegman91constant,
  author = {Mark N. Wegman and F. Kenneth Zadeck},
  title = {Constant propagation with conditional branches},
  journal = {ACM Transactions on Programming Languages and Systems},
  volume = {13},
  number = {2},
  pages = {181--210},
  month = {Apr},
  year = {1991},
  publisher = {ACM Press},
  abstract = {A fascinating account of constant propagation - different
                  approaches. Clear application of SSA to good advantage.},
  url = {http://doi.acm.org/10.1145/103135.103136}
}

@inproceedings{rosen88global,
  author = {B. K. Rosen and M. N. Wegman and F. K. Zadeck},
  title = {Global value numbers and redundant computations},
  booktitle = {Proceedings of the 15th ACM SIGPLAN-SIGACT Symposium on
                  Principles of Programming Languages},
  year = {1988},
  pages = {12--27},
  abstract = {early paper from SSA authors},
  url = {http://doi.acm.org/10.1145/73560.73562}
}

@inproceedings{alpern88detecting,
  author = {B. Alpern and M. N. Wegman and F. K. Zadeck},
  title = {Detecting equality of variables in programs},
  booktitle = {Proceedings of the 15th ACM SIGPLAN-SIGACT Symposium on
                  Principles of Programming Languages},
  pages = {1--11},
  year = {1988},
  abstract = {early paper from SSA authors},
  url = {http://doi.acm.org/10.1145/73560.73561}
}

@article{briggs98practical,
  author = {Preston Briggs and Keith D. Cooper and Timothy J. Harvey and
                  L. Taylor Simpson},
  title = {Practical Improvements to the Construction and Destruction
                  of Static Single Assignment Form},
  journal = {Software---Practice and Experience},
  volume = {28},
  number = {8},
  pages = {859--881},
  month = {Jul},
  year = {1998},
  abstract = {describes semi-pruned SSA form, as used in Machine
                  SUIF. Cheaper to compute than fully pruned form yet nearly
                  as small.},
  url = {http://citeseer.ist.psu.edu/briggs98practical.html}
}

@inproceedings{aycock00simple,
  author = {John Aycock and Nigel Horspool},
  title = {Simple Generation of static single assignment form},
  booktitle = {Proceedings of the 9th International Conference in Compiler
                  Construction},
  year = {2000},
  pages = {110--125},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  volume = {1781},
  abstract = {pessimistic construction of SSA - not v efficient idea but a
                  really neat way of presenting it},
  url = {http://citeseer.ist.psu.edu/aycock00simple.html}
}

@article{brandis94single,
  author = {Marc M. Brandis and Hanspeter M\"{o}ssenb\"{o}ck},
  title = {Single-pass generation of static single-assignment form for
                  structured languages},
  journal = {ACM Transactions on Programming Languages and Systems},
  volume = {16},
  number = {6},
  month = {Nov},
  year = {1994},
  pages = {1684--1698},
  abstract = {syntax directed SSA construction for Oberon, a high-level
                  very well-structured language},
  url = {http://doi.acm.org/10.1145/197320.197331}
}

@inproceedings{choi96incremental,
  author = {J.-D. Choi and V. Sarkar and E. Schonberg},
  title = {Incremental computation of static single assignment form},
  booktitle = {Sixth International Conference on Compiler Construction},
  series = {Lecture Notes in Computer Science},
  volume = {1060},
  month = {Apr},
  year = {1996},
  pages = {223--237}
}

@inproceedings{braun13simple,
  title = {Simple and Efficient Construction of Static Single Assignment Form},
  booktitle = {Proceedings of the International Conference on Compiler Construction},
  series = {Lecture Notes in Computer Science},
  year = {2013},
  author = {Matthias Braun and Sebastian Buchwald and Sebastian Hack and Roland Lei{\ss}a and Christoph Mallon and Andreas Zwinkau},
  url = {http://pp.info.uni-karlsruhe.de/uploads/publikationen/braun13cc.pdf},
  abstract = {Whereas Cytron et al.’s algorithm is an eager forwards approach,
                  this new approach is lazy and backwards i.e.
                  it searches backwards from uses to find reaching definitions, 
                  inserting φ functions at control flow join points along the way.
                  Memoization avoids repeated lookups, on-the-fly
                  optimization simplifies generated IR. Implemented in LLVM}
}

This file was generated by bibtex2html 1.96.