Negative ternary set-sharing

Eric Trias, Jorge Navas, Elena S. Ackley, Stephanie Forrest, M. Hermenegildo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The Set-Sharing domain has been widely used to infer at compile-time interesting properties of logic programs such as occurs-check reduction, automatic parallelization, and finite-tree analysis. However, performing abstract unification in this domain requires a closure operation that increases the number of sharing groups exponentially. Much attention has been given to mitigating this key inefficiency 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 over the finite set of variables of interest , its negative representation is . Using this encoding during analysis dramatically reduces the number of elements that need to be represented in the abstract states and during abstract unification as the cardinality of the original set grows toward . 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 significantly the memory usage and running time of all abstract operations, including abstract unification.

Original languageEnglish (US)
Title of host publicationLogic Programming - 24th International Conference, ICLP 2008, Proceedings
Pages301-316
Number of pages16
DOIs
StatePublished - Dec 1 2008
Externally publishedYes
Event24th International Conference on Logic Programming, ICLP 2008 - Udine, Italy
Duration: Dec 9 2008Dec 13 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5366 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other24th International Conference on Logic Programming, ICLP 2008
CountryItaly
CityUdine
Period12/9/0812/13/08

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Negative ternary set-sharing'. Together they form a unique fingerprint.

  • Cite this

    Trias, E., Navas, J., Ackley, E. S., Forrest, S., & Hermenegildo, M. (2008). Negative ternary set-sharing. In Logic Programming - 24th International Conference, ICLP 2008, Proceedings (pp. 301-316). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5366 LNCS). https://doi.org/10.1007/978-3-540-89982-2_30