INTRODUCTION

My research for the summer invovles implementing, testing, and evaluating an incremental call graph update algorithm devised by Professor Souter for her dissertation. The overall goal is to experimentally evaluate this algorithm, Del_Call_Site, for object-oriented languages.

The algorithm takes in a template call graph initally constructed using the exhaustive Cartesian Product Algorithm, the method being edited, and a deleted call site within that method. It then incrementally produces an updated call graph. Previous research indicates that this incremental approach saves time versus exhaustive reconstruction and easily indicates the potentially affected regions in which to begin reanalysis; my work will help to determine the future of Del_Call_Site and similar algorithms.

TASKS INVOLVED

Learn Java Explore and gain familiarity with the FLEX compiler Gain knowledge of call graph algorithms for object-oriented programs Implement the call graph construction algorithm Conduct tests to experimentally evaluate the usefulness of the algorithm JAVA RESOURCES java.sun.com Java Tutorial Bruce Eckel's MindView, Inc. Exceptional Learning Experiences FLEX Compiler Infrastructure FLEX Package/Class Overview Java 2 Platform, Standard Edition, v 1.4.0 API Specification

Working hard

INCREMENTAL CALL GRAPH RECONSTRUCTION
AND DELETING A CALL SITE