|Help with alias analysis framework email@example.com (2004-08-13)|
|Re: Help with alias analysis framework firstname.lastname@example.org (Roberto Bagnara) (2004-08-15)|
|Date:||13 Aug 2004 17:25:16 -0400|
|Posted-Date:||13 Aug 2004 17:25:16 EDT|
In the paper "Interprocedural may-alias analysis for pointers: beyond
k-limiting", the author presents a parametric framework for the
analysis of pointer aliases.
The framework is parametrised by a numeric lattice V#.
The lattice has to have some abstract operators; the 4th are 5th are
for me the most complex:
4) resolution of a linear system: given a system S, I need to compute
a member of the lattice which is an upper approximation of the integer
solutions to S;
5) intersection with a linear system: if S is a system of linear
equations and K is a member of the lattice, I need to compute an upper
approximation of the solutions to S that are also in K (no empty
intersection with K I guess).
I need to implement the lattice operators, but I have no idea of how
to do this. Probably using Fourier-Motzkin projection I can solve the
problem for the lattice obtained by the smash product of the interval
lattice (any other, more efficient method?), but how can this problem
be solved for a generic lattice?
Can someone point out to me some documentation and (if available code
implemenation) explaining how to solve this problem for a generic
Thanks in advance for your help.
Return to the
Search the comp.compilers archives again.