UCLA CS 232 Static Program Analysis Spring 2007
Homework 1
Read the paper by Neal Glew and Jens Palsberg called
Type-safe method inlining.
On p.16, item (36) is a form of constraint generated from
occurrences of "this".
Suppose we don't generate this constraint;
write a program in the example language of the paper
such that (1) the program type checks and
(2) after analysis and transformation, the transformed program
does not type check.
Submit
-
your program,
-
a brief explanation of the intuition why the program will
not type check after analysis and transformation,
-
a note that you have type checked the program using javac,
-
the flow analysis constraints generated from the program,
-
the least solution of the constraints,
-
the transformed program,
-
an explanation of why the transformed program does not type check.