PMothra: scheduling mutants for execution on a hypercube
TAV3 Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification
High Performance Software Testing on SIMD Machines
IEEE Transactions on Software Engineering
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Exploiting Parallelism Across Program Execution: A Unification Technique and Its Analysis
IEEE Transactions on Parallel and Distributed Systems
An Empirical Evaluation of Weak Mutation
IEEE Transactions on Software Engineering
Testing techniques in software engineering
Testing techniques in software engineering
| Hi-index | 0.00 |
Mutation analysis is a software testing methodology designed to substantiate the correctness of a program &PHgr;. The mutation approach is to induce syntactically correct changes in &PHgr;, thereby creating a set of mutant programs. The goal of a tester is to construct a set of test data T that distinguishes the output of &PHgr;(T) from that of all mutant programs. Test data sensitive enough to distinguish al1 mutant programs is deemed adequate to infer the probable correctness of &PHgr;.We propose an algorithm designed to exploit the architecture of a vector processor like the Cyber 205 or Cray X/MP. The algorithm manages the simultaneous execution of multiple mutant FORTRAN 77 programs. This is accomplished by viewing the execution of these mutants as a sequence of vector instructions. The algorithm promises potential to greatly increase the performance of a mutation based testing system, as well as points towards a general method of simultaneous program execution against multiple data sets.