|Path flow and Control Flow Problems email@example.com.EDU (1992-12-09)|
|Re: Path flow and Control Flow Problems firstname.lastname@example.org (1992-12-10)|
|From:||email@example.com (Preston Briggs)|
|Organization:||Rice University, Houston|
|Date:||Thu, 10 Dec 1992 16:22:48 GMT|
|Keywords:||analysis, optimize, bibliography|
firstname.lastname@example.org.EDU (Ravishankar) writes:
>I am trying to find out if there are any references on Path analysis of
>Control Flow Graphs. Given a source program ( say, in a language like
>VHDL ), the first step that I am concerned with is the generation the
>Control Flow Graph for the given description
Building the control-flow graph for a given routine is described in many
books on compiler construction. The usual reference is
Compilers: Principles, Techniques, and Tools
Aho, Sethi, and Ullman
Probably Chapter 8, 9, and 10 will help most.
>After the generation of the Control Flow graph, I would have to do an
>analysis and enumerate the set of all "fesable" paths that can be taken
>from the beggining to the end of the program.
You can't simply enumerate all the paths, since loops allow an infinite
number of paths. For example,
procedure zap(integer i);
while i > 0 do
i = i - 1
We can't write down all the paths without knowing something about the
value of "i".
On the other hand, you could give a summary of the possible paths, using,
for example, regular expressions.
title="Summarizing Graphs by Regular Expressions",
booktitle=popl10, % proceedings of POPL 10
Return to the
Search the comp.compilers archives again.