Using Structural Similarity to Classify Tests in Mutation Testing

Article Preview

Abstract:

Mutation testing is an effective technique for assessing quality of tests provided for a system. However it suffers from high computational cost of executing mutants of the system. In this paper a method of classifying such mutants is proposed. This classification is based on using an edit distance kernel and k-NN classifier. Using the results of this classification it is possible to predict whether a mutant would be detected by tests or not. Thus the application of the approach can help to lower the number of mutants that have to be executed and so also to lower the cost of using the mutation testing.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

546-551

Citation:

Online since:

August 2013

Export:

Price:

[1] A. T. Acree: On Mutation, PhD Thesis, Georgia Institute of Technology, (1980).

Google Scholar

[2] R. Agrawal, T. Imielinski, A. Swami: Mining association rules between sets of items in large databases. In: Proc. 1993 ACM-SIGMOD , pp.207-216.

DOI: 10.1145/170036.170072

Google Scholar

[3] K.M. Borgwardt, H. P Kriegel: Shortest-path kernels on graphs, ICDM 2005, pp.74-81.

DOI: 10.1109/icdm.2005.132

Google Scholar

[4] H. Bunke, K. Riesen: Improving vector space embedding of graphs through feature selection algorithms. Pattern Recognition 44(9): 1928-1940 (2011).

DOI: 10.1016/j.patcog.2010.05.016

Google Scholar

[5] H. Bunke, K. Riesen: Recent advances in graph-based pattern recognition with applications in document analysis. Pattern Recognition 44(5): 1057-1067 (2011).

DOI: 10.1016/j.patcog.2010.11.015

Google Scholar

[6] T. A. Budd: Mutation Analysis of Program Test Data, PhD Thesis, Yale University, New Haven, Connecticut, (1980).

Google Scholar

[7] C. Ji, Z. Chen, B. Xu and Z. Zhao: A Novel Method of Mutation Clustering Based on Domain Analysis, in Proceedings SEKE'09. Boston, Massachusetts, (2009).

Google Scholar

[8] P. Chevalley: Applying Mutation Analysis for Object-oriented Programs Using a Reflective Approach, in Proceedings of the 8th APSEC 01, Macau, 2001, p.267.

Google Scholar

[9] P. Chevalley, P. Thevenod-Fosse: A Mutation Analysis Tool for Java Programs, International Journal on Software Tools for Technology Transfer, vol. 5, no. 1, p.90–103, (2002).

DOI: 10.1007/s10009-002-0099-9

Google Scholar

[10] M. Collins, N. Duffy: New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted Perceptron. In Proceedings of ACL (2002).

DOI: 10.3115/1073083.1073128

Google Scholar

[11] R. A. DeMillo, R. J. Lipton and F. G. Sayward: Hints on Test Data Selection: Help for the Practicing Programmer, Computer, vol. 11, no. 4, p.34–41, (1978).

DOI: 10.1109/c-m.1978.218136

Google Scholar

[12] P. G. Frankl, S. N. Weiss and C. Hu: All-uses vs Mutation Testing: an Experimental Comparison of Effectiveness, Journal of Systems and Software, vol. 38, no. 3, p.235–253, (1997).

DOI: 10.1016/s0164-1212(96)00154-9

Google Scholar

[13] T. Gartner: A survey of kernels for structured data. SIGKDD Explorations, 5(1): 49–58, (2003).

Google Scholar

[14] T. Gartner: Kernels for structured data, (Series in Machine Perception and Artificial Intelligence), World Scientific, (2009).

Google Scholar

[15] J. Han, J. Pei, Y. Yin, and R. Mao: Mining Frequent Patterns without Candidate Generation: A Frequent-pattern Tree Approach. Data Mining and Knowledge Discovery: An International Journal, Volume 8, Issue 1, pp.53-87, (2004).

DOI: 10.1023/b:dami.0000005258.31418.83

Google Scholar

[16] D. Haussler: Convolutional kernels on discrete structures. Technical Report UCSC-CRL-99-10, Computer Science Department, UC Santa Cruz, (1999).

Google Scholar

[17] S. Hussain: Mutation Clustering, Masters Thesis, King's College London, (2008).

Google Scholar

[18] A. Inokuchi, T. Washio, and H. Motoda: An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data, Principles of Data Mining and Knowledge Discovery: 4th European Conference, PKDD 2000, pp.87-92.

DOI: 10.1007/3-540-45372-5_2

Google Scholar

