Automated Generation of Similar Paths for Localizing Program Faults

Author

Ye, Junmin ; Zhu, Kai ; Jin, Cong ; Zheng, Quan

Author_Institution

Dept. of Comput. Sci., Central China Normal Univ., Wuhan, China

fYear

2009

fDate

11-13 Dec. 2009

Firstpage

1

Lastpage

4

Abstract

Localizing a program fault accurately in debugging is complex and time-consuming. In the process of fault diagnosing, identifying or generating the successful test paths as similar as possible to the failed test is core for the effectiveness of faults localization. A method for calculating the similarity between two test paths based on analyzing difference between program control-flow is defined, and a novel algorithm based on DD-graph for generating similar path set directly from a failed test is proposed. It is experimentally proved that the proposed algorithm can generate a similar path set for a failed path and can help to localize the program faults.

Keywords

fault diagnosis; program control structures; program debugging; automated similar paths generation; debugging; fault diagnosis; program control flow; program faults localization; Algorithm design and analysis; Computer science; Debugging; Failure analysis; Fault diagnosis; Informatics; Nearest neighbor searches; Programming profession; Testing; Tree graphs;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence and Software Engineering, 2009. CiSE 2009. International Conference on

Conference_Location

Wuhan

Print_ISBN

978-1-4244-4507-3

Electronic_ISBN

978-1-4244-4507-3

Type

conf

DOI

10.1109/CISE.2009.5363524

Filename

5363524