Premium
Concerning ordered mutation testing of relational operators
Author(s) -
Woodward M R
Publication year - 1991
Publication title -
software testing, verification and reliability
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.216
H-Index - 49
eISSN - 1099-1689
pISSN - 0960-0833
DOI - 10.1002/stvr.4370010305
Subject(s) - argument (complex analysis) , mutation , order (exchange) , computer science , programming language , genetics , biology , economics , biochemistry , finance , gene
The aim of this paper is to correct a misapprehension concerning mutation testing of relational operators in imperative programming languages. An apparently plausible, but fallacious argument is stated concerning the order in which mutants are best considered. Subsequently, a counter‐example is presented which disproves the argument.