[Soot-list] Pointer analysis for precise call graph generation

[Eric Bodden]

Hello.

YEs, reading the thesis is definitely a good idea.

>> Basically, If I wish to generate a call graph using the output of
>> Spark's points to analysis , without using the CallGraphBuilder used to
>> build the Graph , and without on the fly option , I will also face the
>> same problem as above. My aim is to use the Points to analysis and then
>> build a Precise call graph using the output. Please help me on this.

I am not sure that makes much sense. Spark usually does an indirect
recursion. New points-to sets lead to new call edges which lead to
larger points-to sets etc. This iteration makes it quite precise. In
what you are proposing you'd need to start with an imprecise points-to
analysis (as you have no call-graph to begin with) and would then use
those imprecise sets to compute a call graph. IMHO that can only make
things worse. What's wrong with using Spark's call graph as is?

Eric