[Soot-list] Intersection of two PointsTo-sets

[Eric Bodden]

In fact I found a way to get around it by an implementation similar to
the "Union" class in Soot, i.e. I do not actually compute the
intersection but rather implement it as decorator for two points-to
sets. That seems to work fine.

Eric


> -----Original Message-----
> From: Ondrej Lhotak [mailto:olhotak at uwaterloo.ca]
> Sent: Monday, July 17, 2006 3:56 PM
> To: Eric Bodden
> Cc: soot-list at sable.mcgill.ca
> Subject: Re: [Soot-list] Intersection of two PointsTo-sets
> 
> On Sun, Jul 16, 2006 at 04:34:34PM -0400, Eric Bodden wrote:
> > Hello.
> >
> > One quick question: Is there no predefined way to calculate the
> > intersection of two PointsTo-sets? I mean I know how to check for
> > nonempty intersection but for my purposes I want to store the
> > intersection if it exists.
> 
> There is no existing implementation in Soot, as far as I know. I don't
> remember anyone ever needing one before.
> 
> Ondrej
> 
> >
> > Cheers,
> > Eric
> >
> > --
> > Eric Bodden
> > Sable Research Group, McGill University Montreal, Canada
> >
> >
> > _______________________________________________
> > Soot-list mailing list
> > Soot-list at sable.mcgill.ca
> > http://mailman.cs.mcgill.ca/mailman/listinfo/soot-list
> >