Generation of mutants for boolean expression
Pravin Chandra, Kulvinder Singh, Yogesh Pal Singh · Journal of Discrete Mathematical Sciences and Cryptography · 2008
Fault based testing suffers from biases of the programmer in seeding the faults. There is no formal approach to determine the maximum number of mutants that can be generated for a specific faults type. In this paper, we will examine the various fault categories for Boolean expressions in irreducible Disjunctive Normal Form (DNF) and Canonical DNF and estimate the maximum number of faults that can be seeded in a Boolean expression. The results obtained provide a mechanism for the generation of mutants that are not equivalent to the original Boolean expression in irreducible disjunctive normal form.