dataflow visualization tool available

We have developed a tool to graphically display solutions to
data-flow equations given a flow graph, a list of simple assignments
at each node, and a system of data-flow equations. We have used this
in a class to show how data-flow systems converge, for instance. We
have also demonstrated that the Morel/Renvoise partial redundancy
elimination method is not really bidirectional, and when cast in
terms of edges the forward component vanishes completely; in the
Knoop, Ruthing, Steffan Safe/Earliest formulation of PRE, the
Earliest system can be solved as a direct equation given the solution
to the Safe system.


Our system uses X-windows and the Motif library; it is written in C++
with a lex/yacc parser. More information, and a sample image, as
well as a pointer to the source via anonymous ftp are available at
http://www.cse.ogi.edu/Sparse/dflo.html


--
- Michael Wolfe


--

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