Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/91565
Title: | Addressing practical challenges of mutation testing |
Authors: | Cachia, Mark Anthony Micallef, Mark Colombo, Christian |
Keywords: | Mutation testing of computer programs Data flow computing Computer software -- Development |
Issue Date: | 2013 |
Publisher: | University of Malta |
Citation: | Cachia, M. A., Micallef, M., & Colombo, C. (2013). Addressing practical challenges of mutation testing. Internal report 01-WICT-2012, University of Malta. |
Abstract: | Proponents of Agile development processes claim that adhering to Agile principles leads to the delivery of high quality code in evolutionary increments. Confidence in resulting systems is mostly gained through the use of unit test suites, entrusted to catch regressions as soon as they occur. Consequently, the system can only be as trustworthy as its tests, meaning that measurements of the tests’ quality is crucial. Whilst mutation testing has been proposed as a means of uncovering test suite defects, it has not been widely adopted in the industry; mainly due to its computational expense and manual effort required by developers investigating unkilled mutants. To make mutation testing affordable, we propose incremental mutation testing — a variation of mutation testing which leverages the iterative nature of agile development by limiting the scope of mutant generation to sections of code which have changed since the last mutation run. Preliminary results show that the number of mutants generated is drastically reduced along with the time required to generate mutants and execute tests against them. |
URI: | https://www.um.edu.mt/library/oar/handle/123456789/91565 |
Appears in Collections: | Scholarly Works - FacICTCS |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Addressing_practical_challenges_of_mutation_testing.pdf Restricted Access | 165.36 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.