Loop-Carried Data Dependencies in Program Slicing

[Jonathan]

In lectures, we were told that when forming slices, loop-carried data
dependencies were supposed to be ignored. However in our lecture slides
and on page 10 of the paper referenced in the lecture notes,
loop-carried data dependencies are clearly included in the slice.
Additionally, unless I am mistaken, the algorithm given also implies
that all flow edges are included.

For the exam, should we just ignore those dependencies?

-Jonathan

[Kostas Kontogiannis]

Hi Jonathan,

In order to compute the slice you do not consider the loop carried. When
yoi select the nodes though and you have computed the slice, you add all
the rest of the "missing" links to come up with a valid "sliced" PDG.

Greetings,

Kostas Kontogiannis

Post by Jonathan
In lectures, we were told that when forming slices, loop-carried data
dependencies were supposed to be ignored. However in our lecture slides
and on page 10 of the paper referenced in the lecture notes,
loop-carried data dependencies are clearly included in the slice.
Additionally, unless I am mistaken, the algorithm given also implies
that all flow edges are included.
For the exam, should we just ignore those dependencies?
-Jonathan