Negative ternary set-sharing

Trias, Eric and Navas, J. and Ackley, Elena S. and Forrest, Stephanie (2009). Negative ternary set-sharing. In: "24th International Conference on Logic Programming", December 9-13 2008, Udine, Italy. ISBN 978-3-540-89981-5.


Title: Negative ternary set-sharing
  • Trias, Eric
  • Navas, J.
  • Ackley, Elena S.
  • Forrest, Stephanie
Item Type: Presentation at Congress or Conference (Article)
Event Title: 24th International Conference on Logic Programming
Event Dates: December 9-13 2008
Event Location: Udine, Italy
Title of Book: Logic Programming
Date: 2009
ISBN: 978-3-540-89981-5
Volume: 5366
Faculty: Facultad de Informática (UPM)
Department: Inteligencia Artificial
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (951kB) | Preview


The Set-Sharing domain has been widely used to infer at compiletime interesting properties of logic programs such as occurs-check reduction, automatic parallelization, and flnite-tree analysis. However, performing abstract uniflcation in this domain requires a closure operation that increases the number of sharing groups exponentially. Much attention has been given to mitigating this key inefflciency in this otherwise very useful domain. In this paper we present a novel approach to Set-Sharing: we define a new representation that leverages the complement (or negative) sharing relationships of the original sharing set, without loss of accuracy. Intuitively, given an abstract state sh\> over the finite set of variables of interest V, its negative representation is p(V) \ shy. Using this encoding during analysis dramatically reduces the number of elements that need to be represented in the abstract states and during abstract uniflcation as the cardinality of the original set grows toward 2 . To further compress the number of elements, we express the set-sharing relationships through a set of ternary strings that compacts the representation by eliminating redundancies among the sharing sets. Our experiments show that our approach can compress the number of relationships, reducing signiflcantly the memory usage and running time of all abstract operations, including abstract uniflcation.

More information

Item ID: 14307
DC Identifier:
OAI Identifier:
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 18 Jan 2013 08:37
Last Modified: 21 Apr 2016 13:54
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Recolecta
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM