Please use this identifier to cite or link to this item:
|Title:||Iterative context-aware feature location (NIER track)||Authors:||Peng, X.
|Issue Date:||2011||Citation:||Peng, X.,Xing, Z.,Tan, X.,Yu, Y.,Zhao, W. (2011). Iterative context-aware feature location (NIER track). Proceedings - International Conference on Software Engineering : 900-903. ScholarBank@NUS Repository. https://doi.org/10.1145/1985793.1985939||Abstract:||Locating the program element(s) relevant to a particular feature is an important step in efficient maintenance of a software system. The existing feature location techniques analyze each feature independently and perform a one-time analysis after being provided an initial input. As a result, these techniques are sensitive to the quality of the input, and they tend to miss the nonlocal interactions among features. In this paper, we propose to address the proceeding two issues in feature location using an iterative context-aware approach. The underlying intuition is that the features are not independent of each other, and the structure of source code resembles the structure of features. The distinguishing characteristics of the proposed approach are: 1) it takes into account the structural similarity between a feature and a program element to determine their relevance; 2) it employs an iterative process to propagate the relevance of the established mappings between a feature and a program element to the neighboring features and program elements. Our initial evaluation suggests the proposed approach is more robust and can significantly increase the recall of feature location with a slight decrease in precision. © 2011 ACM.||Source Title:||Proceedings - International Conference on Software Engineering||URI:||http://scholarbank.nus.edu.sg/handle/10635/40280||ISBN:||9781450304450||ISSN:||02705257||DOI:||10.1145/1985793.1985939|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 15, 2019
checked on May 11, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.