Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!uunet!bloom-beacon!spdcc!ima!esegue!compilers-sender
From: preston@rice.edu (Preston Briggs)
Newsgroups: comp.compilers
Subject: Re: use-def chains
Message-ID: <1989Sep27.004524.5155@esegue.segue.boston.ma.us>
Date: 27 Sep 89 00:45:24 GMT
Sender: compilers-sender@esegue.segue.boston.ma.us
Reply-To: Preston Briggs 
Organization: Rice University, Houston
Lines: 32
Approved: compilers@esegue.segue.boston.ma.us

In article <1989Sep20.193824.999@esegue.segue.boston.ma.us> you write:
>Static single assignment is very nice.  We have been using it in our

Several people wrote in response to my original query (Thanks!).
Many wondered about references to static single assignment (SSA).
Here's the ref's I know of, for general consumption:

	Alpern, Wegman, Zadeck
	"Detecting equality of values in programs"
	Proceedings of 15th POPL, 1988

	Rosen, Wegman, Zadeck
	"Global value numbers and redundant computations"
	Proceedings of 15th POPL, 1988

	Cytron, Ferrante, Rosen, Wegman, Zadeck
	"An efficient method of computing static single assignment form"
	Proceedings of 16th POPL, 1989

where POPL is Principles of Programming Languages.

The last paper is a way to compute the form.  The others are ways to
use it.  Generally, SSA seems like a feasible replacement for use-def
or def-use chains in (perhaps) any application.  In many cases, it
seems to lead to asymptotic time improvements.

Preston Briggs
[From Preston Briggs ]
-- 
Send compilers articles to compilers@esegue.segue.boston.ma.us
{spdcc | ima | lotus}!esegue.  Meta-mail to compilers-request@esegue.
Please send responses to the author of the message, not the poster.