@Inproceedings{Arm-Mar-Sch-Son:SAS94,
  author   = {T. Armstrong and K. Marriott and P. Schachte and 
		H. S{\o}ndergaard},
  title    = {{Boolean} Functions for Dependency Analysis:
            	Algebraic Properties and Efficient Representation},
  editor   = {B. {Le Charlier}},
  booktitle= {Static Analysis: Proceedings of the First International 
		Symposium},
  series   = {Lecture Notes in Computer Science},
  volume   = {864},
  pages    = {266--280},
  publisher= {Springer-Verlag},
  year     = {1994},
  abstract = {Many analyses for logic programming languages use
	      Boolean functions to express dependencies
	      between variables or argument positions.
	      Examples include groundness analysis, arguably the most 
	      important analysis for logic programs, finiteness analysis 
	      and functional dependency analysis.
	      We identify two classes of Boolean functions that
	      have been used: positive and definite functions, and we
	      systematically investigate these classes and their 
	      efficient implementation for dependency analyses.
	      We provide syntactic characterizations and study their 
	      algebraic properties. 
	      In particular, we show that both classes are closed under 
 	      existential quantification.
	      We investigate representations for these classes based on:
	      reduced ordered binary decision diagrams (ROBDDs),
	      disjunctive normal form, conjunctive normal form,
	      Blake canonical form, dual Blake canonical form,
	      and a form specific to definite functions.
	      We give an  empirical comparison of these
	      different representations for groundness analysis.
             },
}