Do Bug-Fix Types Affect Spectrum-Based Fault Localization Algorithms' Efficiency?
| Autor: | Bela Vancsics, Attila Szatmari, Arpad Beszedes |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
021103 operations research
Java business.industry Computer science media_common.quotation_subject 0211 other engineering and technologies 020207 software engineering 02 engineering and technology Fault (power engineering) JavaScript Task (project management) Software Debugging Systems development life cycle 0202 electrical engineering electronic engineering information engineering Benchmark (computing) business Algorithm computer computer.programming_language media_common |
| Zdroj: | VST@SANER |
| DOI: | 10.1109/vst50071.2020.9051638 |
| Popis: | Finding a bug in the software is an expensive task, however, debugging is a crucial part of the software development life cycle. Spectrum-Based Fault Localization (SBFL) algorithms can reduce the time spent with debugging. Despite the fact that SBFL is a very well researched topic, there are not many tools that implement it. Many studies have dealt with the effectiveness of SBFL algorithms, although these have been evaluated on Java and C++ programming languages. We performed an empirical study on JavaScript programs (using BugsJS benchmark) to evaluate the relationship between algorithms efficiency and the bug-fix types. First we implemented three popular SBFL approaches, i.e. Tarantula, Ochiai and DStar, then examined whether there was a correlation/connection between the positions of the faulty methods in the suspiciousness ranks and bug-fix types. Results show that certain bug-fix types can be significantly differentiated from the others (in both positive and negative direction) based on the fault localization effectiveness of the investigated algorithms. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|