1 July - 31 December 1995
Organisers: S Abramsky (Imperial College, London), G Kahn (INRIA, Sophia-Antipolis), J C Mitchell (Stanford), A M Pitts (Cambridge)
Friday August 4, 14:15 pm
The University of Melbourne
Abstract interpretation has proved an invaluable tool for the analysis and transformation of (constraint) logic programs. The talk will give a brief introduction to abstract interpretation of logic programs and outline the wide range of applications. I will show a "groundness dependency analysis" in some detail, since its use of Boolean functions as "abstract constraints" is both illuminating and appealing, and similar ideas may have applications in other programming language paradigms as well. If time permits, I will discuss a variety of sub-classes of Boolean functions that seem useful in dataflow analysis.