Locating dependence structures using search-based slicing

被引：8

作者：

Jiang, Tao ^{[1
]}

Gold, Nicolas ^{[1
]}

Harman, Mark ^{[1
]}

Li, Zheng ^{[1
]}

机构：

[1] Kings Coll London, London WC2R 2LS, England

来源：

INFORMATION AND SOFTWARE TECHNOLOGY | 2008年 / 50卷 / 12期

基金：

英国工程与自然科学研究理事会;

关键词：

Program slicing; Search-Based Software Engineering;

D O I：

10.1016/j.infsof.2007.11.001

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：1189 / 1209

页数：21

共 77 条

[1] An evolutionary approach to estimating software development projects [J].