Automatically detecting equivalent mutants and infeasible paths

摘要: Mutation testing is a technique for software units that has great potential improving the quality of testing, and thereby increasing ability to assure high reliability critical software. It will be shown recent advances in mutation research have brought practical system closer reality. One advance partial solution problem automatically detecting equivalent mutant programs. Equivalent mutants are currently detected by hand, which makes it very expensive time-consuming. The specific instance more general problem, commonly called feasible path says certain structural criteria some test requirements infeasible sense semantics program imply no case satisfies requirements. mutants, unreachable statements techniques, DU-pairs data flow all instances problem. This paper presents uses mathematical constraints, originally developed generation, detect paths automatically. © 1997 John Wiley & Sons, Ltd.