[19] Y. Jia, M. Harman: An Analysis and Survey of the Development of Mutation Testing. IEEE Trans. Software Eng. pp.649-678, (2011).

DOI: 10.1109/tse.2010.62

Google Scholar

[20] H. Kashima, K. Tsuda and A. Inokuchi: Marginalized Kernels Between Labeled Graphs. ICML 2003, pp.321-328.

Google Scholar

[21] S. Kim, J. A. Clark and J. A. McDermid: Assessing Test Set Adequacy for Object Oriented Programs Using Class Mutation, in Proceedings of SoST (1999).

Google Scholar

[22] S. Kim, J. A. Clark and J. A. McDermid: The Rigorous Generation of Java Mutation Operators Using HAZOP, in Proceedings of ICSSEA (1999).

Google Scholar

[23] S. Kim, J. A. Clark and J. A. McDermid: Class Mutation: Mutation Testing for Object-oriented Programs, in Proceedings of the Net. ObjectDays (2000).

Google Scholar

[24] S. Kim, J. A. Clark and J. A. McDermid: Investigating the effectiveness of object-oriented testing strategies using the mutation method, in Proceedings of MUTATION 2001, p.207–225.

DOI: 10.1002/stvr.238

Google Scholar

[25] K. N. King, A. J. Offutt: A Fortran Language System for Mutation- Based Software Testing, Software: Practice and Experience, vol. 21, no. 7, p.685–718, (1991).

DOI: 10.1002/spe.4380210704

Google Scholar

[26] Y. Ma, J. Offutt, Y.R. Kwon: MuJava: a mutation system for java. in ICSE 2006, pp.827-830.

Google Scholar

[27] A. P. Mathur: Performance, Effectiveness, and Reliability Issues in Software Testing, in Proceedings of COMPSAC 1991, p.604–605.

Google Scholar

[28] G. Myers, C. Sandler and T. Badgett: The art of software testing. 3rd edition, Wiley, (2011).

Google Scholar

[29] A. J. Offutt, J. Pan, K. Tewary, and T. Zhang: An Experimental Evaluation of Data Flow and Mutation Testing, Software: Practice and Experience, vol. 26, no. 2, p.165–176, (1996).

DOI: 10.1002/(sici)1097-024x(199602)26:2<165::aid-spe5>3.0.co;2-k

Google Scholar

[30] A. J. Offutt, G. Rothermel, and C. Zapf: An Experimental Evaluation of Selective Mutation, in Proceedings of ICSE 1993, p.100–107.

Google Scholar

[31] J. s Richiardi, D. Van De Ville, K. Riesen and H. Bunke: Vector Space Embedding of Undirected Graphs with Fixed-cardinality Vertex Sequences for Classification. ICPR 2010, pp.902-905.

DOI: 10.1109/icpr.2010.227

Google Scholar

[32] K. Riesen, H. Bunke: Cluster Ensembles Based on Vector Space Embeddings of Graphs. MCS 2009, pp.211-221.

DOI: 10.1007/978-3-642-02326-2_22

Google Scholar

[33] K. Riesen, H. Bunke: Dissimilarity Based Vector Space Embedding of Graphs Using Prototype Reduction Schemes. MLDM 2009, pp.617-631.

DOI: 10.1007/978-3-642-03070-3_47

Google Scholar

[34] B. Schölkopf, A. J. Smola: Learning with kernels, MIT Press (2002).

Google Scholar

[35] B. Strug: Using Kernels on Hierarchical Graphs in Automatic Classification of Designs, LNCS 6658, pp.335-344, (2011).

Google Scholar

[36] B. Strug, G. Slusarczyk: Frequent Pattern Mining in a Design Supporting System, Key Engineering Materials Vol. 450, pp.1-4, (2011).

Google Scholar

[37] B. Strug: Automatic Design Quality Evaluation Using Graph Similarity Measures, Automation in Construction http: /dx. doi. org/10. 1016/j. autcon. 2012. 12. 015, (2013).

DOI: 10.1016/j.autcon.2012.12.015

Google Scholar

[38] J. Strug, B. Strug: Machine Learning Approach in Mutation Testing. LNCS 7641, pp.200-214, (2012).

Google Scholar

[39] W. E. Wong: On Mutation and Data Flow, PhD Thesis, Purdue University, West Lafayette, Indiana, (1993).

Google Scholar

[40] X. Yan, P. S. Yu, and J. Han: Substructure Similarity Search in Graph Databases, SIGMOD (2005).

Google Scholar