%0 Journal Article
	%A Samia Alblwi and  Amani Ayad
	%D 2024
	%J International Journal of Computer and Systems Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 205, 2024
	%T Minimizing Mutant Sets by Equivalence and Subsumption
	%U https://publications.waset.org/pdf/10013444
	%V 205
	%X Mutation testing is the art of generating syntactic variations of a base program and checking whether a candidate test suite can identify all the mutants that are not semantically equivalent to the base; this technique can be used to assess the quality of test suite. One of the main obstacles to the widespread use of mutation testing is cost, as even small programs (a few dozen lines of code) can give rise to a large number of mutants (up to hundreds); this has created an incentive to seek to reduce the number of mutants while preserving their collective effectiveness. Two criteria have been used to reduce the size of mutant sets: equivalence, which aims to partition the set of mutants into equivalence classes modulo semantic equivalence, and selecting one representative per class; and, subsumption, which aims to define a partial ordering among mutants that ranks mutants by effectiveness and seeks to select maximal elements in this ordering. In this paper, we analyze these two policies using analytical and empirical criteria.
	%P 21 - 27