King's College London

Research portal

Locating dependence structures using search-based slicing

Research output: Contribution to journalArticle

Standard

Locating dependence structures using search-based slicing. / Jiang, Tao; Gold, Nicolas; Harman, Mark; Li, Zheng.

In: INFORMATION AND SOFTWARE TECHNOLOGY, Vol. 50, No. 12, 11.2008, p. 1189 - 1209.

Research output: Contribution to journalArticle

Harvard

Jiang, T, Gold, N, Harman, M & Li, Z 2008, 'Locating dependence structures using search-based slicing', INFORMATION AND SOFTWARE TECHNOLOGY, vol. 50, no. 12, pp. 1189 - 1209. https://doi.org/10.1016/j.infsof.2007.11.001

APA

Jiang, T., Gold, N., Harman, M., & Li, Z. (2008). Locating dependence structures using search-based slicing. INFORMATION AND SOFTWARE TECHNOLOGY, 50(12), 1189 - 1209. https://doi.org/10.1016/j.infsof.2007.11.001

Vancouver

Jiang T, Gold N, Harman M, Li Z. Locating dependence structures using search-based slicing. INFORMATION AND SOFTWARE TECHNOLOGY. 2008 Nov;50(12):1189 - 1209. https://doi.org/10.1016/j.infsof.2007.11.001

Author

Jiang, Tao ; Gold, Nicolas ; Harman, Mark ; Li, Zheng. / Locating dependence structures using search-based slicing. In: INFORMATION AND SOFTWARE TECHNOLOGY. 2008 ; Vol. 50, No. 12. pp. 1189 - 1209.

Bibtex Download

@article{7f283e123b104cb5a748339971e1270e,
title = "Locating dependence structures using search-based slicing",
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. (c) 2007 Elsevier B.V. All rights reserved.",
author = "Tao Jiang and Nicolas Gold and Mark Harman and Zheng Li",
year = "2008",
month = nov,
doi = "10.1016/j.infsof.2007.11.001",
language = "English",
volume = "50",
pages = "1189 -- 1209",
journal = "INFORMATION AND SOFTWARE TECHNOLOGY",
issn = "0950-5849",
publisher = "Elsevier",
number = "12",

}

RIS (suitable for import to EndNote) Download

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

SN - 0950-5849

IS - 12

ER -

View graph of relations

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