Combining weak and strong mutation for a noninterpretive Java mutation system. (24th August 2012)

• Record Type: Journal Article
• Authors: Kim, Sang‐Woon; Ma, Yu‐Seung; Kwon, Yong‐Rae
• Is Part Of: Software testing, verification & reliability. Volume 23:Number 8(2013)
• Page Start: 647
• Page End: 668
• Publication Date: 2012-08-24
• Subjects: Computer software -- Testing -- Periodicals; Computer software -- Verification -- Periodicals; Computer software -- Reliability -- Periodicals; 005.14
• DOI: 10.1002/stvr.1480
• Languages: English
• ISSNs: 0960-0833

Abstract

<abstract abstract-type="main" id="stvr1480-abs-0001"> <title>SUMMARY</title> <p id="stvr1480-para-0001">Because of the computationally expensive cost of mutation testing, automated system support is indispensable for conducting mutation testing. Mutation systems can be classified into interpretive and noninterpretive, but recent systems are noninterpretive. Weak mutation is a well‐known cost reduction method of mutation testing, but it is not directly applicable to noninterpretive mutation systems. To address the problem and take advantage of the efficiency of weak mutation, this paper presents a combined weak and strong mutation for noninterpretive Java mutation systems. The new term 'serialmutant' is defined as a specialized program to conduct weak mutation against all mutants in an execution and report only weakly killed mutants as strong mutation candidates. Then strong mutation is conducted only for those reported mutants. The paper also describes an implementation based on a previous Java mutation tool, MuJava. Method‐level mutation operators for Java are also redesigned. Experimental results show that the proposed approach efficiently improves the mutation cost in a noninterpretive mutation system. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p> </abstract>