Re: Call Graph construction overhead

[Ondrej Lhotak <olhotak@sable.mcgill.ca>]

On Wed, Feb 25, 2004 at 05:25:29PM +0200, Eran Yahav wrote:
>    Hi,
>    Is there a standard way to filter-out the classes for which the call-graph
>    is constructed?
>    I've seen some previous related correspondence in the list in which Ondrej
>    mentioned some solutions, are these available?
>    It seems to me that the problem of call-graph construction overhead
>    (especially for small input programs) affects all Soot users, so a
>    standard common solution is desirable.

There is no standard way to build an incomplete, optimistic call graph.
Soot always tries to build a conservative one.

If you are interested in an incomplete call graph, you need to somehow
specify in what way it should be incomplete, and this would depend on
your application. So, before implementing a generic solution, we would
need to agree on a way to specify the incompleteness.

I'm open to suggestions. I'd also like to hear about the kinds of
applications you're thinking of for which an incomplete call graph would
be acceptable. My experience is mostly with analyses requiring a
conservative one.

Ondrej

>     
>    Thanks,
>    Eran