[Soot-list] Use soot to output flow-sensitive points-to graphs for a tiny list inverse procedure

[Eric Bodden]

Hi Zell.

LocalMustAliasAnalysis has a constructor with an extra boolean
"tryTrackFieldAssignments". If you set that to true then field
assignments are tracked as well. Note that this is sound only for
sequential (i.e., non-concurrent) programs. You can use InstanceKeys
in combination with such an analysis.

Eric

On 23 April 2012 11:11, Z <zell08v at orange.fr> wrote:
> Hi,
>
> Can SOOT give an  intra-procedural flow-sensitive points-to analysis for a
> tiny list-inverse procedure,
>
> j = null;
> while i != null do
>    k = i.n;
>   i.n = j;
>   j = i;
>   i = k;
> end while
>
> (code copied from the paper  "Storeless semantics and alias logic" )
>
> This should be the smallest bench for any pointer analysis. Can SOOT gives a
> precise points-to graph for each program point of this example? If I
> understand correctly, SPARK and PADDLE are flow-insensitive, the analysis
> under
>
> soot.jimple.toolkits.pointer.InstanceKey
>
> are only for local variables but not for heap?
>
> Thanks.
> Zell.
>
>
>
> _______________________________________________
> Soot-list mailing list
> Soot-list at sable.mcgill.ca
> http://mailman.cs.mcgill.ca/mailman/listinfo/soot-list
>



-- 
Eric Bodden, Ph.D., http://bodden.de/
Head of Secure Software Engineering Group at EC SPRIDE
Principal Investigator in Secure Services at CASED
Tel: +49 6151 16-75422    Fax: +49 6151 16-72051
Room 3.2.14, Mornewegstr. 30, 64293 Darmstadt