DEPARTMENT OF COMPUTER SCIENCE
DOCTORAL DISSERTATION DEFENSE


Candidate: Georgios Papadopoulos
Advisor: Prof. Malcolm Harrison

Dataflow Analysis of Logic Programs
using Typed Domains

11:00 a.m., Monday, April 26, 1993
12th floor conference room, 719 Broadway




Abstract

Dataflow analysis for logic programming languages has been collecting information about properties of whole terms. As a result pessimistic assumptions had to be made about the substerms of a term, missing information that could be used for better compiler optimization and partial evaluation.

We use type information to divide each term into sets of subterms (t-terms) and then collect dataflow information for these sets. We identify and solve several problems as we develop a new sharing analysis for logic programs using our t-terms in a denotational abstract interpretation framework.