Identifying bug signatures using discriminative graph mining

Proceedings of the 18th International Symposium on Software Testing and Analysis, ISSTA 2009

Volumn , Issue , 2009, Pages 141-151

  Cheng, Hong ^a   Lo, David ^b   Zhou, Yang ^a   Wang, Xiaoyin ^c   Yan, Xifeng ^d  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

^c Peking University   (China)

^d University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; FLOW GRAPHS; OPTIMIZATION;

BUG LOCALIZATIONS; CASE-STUDIES; CONTEXT IDENTIFICATION; FREQUENT SUBGRAPHS; FUNCTION CALLS; MODELING SOFTWARES; OPTIMIZATION PROBLEMS; SUBGRAPH MINING;

SOFTWARE TESTING;

EID: 85008256270     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1572272.1572290     Document Type: Conference Paper

References (25)

1. Rhino-JavaScript for Java. www.mozilla.org/rhino.
2. H. Agrawal, J. Horgan, S. London, and W. Wong. Fault localization using execution slices and dataflow tests. In ISSRE, 1995.
3. C. Borgelt and M. R. Berthold. Mining molecular fragments: Finding relevant substructures of molecules. In ICDM, 2002.
4. M. Christodorescu, S. Jha, and C. Kruegel. Mining specification of malicious behavior. In ESEC/FSE, 2007.
5. H. Cleve and A. Zeller. Locating causes of program failures. In ICSE, 2005.
6. R. DeMillo, H. Pan, and E. Spafford. Critical slicing for software fault localization. In ISSTA, 1996.
7. H. Hsu, J. A. Jones, and A. Orso. RAPID: Identifying bug signatures to support debugging activities. In ASE, 2008.
8. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraph in the presence of isomorphism. In ICDM, 2003.
9. M. Hutchins, H. Foster, T. Goradia, and T. Ostrand. Experiments of the effectiveness of dataflow-and controlflow-based test adequacy criteria. In ICSE, 1994.
10. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In PKDD, 1998.
11. L. Jiang and Z. Su. Context-aware statistical debugging: from bug predictors to faulty control flow paths. In ASE, 2007.
12. J. Jones and M. Harrold. Empirical evaluation of the tarantula automatic fault-localization technique. In ASE, 2005.
13. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM, 2001.
14. B. Liblit, A. Aiken, A. X. Zheng, and M. I. Jordan. Bug isolation via remote program sampling. In PLDI, 2003.
15. C. Liu, X. Yan, L. Fei, J. Han, and S. P. Midkiff. Sober: Statistical model-based bug localization. In ESEC/FSE, 2005.
16. S. Nijssen and J. Kok. A quickstart in frequent structure mining can make a difference. In KDD, 2004.
17. M. Renieris and S. Reiss. Fault localization with nearest neighbor queries. In ASE, 2003.
18. G. Tassey. The economic impacts of inadequate infrastructure for software testing. National Institute of Standards and Technology. Planning Report 02-3.2002, 2002.
19. R. M. H. Ting and J. Bailey. Mining minimal contrast subgraph patterns. In SDM, 2006.
20. N. Vanetik, E. Gudes, and S. E. Shimony. Computing frequent graph patterns from semistructured data. In ICDM, 2002.
21. J. Wang and J. Han. BIDE: Efficient mining of frequent closed sequences. In ICDE, 2004.
22. X. Yan, H. Cheng, J. Han, and P. S. Yu. Mining significant graph patterns by scalable leap search. In SIGMOD, 2008.
23. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In ICDM, 2002.
24. A. Zeller and R. Hildebrandt. Simplifying and isolating failure-inducing input. IEEE Trans. on Software Engineering, 2002.
25. X. Zhang, N. Gupta, and R. Gupta. Pruning dynamic slices with confidence. In PLDI, 2006.