TY - GEN
T1 - Negative ternary set-sharing
AU - Trias, Eric
AU - Navas, Jorge
AU - Ackley, Elena S.
AU - Forrest, Stephanie
AU - Hermenegildo, M.
N1 - Funding Information:
The authors gratefully acknowledge the support of the National Science Foundation (grants CCR-0331580 and CCR-0311686, and DBI-0309147), the Santa Fe Institute, the Air Force Institute of Technology, the Prince of Asturias Chair in Information Science and Technology at UNM, and by EU projects 215483 S-Cube, IST-15905 MOBIUS, Spanish projects ITEA2/PROFIT FIT-340005-2007-14 ES_PASS, MEC TIN2005-09207-C03-01 MERIT/COMVERS, and Comunidad de Madrid project S-0505/TIC/0407 PROMESAS.
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=58549117767&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=58549117767&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-89982-2_30
DO - 10.1007/978-3-540-89982-2_30
M3 - Conference contribution
AN - SCOPUS:58549117767
SN - 3540899812
SN - 9783540899815
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 301
EP - 316
BT - Logic Programming - 24th International Conference, ICLP 2008, Proceedings
T2 - 24th International Conference on Logic Programming, ICLP 2008
Y2 - 9 December 2008 through 13 December 2008
ER -