刨右炯技鸵.PDF

 Mutation 2000: Uniting the Orthogonal A. Jeerson Outt Roland H. Untch ISE Department, 4A4 Department of Computer Science George Mason University Middle Tennessee State University Fairfax, VA 22030-4444 USA Murfreesb oro, TN 37132-0048 703-993-1654 615-898-5047 ofut@ untch@ /faculty/o fut/ / untch/ Abstract Computer Programs. It was not until the end of the 1970s, however, b efore ma jor work was published on Mutation testing is a powerful, but computational ly ex- the sub ject [1, 2, 3]; the DeMillo, Lipton, and Sayward p ensive, technique for unit testing software. This ex- pap er [3] is generally cited as the seminal reference. p ense has pr evented mutation fr om becoming widely PIMS [1, 4, 5 , 6], an early mutation testing to ol, pi- used in practical situations, but recent engineering ad- oneered the general pro cess typically used in mutation vances have given us techniques and algorithms for sig- testing of creating mutants (of Fortran IV programs), nicantly reducing the cost of mutation testing. These accepting test cases from the users, and then executing techniques include a new algorithmic execution tech- the test cases on the mutants to decide how many mu- nique cal led schema-based m utation, an approximation tants were killed.