@article{kennedy99partial,
author = {Robert Kennedy and Sun Chan and Shin-Ming Liu and Raymond Lo
and Peng Tu and Fred Chow},
title = {Partial redundancy elimination in {SSA} form},
journal = {ACM Transactions on Programming Languages and Systems},
volume = {21},
number = {3},
month = {May},
year = {1999},
pages = {627--676},
abstract = {shows how to do PRE using SSA - derives factored redundancy
graph from SSA and does forwards and backwards data flow
analysis on this. Shows how to use SSA to do
analysis/optimization for expressions, not just for
vars. Also defines an interesting density function to
measure sparseness.},
url = {http://doi.acm.org/10.1145/319301.319348}
}
@inproceedings{vandrunen04value,
author = {Thomas VanDrunen and Antony L. Hosking},
title = {Value-Based Partial Redundancy Elimination},
booktitle = {13th International Conference on Compiler Construction},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2985},
year = {2004},
pages = {167--184},
abstract = {a different approach to SSA-based PRE. Uses value
numbering to identify redundant computation, rather
than a more syntactic measure. This approach has
been implemented in Jikes RVM and GCC.},
url = {http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2985&spage=167}
}
@inproceedings{lenart00ssa,
author = {Alexandre Lenart and Christopher Sadler and Sandeep
K. S. Gupta},
title = {{SSA}-based flow-sensitive type analysis: combining constant
and type propagation},
booktitle = {Proceedings of the ACM Symposium on Applied Computing},
year = {2000},
pages = {813--817},
abstract = {combines WZ91 sparse conditional constant propagation with
type propagation for concrete types in Java programs. A
poorly written, short, rather dodgy paper, but still quite
an interesting find},
url = {http://doi.acm.org/10.1145/338407.338570}
}
@inproceedings{mycroft99type,
author = {Alan Mycroft},
title = {Type-Based Decompilation},
booktitle = {Proceedings of the 8th European Symposium on Programming},
pages = {208--223},
year = {1999},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {1576},
abstract = {uses SSA to undo register colouring, then infers types and
transforms RTL back into C. All thoughts, and no real
implementations here...},
url = {http://citeseer.ist.psu.edu/mycroft99type.html}
}
@inproceedings{saito96sigma,
author = {Saito, Hideki and Polychronopoulos, Constantine D.},
title = {sigma-{SSA} and Its Construction Through Symbolic Interpretation},
booktitle = {Proceedings of the 9th International Workshop on Languages and Compilers for Parallel Computing},
year = {1997},
pages = {585--587},
publisher = {Springer-Verlag},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.8695},
abstract = {a variant of SSA that purports to be useful for symbolic analysis and interpretation. Uses a data flow like Value Flow Graph for optimization. Lack of detail for construction algorithm}
}
@inproceedings{jhala06structural,
author = {Ranjit Jhala and Rupak Majumdar and Ru-Gang Xu},
title = {Structural invariants},
booktitle = {Proceedings of the Static Analysis Symposium},
journal = {Lecture Notes In Computer Science},
volume = {4134},
pages = {71--87},
year = {2006},
url = {http://dx.doi.org/10.1007/11823230_6},
abstract = {SSA for model checking. Using the dominance properties of SSA enables efficient generation of verification conditions}
}
@inproceedings{boissinot08fast,
author = {Boissinot, Benoit and Hack, Sebastian and Grund, Daniel and Dupont de Dinechin, Beno{\^{\i}}t and Rastello, Fabrice},
title = {Fast liveness checking for {SSA}-form programs},
booktitle = {Proceedings of the Sixth Annual IEEE/ACM International Symposium on Code Generation and Optimization},
year = {2008},
pages = {35--44},
url = {http://doi.acm.org/10.1145/1356058.1356064},
abstract = {liveness analysis based directly on SSA, rather than specialized data flow analysis}
}
This file was generated by bibtex2html 1.96.