Skip to main navigation Skip to search Skip to main content

Mining data chain graph for fault localization

  • Bo Yang*
  • , Ji Wu
  • , Chao Liu
  • *Corresponding author for this work
  • Beihang University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Fault localization is a challenging task in domainspecific data mining. Most existing works focus on call graph that can find bugs which are associated with control flow. However, there are a lot of bugs related to data flow. In this paper, we presented a data dependency graph in fault localization. The approach at first analyzes the execution of the test suites dynamically, then derives the data dependency graph which reflects data flow traces of any test case. Frequency subgraphs generated which are based on the analysis of these data dependency graph. At last ranking the variables that in those graphs and get the suspicious variables. We have conducted a case study use this approach. The preliminary result shows that our approach is feasible and effective.

Original languageEnglish
Title of host publicationProceedings - 36th Annual IEEE International Computer Software and Applications Conference Workshops, COMPSACW 2012
Pages464-469
Number of pages6
DOIs
StatePublished - 2012
Event36th Annual IEEE International Computer Software and Applications Conference Workshops, COMPSACW 2012 - Izmir, Turkey
Duration: 16 Jul 201220 Jul 2012

Publication series

NameProceedings - International Computer Software and Applications Conference
ISSN (Print)0730-3157

Conference

Conference36th Annual IEEE International Computer Software and Applications Conference Workshops, COMPSACW 2012
Country/TerritoryTurkey
CityIzmir
Period16/07/1220/07/12

Fingerprint

Dive into the research topics of 'Mining data chain graph for fault localization'. Together they form a unique fingerprint.

Cite this