International Journal on Advanced Science, Engineering and Information Technology, Vol. 12 (2022) No. 6, pages: 2438-2442, DOI:10.18517/ijaseit.12.6.14522

Optimization of Mutation Testing Challenges to Fixing Faults

Sasa Ani Arnomo, Noraini Ibrahim, Anggia Dasa Putri, Ellbert Hutabri


One of the challenges of mutation testing is fixing faults. In the debugging phase, all live mutants were repaired. Programs need high mutation scores to be declared reliable program codes. Each mutation test can allow the identification of multiple mutants. This is what confuses the faults fixing process. The objective of this research is to get the shortest route so that it can help in sorting the mutant types during application improvement after testing. The optimization is needed considering the number of mutants in each mutation testing. The problems related to optimization are very complex. It takes a suitable method to find the shortest path by paying attention to each point. There are 30 projects chosen randomly. The operator mutations that are often killed when testing mutations are AOIU and COI. The proposed optimization for mutant repair sequence is the ant colony system (ACS). The route selection using the Ant Colony System algorithm resulted in route optimization of 1.528254. Meanwhile, if the genetic algorithm is used, the score is 1.767643. Optimization results are very helpful for developers in improving code in mutation testing. Research states the best order for handling mutants using ACS. This research can be further developed with the addition of class-level mutant cases which are produced using class mutation operators. Class mutation operators have different characteristics from traditional mutation operators. In particular, it requires changes to the program structure, such as the definition of class variables.


Fixing faults; mutation testing; optimization; ACS.

Viewed: 315 times (since abstract online)

cite this paper     download