1. T. Armstrong, K. Marriott, P. Schachte, and H. Søndergaard. Two Classes of Boolean Functions for Dependency Analysis. Technical Report 94/10, Dept. of Computer Science, The University of Melbourne, Australia, 1994.
2. N. Baker and H. Søndergaard. Definiteness analysis for CLP(-280-01). In G. Gupta, G. Mohay and R. Topor, editors, Proc. Sixteenth Australian Computer Science Conf., pages 321–332. Brisbane, Qld., January 1993.
3. P. Bigot, S. Debray and K. Marriott. Understanding finiteness analysis using abstract interpretation. In K. Apt, editor, Logic Programming: Proc. Joint Int. Conf. Symp., pages 735–749. MIT Press, 1992.
4. K. Brace, R. Rudell and R. Bryant. Efficient implementation of a BDD package. Proc. 27th ACM/IEEE Design Automation Conf., pages 40–45. IEEE Comp. Soc. Press, 1990.
5. F. M. Brown. Boolean Reasoning: The Logic of Boolean Equations. Kluwer Academic Publ., 1990.