[Soot-list] Cycle detection in pointer analysis

[Dimitrios Prountzos]

Hi,

I was looking at the code that propagates points-to sets
using on-line cycle detection, based on the Heintze and
Tardieu algorithm (spark/solver/PropCycle.java) and I
got the impression that in the current implementation
there is no attempt to collapse cycles. In particular,
in the computeP2Set() method, the only statement that
tries to merge nodes is in comments.
If this is indeed the case, would it be enough to just
remove the comment from the specific statement, or does
it require more work to support cycle elimination?

Thank you,

Dimitris