@inproceedings{f01e79c021734f3c9547ac46f8cb5f43,
title = "The boolean logic of set sharing analysis",
abstract = "We show that Jacobs and Langen{\textquoteright}s domain for set-sharing analysis is isomorphic to the domain of positive Boolean functions, introduced by Marriott and S{\o}ndergaard for groundness dependency analysis. Viewing a set-sharing description as a minterm representation of a Boolean function leads to re-casting sharing analysis as an instantiation dependency analysis. The key idea is to view the sets of variables in a sharing domain element as the models of a Boolean function. In this way, sharing sets are precisely dual negated positive Boolean functions. This new view improves our understanding of sharing analysis considerably and opens up new avenues for the efficient implementation of this kind of analysis, for example using ROBDDs. To this end we express Jacobs and Langen{\textquoteright}s abstract operations for set sharing in logical form.",
author = "Michael Codish and Harald S{\o}ndergaard",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1998.; 10th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP 1998, Held Jointly with the 6th International Conference, ALP 1998 ; Conference date: 16-09-1998 Through 18-09-1998",
year = "1998",
month = jan,
day = "1",
doi = "10.1007/bfb0056609",
language = "English",
isbn = "3540650121",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "89--101",
editor = "Catuscia Palamidessi and Hugh Glaser and Karl Meinke",
booktitle = "Principles of Declarative Programming - 10th International Symposium, PLILP 1998 with 6th International Conference, ALP 1998, Proceedings",
address = "Germany",
}