Title: Search based dependence analysis
Tao Jiang

Abstract

I will talk about my PhD topic "search based dependence
analysis". This topic includes two aspects--framework of software
engineering and program slicing techniques.  The topic introduces an
approach to locating dependence structures in a program by searching
the space of the powerset of the set of all possible program
slices. In the first step, The problem as a search based software
engineering problem is formulated and, to evaluate the approach, the
paper introduces an instance of a search based slicing problem
concerned with locating sets of slices that decompose a program into a
set of covering slices that minimize inter-slice overlap. As a result,
it is proved that the topic is applicable. On the basis of the
methodology, I would like to formulate a new idea that refactoring the
function gets higher cohesion level using search based slicing, that
is, using sets of slices represents the computing elements in order to
re-construct the function without changing the semantics of the
function.