ssa18.bib

@inproceedings{sastry98new,
  author = {Sastry, A. V. S. and Ju, Roy D. C.},
  title = {A new algorithm for scalar register promotion based on {SSA} form},
  booktitle = {Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation},
  year = {1998},
  pages = {15--25},
  url = {http://doi.acm.org/10.1145/277650.277656},
  abstract = {handles register spilling and rematerialization. Deals with a new algorithm for repairing SSA.}
}
@inproceedings{eckstein03code,
  author = {E. Eckstein and O. K\"{o}nig and B. Scholz},
  title = {Code Instruction Selection based on {SSA}-Graphs},
  booktitle = {Proceedings of the International Workshop on Software and Compilers for Embedded Systems},
  pages = {49--65},
  year = {2003},
  series = {Lecture Notes in Computer Science},
  volume = {2826},
  publisher = {Springer},
  abstract = {uses some kind of boolean optimization techniques (maths!) to generate near-optimal instruction sequences for DSP programs in SSA form.},
  url = {http://www.springerlink.com/content/83cj0ebgtm998hj8/}
}
@inproceedings{hack06register,
  author = {Sebastian Hack and Daniel Grund and Gerhard Goos},
  title = {Register Allocation for Programs in {SSA}-Form},
  booktitle = {15th International Conference on Compiler Construction},
  pages = {247--262},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  volume = {3923},
  year = {2006},
  abstract = {an interesting read. Do register allocation directly in SSA,
                  rather than translate out of SSA. Some graph theory here.},
  url = {http://dx.doi.org/10.1007/11688839_20}
}
@inproceedings{brisk07interference,
  author = {Philip Brisk and Majid Sarrafzadeh},
  title = {Interference graphs for procedures in static single information form are interval graphs},
  booktitle = {Proceedings of the 10th international workshop on Software \& compilers for embedded systems},
  year = {2007},
  pages = {101--110},
  abstract = {shows how liveness analysis is O(1) for SSI programs, interesting graph-theoretic properties of SSI-based register interference graphs},
  url = {http://doi.acm.org/10.1145/1269843.1269858}
}
@inproceedings{kaplan03data,
  author = {Adam Kaplan and Philip Brisk and Ryan Kastner},
  title = {Data communication estimation and reduction for reconfigurable systems},
  booktitle = {Proceedings of the 40th conference on Design automation},
  year = {2003},
  pages = {616--621},
  url = {http://doi.acm.org/10.1145/775832.775987},
  abstract = {uses SSA for hardware synthesis, shows how tweaks in $\phi$-function placement affects hardware efficiency}
}
@inproceedings{rastello04optimizing,
  author = {F. Rastello and F. de Ferri\`{e}re and C. Guillon},
  title = {Optimizing Translation Out of {SSA} Using Renaming Constraints},
  booktitle = {Proceedings of the International Symposium on Code Generation and Optimization},
  year = {2004},
  pages = {265--278},
  url = {http://portal.acm.org/citation.cfm?id=977395.977678},
  abstract = {Extends work of leung99, for reducing number of moves after eliminating phi-functions when converting out of SSA. Variable pinning coalescing technique.}
}
@inproceedings{pereira06register,
  title = {Register Allocation after Classical {SSA} Elimination is {NP}-complete},
  author = {Pereira, F.M.Q. and Palsberg, J.},
  booktitle = {Proceedings of Foundations of Software Science and Computation Structures},
  series = {Lecture Notes in Computer Science},
  volume = {3921},
  pages = {79--93},
  month = {Mar},
  year = {2006},
  url = {http://www.cs.ucla.edu/~palsberg/paper/fossacs06.pdf},
  abstract = {Despite work of Hack, showing that SSA programs are colourable in linear time, register allocation is still NP-complete}
}
@inproceedings{pereira09ssa,
  title = {{SSA} elimination after register allocation},
  author = {Pereira, F.M. and Palsberg, J.},
  booktitle = {Proceedings of the International Conference on Compiler Construction},
  pages = {158--173},
  series = {Lecture Notes in Computer Science},
  volume = {5501},
  url = {http://dx.doi.org/10.1007/978-3-642-00722-4},
  publisher = {Springer},
  year = {2009},
  abstract = {destroy SSA after register allocation, without increasing the number of spill variables}
}
@inproceedings{hack08copy,
  author = {Hack, Sebastian and Goos, Gerhard},
  title = {Copy coalescing by graph recoloring},
  booktitle = {Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation},
  year = {2008},
  pages = {227--237},
  url = {http://doi.acm.org/10.1145/1375581.1375610},
  abstract = {A new coalescing algorithm for reg coloring after SSA-based register allocation}
}
@inproceedings{pereira08register,
  author = {Quint\~{a}o Pereira, Fernando Magno and Palsberg, Jens},
  title = {Register allocation by puzzle solving},
  booktitle = {Proceedings of the 2008 ACM SIGPLAN Conference on Programming Language Design and Implementation},
  year = {2008},
  pages = {216--226},
  url = {http://doi.acm.org/10.1145/1375581.1375609},
  abstract = {fun paper on register allocation for architectures like x86 with overlapping registers of different sizes. Does ultimate live range splitting, adds pseudo-assignments for live variables between every individual instruction. This is known as the elementary form.}
}
@inproceedings{braun09register,
  title = {Register Spilling and Live-Range Splitting for SSA-Form Programs},
  booktitle = {Proceedings of the International Conference on Compiler Construction},
  year = {2009},
  pages = {174--189},
  author = {Matthias Braun and Sebastian Hack},
  url = {http://pp.info.uni-karlsruhe.de/uploads/publikationen/braun09cc.pdf},
  abstract = {SSA-based register allocator reduces dynamic number of spill instructions in benchmark code, in relation to linear scan and graph coloring allocators}
}
@inproceedings{boissinot09revisiting,
  author = {Boissinot, Benoit and Darte, Alain and Rastello, Fabrice and de Dinechin, Benoit Dupont and Guillon, Christophe},
  title = {Revisiting Out-of-{SSA} Translation for Correctness, Code Quality and Efficiency},
  booktitle = {Proceedings of the 2009 International Symposium on Code Generation and Optimization},
  year = {2009},
  pages = {114--125},
  url = {http://dx.doi.org/10.1109/CGO.2009.19},
  abstract = {new algorithm for translating out of SSA, efficient enough to be implemented in JIT compilers}
}
@inproceedings{sreedhar99translating,
  title = {Translating Out of Static Single Assignment Form},
  author = {Vugranam C. Sreedhar and Roy Dz-Ching Ju and David M. Gillies and Vatsa Santhanam},
  booktitle = {Proceedings of the Static Analysis Symposium},
  year = {1999},
  pages = {194--210},
  series = {Lecture Notes in Computer Science},
  volume = {1694},
  url = {http://dx.doi.org/10.1007/3-540-48294-6_13},
  abstract = {another out-of-SSA algorithm, replacing phi-functions with copies where appropriate. Copies are eliminated with coalescing.}
}
@article{sassa09comparison,
  title = {Comparison and evaluation of back-translation algorithms for static single assignment forms},
  author = {Masataka Sassa and Yo Ito and Masaki Kohama},
  journal = {Computer Languages, Systems & Structures},
  volume = {35},
  number = {2},
  pages = {173--195},
  year = {2009},
  url = {http://dx.doi.org/10.1016/j.cl.2007.03.001},
  abstract = {Comparison of several classical out-of-SSA algorithms, Briggs, etc.}
}

This file was generated by bibtex2html 1.96.