8 Dec 2005 02:35:10 -0500

Related articles |
---|

Algorithm for finding dominators in a control flow graph marouane.tlili@gmail.com (2005-11-26) |

Re: Algorithm for finding dominators in a control flow graph jeffrey.kenton@comcast.net (Jeff Kenton) (2005-11-27) |

Re: Algorithm for finding dominators in a control flow graph nmm1@cus.cam.ac.uk (2005-11-29) |

Re: Algorithm for finding dominators in a control flow graph martin@gkc.org.uk (Martin Ward) (2005-11-29) |

Re: Algorithm for finding dominators in a control flow graph neal.wang@gmail.com (2005-12-08) |

From: | neal.wang@gmail.com |

Newsgroups: | comp.compilers |

Date: | 8 Dec 2005 02:35:10 -0500 |

Organization: | http://groups.google.com |

References: | 05-11-11705-11-124 05-11-132 |

Keywords: | analysis |

Posted-Date: | 08 Dec 2005 02:35:10 EST |

Another use:

The algorithm can be used to compute dominator tree, which in turn

can be used to encode type system and enable linear time checking.

One example: SafeTSA: A Type Safe and Referentially Secure Mobile-Code

Representation Based on Static Single Assignment Form

Since dominance relation can be used to optimize some static analysis,

the algorithm is definitely very useful.

Regards,

Neal

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.