Sciweavers

Share
MSR
2011
ACM

An empirical analysis of the FixCache algorithm

7 years 9 months ago
An empirical analysis of the FixCache algorithm
The FixCache algorithm, introduced in 2007, effectively identifies files or methods which are likely to contain bugs by analyzing source control repository history. However, many open questions remain about the behaviour of this algorithm. What is the variation in the hit rate over time? How long do files stay in the cache? Do buggy files tend to stay buggy, or can they be redeemed? This paper analyzes the behaviour of the FixCache algorithm on four open source projects. FixCache hit rate is found to generally increase over time for three of the four projects; file duration in cache follows a Zipf distribution; and topmost bug-fixed files go through periods of greater and lesser stability over a project’s history. Categories and Subject Descriptors D.2.7 [Software Engineering]: Distribution, Maintenance, and Enhancement – Restructuring, reverse engineering, and reengineering, D.2.8 [Software Engineering]: Metrics – Product metrics General Terms Algorithms, Measurement, Experimen...
Caitlin Sadowski, Chris Lewis 0002, Zhongpeng Lin,
Added 16 Sep 2011
Updated 16 Sep 2011
Type Journal
Year 2011
Where MSR
Authors Caitlin Sadowski, Chris Lewis 0002, Zhongpeng Lin, Xiaoyan Zhu, E. James Whitehead Jr.
Comments (0)
books