{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T21:01:15Z","timestamp":1750453275434,"version":"3.41.0"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"1-2","license":[{"start":{"date-parts":[[2005,1,10]],"date-time":"2005-01-10T00:00:00Z","timestamp":1105315200000},"content-version":"unspecified","delay-in-days":9,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2005,1]]},"abstract":"<jats:p><jats:inline-formula>$\\textup{\\textsf{Sharing}}$<\/jats:inline-formula>, an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs, derives useful aliasing information. It is well-known that a commonly used core of techniques, such as the integration of <jats:inline-formula>$\\textup{\\textsf{Sharing}}$<\/jats:inline-formula> with freeness and linearity information, can significantly improve the precision of the analysis. However, a number of other proposals for refined domain combinations have been circulating for years. One feature that is common to these proposals is that they do not seem to have undergone a thorough experimental evaluation even with respect to the expected precision gains. In this paper we experimentally evaluate: helping <jats:inline-formula>$\\textup{\\textsf{Sharing}}$<\/jats:inline-formula> with the definitely ground variables found using <jats:inline-formula>$\\textit{Pos}$<\/jats:inline-formula>, the domain of positive Boolean formulas; the incorporation of explicit structural information; a full implementation of the reduced product of <jats:inline-formula>$\\textup{\\textsf{Sharing}}$<\/jats:inline-formula> and <jats:inline-formula>$\\textit{Pos}$<\/jats:inline-formula>; the issue of reordering the bindings in the computation of the abstract <jats:inline-formula>$\\mgu$<\/jats:inline-formula>; an original proposal for the addition of a new mode recording the set of variables that are deemed to be ground or free; a refined way of using linearity to improve the analysis; the recovery of hidden information in the combination of <jats:inline-formula>$\\textup{\\textsf{Sharing}}$<\/jats:inline-formula> with freeness information. Finally, we discuss the issue of whether tracking compoundness allows the computation of more sharing information.<\/jats:p>","DOI":"10.1017\/s1471068404001978","type":"journal-article","created":{"date-parts":[[2005,1,10]],"date-time":"2005-01-10T13:20:25Z","timestamp":1105363225000},"page":"1-43","source":"Crossref","is-referenced-by-count":11,"title":["Enhanced sharing analysis techniques: a comprehensive evaluation"],"prefix":"10.1017","volume":"5","author":[{"given":"ROBERTO","family":"BAGNARA","sequence":"first","affiliation":[]},{"given":"ENEA","family":"ZAFFANELLA","sequence":"additional","affiliation":[]},{"given":"PATRICIA M.","family":"HILL","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2005,1,10]]},"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068404001978","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T20:16:26Z","timestamp":1750450586000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068404001978\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":0,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["S1471068404001978"],"URL":"https:\/\/doi.org\/10.1017\/s1471068404001978","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2005,1]]}}}