Software Bug Localization Based on Key Range Invariants

N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Bug localization is expensive and time-consuming during software debugging. The traditional software bug localization based on range invariants need to monitor all variables in the system, requires a large of runtime overhead. However, this overhead is not necessary. Because only a set of key variables can really affect the results of the system. Therefore, this paper proposes a software bug localization method based on key range invariants. First, add the key variables screening phase in the original method. By combining the dynamic filtering mechanism with the static reduction mechanism, the key variables set of the program are screened. Then, the values of the key variables in all successful test cases are counted to obtain the key range invariants. Finally, bug localization is performed by monitoring the values of the key variables in failure test cases. When we need to minimize the overhead of monitoring variables, we can use this method to ignore variables that are considered unimportant. The experimental results show that, the method can still maintain a good bug localization effect only monitoring the key variable set, which verifies the effectiveness of the method.

Cite

CITATION STYLE

APA

Ma, L., & Ding, Z. (2018). Software Bug Localization Based on Key Range Invariants. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11293 LNCS, pp. 20–32). Springer Verlag. https://doi.org/10.1007/978-3-030-04272-1_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free