Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
