author = {Gianfranco Bilardi and Keshav Pingali},
  title = {The Static Single Assignment Form and its Computation},
  month = {Jul},
  year = {1999},
  institution = {Department of Computer Science, Cornell University},
  abstract = {a linear $\phi$-function placement algm},
  url = {}
  author = {Gianfranco Bilardi and Keshav Pingali},
  title = {Algorithms for computing the static single assignment form},
  journal = {Journal of the ACM},
  volume = {50},
  number = {3},
  month = {May},
  year = {2003},
  pages = {375--425},
  abstract = {rather complicated expansion of above tech
                  report. Theoretical framework for $\phi$-fn placement
                  algorithms, general enough to cope with most other placement
  url = {}
  author = {Vugranam C. Sreedhar and Guang R. Gao},
  title = {A Linear Time Algorithm for Placing $\phi$-nodes},
  booktitle = {Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on
                  Principles of Programming Languages},
  pages = {62--73},
  year = {1995},
  abstract = {title says it all - although this one doesn't go as fast as
                  Bilardi and Pingali, according to BP's paper (a personal
                  communication). However, this is the one that Microsoft use
                  for their Marmot compiler - so it must be ok... uses data
                  structures known as DJ-graphs.},
  url = {}
  author = {Dibyendu Das and U. Ramakrishna},
  title = {A practical and fast iterative algorithm for $\phi$-function computation using {DJ} graphs},
  journal = {ACM Transactions on Programming Languages and Systems},
  volume = {27},
  number = {3},
  year = {2005},
  pages = {426--440},
  abstract = {precomputes merge sets for each CFG node. The merge set is the set of locations where phi-fns will be needed for vars defined in n. Do not need to recompute if phi-fns are later placed in n. Apparently good for dense variable definitions, demonstrated on SPEC CPU 2000.}

This file was generated by bibtex2html 1.96.