Data mining and cross-checking of execution traces: a re-interpretation of Jones, Harrold and Stasko test information
Abstract
The current trend in debugging and testing is to cross-check information collected during several executions. Jones et al., for example, propose to use the instruction coverage of passing and failing runs in order to visualize suspicious statements. This seems promising but lacks a formal justification. In this paper, we show that the method of Jones et al. can be re-interpreted as a data mining procedure. More particularly, they define an indicator which characterizes association rules between data. With this formal framework we are able to explain intrinsic limitations of the above indicator.
BibTeX
@inproceedings{Denmat-al:ASE05,
author = {Tristan Denmat and
Mireille Ducass{\'{e}} and
Olivier Ridoux},
title = {Data mining and cross-checking of execution traces: a re-interpretation of Jones, Harrold and Stasko test information},
booktitle = {ASE},
pages = {396--399},
publisher = {{ACM}},
year = {2005},
}