|dominator tree firstname.lastname@example.org (1998-03-05)|
|Re: dominator trees email@example.com (Clark L. Coleman) (1998-03-07)|
|Re: dominator tree firstname.lastname@example.org (1998-03-07)|
|Re: dominator tree email@example.com (David Chase) (1998-03-07)|
|Re: dominator tree firstname.lastname@example.org (1998-03-08)|
|Re: dominator tree email@example.com (1998-03-12)|
|Re: dominator tree firstname.lastname@example.org (Vugranam Sreedhar) (1998-03-12)|
|[5 later articles]|
|From:||email@example.com (Aaron Leon Kaplan)|
|Date:||5 Mar 1998 23:20:58 -0500|
|Organization:||Vienna University of Technology, Austria|
|Keywords:||theory, analysis, question|
Has anyone implemented the dominator tree algorithm by Dov Harel
(idescribed in the paper "A linear time algorithm for finding dominators
in a flow graph and related problems")? I would be very interested in the
exchange of ideas.
Or: Is there a "proper" paper describing this algorithm? All I have is an
extended abstract, which does not seem to be very helpfull in its rather
brief description of the algorithm (i.e. many important steps are left out)?
If so where did it appear?
Return to the
Search the comp.compilers archives again.