The boolean logic of set sharing analysis

Michael Codish, Harald Søndergaard

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

We show that Jacobs and Langen’s domain for set-sharing analysis is isomorphic to the domain of positive Boolean functions, introduced by Marriott and Sø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’s abstract operations for set sharing in logical form.

Original languageEnglish
Title of host publicationPrinciples of Declarative Programming - 10th International Symposium, PLILP 1998 with 6th International Conference, ALP 1998, Proceedings
EditorsCatuscia Palamidessi, Hugh Glaser, Karl Meinke
PublisherSpringer Verlag
Pages89-101
Number of pages13
ISBN (Print)3540650121, 9783540650126
DOIs
StatePublished - 1 Jan 1998
Event10th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP 1998, Held Jointly with the 6th International Conference, ALP 1998 - Pisa, Italy
Duration: 16 Sep 199818 Sep 1998

Publication series

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

Conference

Conference10th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP 1998, Held Jointly with the 6th International Conference, ALP 1998
Country/TerritoryItaly
CityPisa
Period16/09/9818/09/98

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'The boolean logic of set sharing analysis'. Together they form a unique fingerprint.

Cite this