King's College London

Research portal

Locating dependence structures using search-based slicing

Research output: Contribution to journalArticle

Tao Jiang, Nicolas Gold, Mark Harman, Zheng Li

Original languageEnglish
Pages (from-to)1189 - 1209
Number of pages21
Issue number12
PublishedNov 2008

King's Authors


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.

View graph of relations

© 2018 King's College London | Strand | London WC2R 2LS | England | United Kingdom | Tel +44 (0)20 7836 5454