Venkat Chakaravarthy (UW-Madison):
Computability and Complexity of Pointer Analysis
Given a program and two variables p and q, the aim of pointer analysis
is to check if there is some execution of the program
that would make p point to q. The problem plays an important role in compiler
optimization. In this talk, we will discuss some known and new
results on the computability and complexity of several variations of this
problem. My main aim is to draw your attention to some elegant and challenging
open problems in this area. Some of these problems have immediate practical
applications.