Publication View

Locating dependence structures using search based slicing (2009)

Abstract

This paper 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. The paper formulates this problem as a search based software engineering problem. 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. The paper reports the result of an empirical study of algorithm performance and result-similarity for hill climbing, genetic, random search and greedy algorithms applied to a set of 12 C programs.

Publication details

Download	http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.4359
Source	http://www.dcs.kcl.ac.uk/pg/jiangtao/MinorRevisionIST.pdf
Contributors	CiteSeerX
Repository	CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Type	text
Language	English
Relation	10.1.1.50.4405, 10.1.1.39.1532, 10.1.1.115.298, 10.1.1.45.9928, 10.1.1.129.179, 10.1.1.31.6060, 10.1.1.13.9028, 10.1.1.23.4224, 10.1.1.13.1586, 10.1.1.139.2982, 10.1.1.55.8094, 10.1.1.72.5916, 10.1.1.53.3830, 10.1.1.55.5797, 10.1.1.8.5883, 10.1.1.28.3469, 10.1.1.11.478, 10.1.1.20.2969, 10.1.1.51.1435, 10.1.1.10.3026, 10.1.1.12.5095, 10.1.1.21.7243, 10.1.1.70.349, 10.1.1.7.3651, 10.1.1.144.5252, 10.1.1.53.6942, 10.1.1.61.3246, 10.1.1.130.2604, 10.1.1.136.8460, 10.1.1.63.8069, 10.1.1.113.1742, 10.1.1.80.6822, 10.1.1.99.9449, 10.1.1.138.2505