Re: Incremental computation of dominators

Luis Quesada <luque@info.ucl.ac.be>
31 Aug 2005 00:34:09 -0400

          From comp.compilers

Related articles
Incremental computation of dominators luque@info.ucl.ac.be (Luis Quesada) (2005-08-13)
Re: Incremental computation of dominators luque@info.ucl.ac.be (Luis Quesada) (2005-08-16)
Re: Incremental computation of dominators jeffrey.kenton@comcast.net (Jeff Kenton) (2005-08-24)
Re: Incremental computation of dominators luque@info.ucl.ac.be (Luis Quesada) (2005-08-31)
| List of all articles for this month |

From: Luis Quesada <luque@info.ucl.ac.be>
Newsgroups: comp.compilers
Date: 31 Aug 2005 00:34:09 -0400
Organization: Compilers Central
References: 05-08-049 05-08-058 05-08-090
Keywords: analysis

Jeff Kenton wrote:
> There is a much simpler algorithm developed by Keith Cooper, Tim Harvey and
> Ken Kennedy -- A Simple, Fast Dominance Algorithm:
>
> http://www.cs.rice.edu/~keith/EMBED/dom.pdf
>
> It is at least as fast and much easier to understand. I also recommend
> "Engineering A Compiler" by Keith Cooper and Linda Torczon.
>
> jeff
>
I also found "Finding dominators revisited" by Loukas Georgiadis and
Robert E. Tarjan.


They say their algorithm is simpler and faster than related approaches.
I will read both papers carefully.


Thank you very much for the recommendation,
Luis



Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.