TY - GEN
T1 - Towards a more efficient static software change impact analysis method
AU - Jashki, Mohammad Amin
AU - Zafarani, Reza
AU - Bagheri, Ebrahim
N1 - Copyright:
Copyright 2010 Elsevier B.V., All rights reserved.
PY - 2008
Y1 - 2008
N2 - Impact analysis methods are commonly employed to reduce the likelihood of encountering faulty or unexpected behavior from a software program as a result of developers' oblivious modifications. In this paper, we propose a static impact analysis technique that creates clusters of closely associated software program files based on their co-modification history in the software repository. The proposed method benefits from dimensionality reduction techniques to reduce the complexity of the collected information and perform the impact analysis process faster. The method has been tested on four different open source project repositories, namely Firefox, Firebird, Thunderbird, and FileZilla. The results of the impact analysis method performance in terms of precision (impact set identification accuracy) and execution time cost have been reported in this paper. The proposed method shows promising behavior when used with several specific clustering techniques such as DBscan and X-Means.
AB - Impact analysis methods are commonly employed to reduce the likelihood of encountering faulty or unexpected behavior from a software program as a result of developers' oblivious modifications. In this paper, we propose a static impact analysis technique that creates clusters of closely associated software program files based on their co-modification history in the software repository. The proposed method benefits from dimensionality reduction techniques to reduce the complexity of the collected information and perform the impact analysis process faster. The method has been tested on four different open source project repositories, namely Firefox, Firebird, Thunderbird, and FileZilla. The results of the impact analysis method performance in terms of precision (impact set identification accuracy) and execution time cost have been reported in this paper. The proposed method shows promising behavior when used with several specific clustering techniques such as DBscan and X-Means.
UR - http://www.scopus.com/inward/record.url?scp=77950571121&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77950571121&partnerID=8YFLogxK
U2 - 10.1145/1512475.1512493
DO - 10.1145/1512475.1512493
M3 - Conference contribution
AN - SCOPUS:77950571121
SN - 9781605583822
T3 - ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering
SP - 84
EP - 90
BT - Proceedings of the 2008 SIGSOFT/SIGPLAN Workshop on Program Analysis for Software Tools and Engineering, PASTE '08
T2 - 2008 SIGSOFT/SIGPLAN Workshop on Program Analysis for Software Tools and Engineering, PASTE '08
Y2 - 9 November 2008 through 10 November 2008
ER -