On the interaction between sharing and linearity

Details On the interaction between sharing and linearity On the interaction between sharing and linearity

2007-10-02

arxiv.org/abs/0710.0528v2

Computer Science

Programming Languages

Scientific paper

In the analysis of logic programs, abstract domains for detecting sharing and linearity information are widely used. Devising abstract unification algorithms for such domains has proved to be rather hard. At the moment, the available algorithms are correct but not optimal, i.e., they cannot fully exploit the information conveyed by the abstract domains. In this paper, we define a new (infinite) domain ShLin-w which can be thought of as a general framework from which other domains can be easily derived by abstraction. ShLin-w makes the interaction between sharing and linearity explicit. We provide a constructive characterization of the optimal abstract unification operator on ShLin-w and we lift it to two well-known abstractions of ShLin-w. Namely, to the classical Sharing X Lin abstract domain and to the more precise ShLin-2 abstract domain by Andy King. In the case of single binding substitutions, we obtain optimal abstract unification algorithms for such domains. To appear in Theory and Practice of Logic Programming (TPLP).

Affiliated with

Also associated with

No associations

Rating

On the interaction between sharing and linearity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the interaction between sharing and linearity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the interaction between sharing and linearity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-7343