Search In this Thesis
   Search In this Thesis  
العنوان
Software Bug Localization Based on
Graph Mining /
المؤلف
Mohamed, Marwa Gaber Abd El- Wahab.
هيئة الاعداد
باحث / احمد علي فؤاد اسماعيل صيام
مشرف / مروة صلاح فرحان
مشرف / عبير حمدي
مشرف / محمد حلمي خفاجي
الموضوع
Computers and information. Computer Science.
تاريخ النشر
2018.
عدد الصفحات
p. 87 :
اللغة
الإنجليزية
الدرجة
ماجستير
التخصص
Computer Science Applications
تاريخ الإجازة
19/10/2021
مكان الإجازة
جامعة حلوان - كلية الحاسبات والمعلومات - هندسة البرمجيات
الفهرس
Only 14 pages are availabe for public view

from 125

from 125

Abstract

Bug localization is considered one of the most difficult activities in the software debugging
process. It is also vital to guarantee software reliability. Moreover, manual debugging that is
used in detecting faults is becoming more expensive and time-consuming especially when
dealing with programs that contain a huge number of lines. Hence, there has been a great
demand for bug localization techniques that can pinpoint faults for the developers. Various
software fault localization techniques based on graph mining have been proposed in the
literature. These techniques rely on detecting frequent sub-graphs between failing and passing
traces. However, these approaches may not be applicable when the bug does not appear in a
discriminative pattern.
On the other hand, there are approaches that focus on selecting potentially faulty program
components (statements or predicates) and then ranking these components according to its
suspiciousness degree. One of the difficulties encountered by such approaches is to understand
the context of fault occurrence, because it considers statements and predicates in isolation.
To address these issues, this dissertation introduces an approach that helps in analyzing
the context of execution traces based on control flow graphs. The proposed approach is based
on ranking edges connecting nodes representing basic blocks in software programs. Ranking
is performed using Dstar method that proved to be more effective than many fault
localization techniques. The proposed method helps in detecting some types of faults that
could not be previously detected by many other approaches. Experiments show the
effectiveness of the proposed approach compared to some well-known approaches such as
Dstar, Tarantula, SOBER, Cause Transition and Liblit05. For instance, when the percentage of
examined code is 30%, the proposed technique can localize nearly 81% of the faulty
versions, which outperforms the other four techniques.