Re: partial redundancy

tthorn@daimi.aau.dk (Tommy Thorn)
Mon, 31 Jan 1994 11:09:48 GMT

          From comp.compilers
Related articles
partial redundancy hmcnair@pacific.urbana.mcd.mot.com (1994-01-28)
Re: partial redundancy tthorn@daimi.aau.dk (1994-01-31)
Re: partial redundancy bill@amber.csd.harris.com (1994-01-31)
Re: partial redundancy preston@dawn.cs.rice.edu (1994-02-02)
| List of all articles for this month |
Newsgroups: comp.compilers
From: tthorn@daimi.aau.dk (Tommy Thorn)
Keywords: optimize
Organization: DAIMI, Computer Science Dept. at Aarhus University
References: 94-01-121
Date: Mon, 31 Jan 1994 11:09:48 GMT

Henry McNair (hmcnair@pacific.urbana.mcd.mot.com) wrote:
: [re partial redundancy elimination, have a reference to]


: "Global Optimization by Suppression of Partial
: Redundancies" by Morel and Renvoise in CACM 2/79, and
: "Lazy Code Motion" by Koop, Ruthing and Steffen in
: SIGPLAN PLDI '92.


While I don't know the article in question, I can recommend looking at


        "Value Dependence Graphs: Representation
          Withoiut Taxation" from January POPL or get it from
          research.microsoft.com:/pub/papers/vdg.ps


One of the side effects of their representation is "easy" elimination
of partial redundancies.
--
Tommy.Thorn@daimi.aau.dk Staff-programmer
Aarhus University, Ny Munkegade 116 Phone: +45 89423223
DK-8000 Aarhus C, Denmark. Fax: +45 86135725
--

Post a followup to this message

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