CSE647: Robust (Distributed) Software (Spring 2002) Scott Stoller Homework 6 Due: 29 April This homework is about: John Whaley and Martin Rinard, Compositional pointer and escape analysis for Java programs. In Proceedings of the 14th Annual ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA), 1999. 1. Give a program such that, in the PTE graph for some analysis scope of that program, some object may be represented by both an inside node and a parameter node. Or, argue briefly that this is impossible. If it is possible, show the PTE graph for the appropriate analysis scope, and explain briefly why it satisfies the above requirement. You do not need to describe the execution of the analysis algorithm that produced the PTE graph. Make the program as small and simple as possible. Your program may contain 1 or more methods, as needed. A program that has more than about 6 statements total in all methods is unnecessarily complicated. Express the program as a control flow graph whose nodes are labeled with statements of the kind in section 4.1. You do not need to give the corresponding Java program. 2. Same, except for inside node and load node. 3. Same, except for load node and return node.