Code Change Sniffer: Predicting Future Code Changes With Markov Chain
Loading...
Date
Authors
Ufuktepe, Ekincan
Tuğlular, Tuğkan
Journal Title
Journal ISSN
Volume Title
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
Code changes are one of the essential processes of software evolution. These changes are performed to fix bugs, improve quality of software, and provide a better user experience. However, such changes made in code could lead to ripple effects that can cause unwanted behavior. To prevent such issues occurring after code changes, code change prediction, change impact analysis techniques are used. The proposed approach uses static call information, forward slicing, and method change information to build a Markov chain, which provides a prediction for code changes in the near future commits. For static call information, we utilized and compared call graph and effect graph. We performed an evaluation on five open-source projects from GitHub that varies between 5K-26K lines of code. To measure the effectiveness of our proposed approach, recall, precision, and f-measure metrics have been used on five open-source projects. The results show that the Markov chain that is based on call graph can have higher precision compared to effect graph. On the other hand, for small number of cases higher recall values are obtained with effect graph compared to call graph. With a Markov chain model based on call graph and effect graph, we can achieve recall values between 98%-100%. © 2021 IEEE.
Description
45th IEEE Annual Computers, Software, and Applications Conference, COMPSAC 2021 -- 12 July 2021 through 16 July 2021
Keywords
Change impact analysis, Change propagation prediction, Markov chains, Software evolution
Fields of Science
0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
Citation
WoS Q
Scopus Q

OpenCitations Citation Count
5
Volume
Issue
Start Page
1014
End Page
1019
PlumX Metrics
Citations
CrossRef : 4
Scopus : 5
Captures
Mendeley Readers : 3
SCOPUS™ Citations
5
checked on May 04, 2026
Web of Science™ Citations
4
checked on May 04, 2026
Page Views
654
checked on May 04, 2026
Downloads
243
checked on May 04, 2026
Google Scholar™


