@Article{Cod-Son-Stu:TOPLAS99,
  author   = {M. Codish and H. S{\o}ndergaard and P. J. Stuckey},
  title    = {Sharing and Groundness Dependencies in Logic Programs},
  journal  = {ACM Transactions on Programming Languages and Systems},
  volume   = {21},
  number   = {5},
  pages    = {948--976},
  year     = {1999},
  abstract = {We investigate Jacobs and Langen's \textsf{Sharing} domain, 
		introduced for the analysis of variable sharing in logic 
		programs, and show that it is isomorphic to Marriott and 
		S{\o}ndergaard's \textsf{Pos} domain, introduced for the 
		analysis of groundness dependencies.  Our key idea
		is to view the sets of variables in a \textsf{Sharing} 
		domain element as the models of a corresponding Boolean 
		function.  This leads to a recasting of sharing analysis 
		in terms of the property of ``not being affected by the 
		binding of a \emph{single} variable.''  Such an
		``unaffectedness dependency'' analysis has close 
		connections with groundness dependency analysis using 
		positive Boolean functions.  This new view improves our 
		understanding of sharing analysis, and leads to an elegant
		expression of its combination with groundness dependency
		analysis based on the reduced product of \textsf{Sharing} 
		and \textsf{Pos}.  It also opens up new avenues for the 
		efficient implementation of sharing analysis, for example 
		using reduced order binary decision diagrams, as well as
		efficient implementation of the reduced product, using 
		domain factorizations.},
}