Revision as of 04:53, 22 February 2024 edit Guy Harris (talk \| contribs) Extended confirmed users 79,938 edits Use the Wayback Machine for a now-dead link. ← Previous edit		Revision as of 04:56, 22 February 2024 edit undo Guy Harris (talk \| contribs) Extended confirmed users 79,938 edits →Computing minimal SSA using dominance frontiers: Use {{cite technical report}}. (If you want to use {{cite journal}}, use Software - Practice and Experience as the journal, don't leave the journal out.) Next edit →
Line 84: There is an efficient algorithm for finding dominance frontiers of each node. This algorithm was originally described in "Efficiently Computing Static Single Assignment Form and the Control Graph" by Ron Cytron, Jeanne Ferrante, et al. in 1991.<ref>{{cite journal \|last1=Cytron \|first1=Ron \|last2=Ferrante \|first2=Jeanne \|last3=Rosen \|first3=Barry K. \|last4=Wegman \|first4=Mark N. \|last5=Zadeck \|first5=F. Kenneth \|title=Efficiently computing static single assignment form and the control dependence graph \|journal=ACM Transactions on Programming Languages and Systems \|date=1 October 1991 \|volume=13 \|issue=4 \|pages=451–490 \|doi=10.1145/115372.115320\|s2cid=13243943 \|doi-access=free }}</ref> Keith D. Cooper, Timothy J. Harvey, and Ken Kennedy of [[Rice University]] describe an algorithm in their paper titled ''A Simple, Fast Dominance Algorithm'':<ref name="Cooper_2001">{{cite ~~journal~~technical report \|title=A Simple, Fast Dominance Algorithm \|id=Rice University, CS Technical Report 06-33870 \|~~last~~last1=Cooper \|~~first~~first1=Keith D. \|~~author2~~last2=Harvey, \|first2=Timothy J. \|~~author3~~last3= Kennedy, \|first3=Ken \|year=2001 \|url=https://www.cs.rice.edu/~keith/EMBED/dom.pdf \|archive-url=https://web.archive.org/web/20220326234549/https://www.cs.rice.edu/~keith/EMBED/dom.pdf \|archive-date=2022-03-26 \|url-status=dead}}</ref> '''for each''' node b

Static single-assignment form: Difference between revisions