Locating dependence structures using search-based slicing

TY - JOUR

T1 - Locating dependence structures using search-based slicing

AU - Jiang, Tao

AU - Gold, Nicolas

AU - Harman, Mark

AU - Li, Zheng

PY - 2008/11

Y1 - 2008/11

N2 - 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. (c) 2007 Elsevier B.V. All rights reserved.

AB - 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. (c) 2007 Elsevier B.V. All rights reserved.

U2 - 10.1016/j.infsof.2007.11.001

DO - 10.1016/j.infsof.2007.11.001

M3 - Article

VL - 50

SP - 1189

EP - 1209

JO - INFORMATION AND SOFTWARE TECHNOLOGY

JF - INFORMATION AND SOFTWARE TECHNOLOGY

IS - 12

ER -