Concerning ordered mutation testing of relational operators

Martin R. Woodward · Software Testing Verification and Reliability · 1991

Abstract 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.

Read the paper · More papers on PaperTik