From http://ols.108.redhat.com/2007/GCC-Reprints/GCC2007-Proceedings.pdf ....(More)

From http://ols.108.redhat.com/2007/GCC-Reprints/GCC2007-Proceedings.pdf . for we are interested in the previously existing dependences at 24 • Using Backward Dynamic Program Slicing to Isolate Influencing Statements in G.D.B the actual step. If the algorithm reaches a breakpoint at some j (or the end of the execution) the actual slices for all defined variables are instantly available. More details on the algorithm can be found in the cited works. The algorithm requires different extensions in order to be applied to a real programming language and environment. In the current version, the GCC/GDB implementation handles C, for which several issues had to be dealt with. The most important enhancement is the handling of data dependences that occur(Less)