Finding Regressions in Projects under Version Control Systems
| Authors | |
|---|---|
| Year of publication | 2018 |
| Type | Article in Proceedings |
| Conference | 13th International Conference on Software Technologies |
| MU Faculty or unit | |
| Citation | |
| Web | https://doi.org/10.5220/0006864401860197 |
| Doi | http://dx.doi.org/10.5220/0006864401860197 |
| Keywords | Version Control Systems;Regressions;Regression Points;Code Debugging;Bisection |
| Description | Version Control Systems (VCS) are frequently used to support development of large-scale software projects. A typical VCS repository can contain various intertwined branches consisting of a large number of commits. If some kind of unwanted behaviour (e.g. a bug in the code) is found in the project, it is desirable to find the commit that introduced it. Such commit is called a regression point. There are two main issues regarding the regression points. First, detecting whether the project after a certain commit is correct can be very expensive and it is thus desirable to minimise the number of such queries. Second, there can be several regression points preceding the actual commit and in order to fix the actual commit it is usually desirable to find the latest regression point. Contemporary VCS contain methods for regression identification, see e.g. the git bisect tool. In this paper, we present a new regression identification algorithm that outperforms the current tools by decreasing the number of validity queries. At the same time, our algorithm tends to find the latest regression points which is a feature that is missing in the state-of-the-art algorithms. The paper provides an experimental evaluation on a real data set. |
| Related projects: |