This is Enea.


Personal Info





Widening Sharing (AGP'99)

[Page last updated on "January 13, 2005, 15:31:42".]

Enea Zaffanella, Roberto Bagnara, and Patricia M. Hill


We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither plain Sharing nor its non-redundant (but equivalent) abstraction scale well to real programs, we consider the domain proposed by C. Fecht [1, 2]. This domain consists of a combination of Pos with a quite weak abstraction of Sharing. While verifying that this domain is truly remarkable, in terms of both precision and efficiency, we have revealed significant precision losses for several real programs. This loss concerns groundness, pair-sharing and linearity. We define a simple domain for sharing analysis that supports the implementation of several widening techniques. In particular, with this domain it is straightforward to turn Fecht's idea into a proper widening. More precise widenings are also considered. However, in spite of thorough experimentation we found that, provided Pos is included in the domain, the first widening we propose is hard to improve on.


C. Fecht.

An efficient and precise sharing domain for logic programs.
In H. Kuchen and S. D. Swierstra, editors, Programming Languages: Implementations, Logics and Programs, Proceedings of the Eighth International Symposium, volume 1140 of Lecture Notes in Computer Science, pages 469--470, Aachen, Germany, 1996. Springer-Verlag, Berlin.
C. Fecht.

Efficient and precise sharing domains for logic programs.
Technical Report A/04/96, Universität des Saarlandes, Fachbereich 14 Informatik, Saarbrücken, Germany, 1996.

Available: PDF, 300 DPI, 600 DPI, and 1200 DPI PostScript, DVI, and BibTeX entry.
© Enea Zaffanella

| Home | Personal Info | Research | Papers | Teaching | About