Combining weak and strong mutation for a noninterpretive Java mutation system

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 79
  • Download : 0
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 combinedweakand 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.
Publisher
WILEY-BLACKWELL
Issue Date
2013-12
Language
English
Article Type
Article
Citation

SOFTWARE TESTING VERIFICATION & RELIABILITY, v.23, no.8, pp.647 - 668

ISSN
0960-0833
DOI
10.1002/stvr.1480
URI
http://hdl.handle.net/10203/254423
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0