The INI has a new website!

This is a legacy webpage. Please visit the new site to ensure you are seeing up to date information.

Isaac Newton Institute for Mathematical Sciences

Semantics of Computation

1 July - 31 December 1995

Organisers: S Abramsky (Imperial College, London), G Kahn (INRIA, Sophia-Antipolis), J C Mitchell (Stanford), A M Pitts (Cambridge)

Semantics of Computation

Friday August 4, 14:15 pm

Semantics-based analysis of (constraint) logic programs

Harald Sondergaard
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.

Copyright © Isaac Newton Institute