|Regarding transforming Control Flow Graph email@example.com (Deep.V...@gmail.com) (2005-04-11)|
|Re: Regarding transforming Control Flow Graph firstname.lastname@example.org (Aaron Gray) (2005-04-16)|
|Date:||11 Apr 2005 00:22:29 -0400|
|Posted-Date:||11 Apr 2005 00:22:29 EDT|
I am doing a project where I have to modify the program so that only
subset of its path are retained and remove rest of the portions.
For this I have to modify the control flow graph retaining necessary
paths and pruning rest. What are the suffecient criterion to say that
the transformations are legible. Some of them which I can think are-
retaining dependencies, ensure return values.
Is there any criterion which I have to prove (to be valid), for arguing
that my transformations are correct.
Return to the
Search the comp.compilers archives again.