{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:10:23Z","timestamp":1759032623269},"reference-count":21,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,31]],"date-time":"2006-10-31T00:00:00Z","timestamp":1162252800000},"content-version":"vor","delay-in-days":4686,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Software Testing Verif &amp; Rel"],"published-print":{"date-parts":[[1994,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Mutation analysis is a software testing technique that requires the tester to generate test data that will find specific, well\u2010defined errors. Mutation testing executes many slightly differing versions, called <jats:italic>mutants<\/jats:italic>, of the same program to evaluate the quality of the data used to test the program. Although these mutants are generated and executed efficiently by automated methods, many of the mutants are functionally <jats:italic>equivalent<\/jats:italic> to the original program and are not useful for testing. Recognizing and eliminating equivalent mutants is currently done by hand, a time\u2010consuming and arduous task. This problem is currently a major obstacle to the practical application of mutation testing.<\/jats:p><jats:p>This paper presents extensions to previous work in detecting equivalent mutants; specifically, algorithms for determining several classes of equivalent mutants are presented, an implementation of these algorithms is discussed, and results from using this implementation are presented. These algorithms are based on data flow analysis and six compiler optimization techniques. Each of these techniques is described together with how they are used to detect equivalent mutants. The design of the tool and some experimental results using it are also presented.<\/jats:p>","DOI":"10.1002\/stvr.4370040303","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T16:02:18Z","timestamp":1163779338000},"page":"131-154","source":"Crossref","is-referenced-by-count":112,"title":["Using compiler optimization techniques to detect equivalent mutants"],"prefix":"10.1002","volume":"4","author":[{"given":"A. Jefferson","family":"Offutt","sequence":"first","affiliation":[]},{"given":"W. Michael","family":"Craft","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,31]]},"reference":[{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/360018.360025"},{"key":"e_1_2_1_3_1","unstructured":"Acree A. T.(1980) \u2018On mutation\u2019 Ph. D. thesis Georgia Institute of Technology Atlanta Georgia U.S.A."},{"key":"e_1_2_1_4_1","first-page":"60","volume-title":"Proceedings of the 1993 International Symposium on Software Testing, and Analysis","author":"Agrawal H.","year":"1993"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Agrawal H.andHorgan J. R.(1990) \u2018Dynamic program slicing\u2019 InProceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation White Plains New York June 1990 ACM Press New York U.S.A. pp.246\u2013256.","DOI":"10.1145\/93548.93576"},{"key":"e_1_2_1_6_1","first-page":"239","article-title":"Program optimization","volume":"5","author":"Allen F. E.","year":"1969","journal-title":"Annual Review in Automatic Programming"},{"key":"e_1_2_1_7_1","volume-title":"Compilers: Principles, Techniques, and Tools","author":"Aho A. V.","year":"1986"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00625279"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Boyer R. S. Elspas B.andLevitt K. N.(1975) \u2018SELECT\u2010a formal system for testing and debugging programs by symbolic execution\u2019 InProceedings of the International Conference on Reliable Software June 1975 IEEE catalog number 75 CHO 940\u20137CSR IEEE Computer Society Press Los Alamitos. California U.S.A. pp.234\u2013245.","DOI":"10.1145\/800027.808445"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Baldwin D.andSayward F. (1979) \u2018Heuristics for determining equivalence of program mutations \u2019) Research report 276. Department of Computer Science Yale University Connecticut U.S.A.","DOI":"10.21236\/ADA071795"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/WST.1988.5369"},{"issue":"4","key":"e_1_2_1_12_1","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/C-M.1978.218136","article-title":"Hints on test data selection: help for the practising programmer","volume":"11","author":"DeMillo R. A.","year":"1978","journal-title":"IEEE Computer"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.92910"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/151257.151258"},{"key":"e_1_2_1_15_1","volume-title":"Crafting a Compiler","author":"Fischer C. N.","year":"1988"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1977.231145"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360252"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90054-3"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380210704"},{"key":"e_1_2_1_20_1","unstructured":"Pan Jie(1994) \u2018Using constraints to detect equivalent mutants \u2019 Master's thesis Department of Information and Systems Engineering George Mason University Fairfax Virginia U.S.A. (Also released as Technical report ISSE\u2010TR\u201094\u2010109)."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.58784"},{"key":"e_1_2_1_22_1","volume-title":"Supercompilers for Parallel and Vector Computers","author":"Zima H.","year":"1989"}],"container-title":["Software Testing, Verification and Reliability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fstvr.4370040303","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/stvr.4370040303","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T00:13:12Z","timestamp":1698106392000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/stvr.4370040303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["10.1002\/stvr.4370040303"],"URL":"https:\/\/doi.org\/10.1002\/stvr.4370040303","archive":["Portico"],"relation":{},"ISSN":["0960-0833","1099-1689"],"issn-type":[{"value":"0960-0833","type":"print"},{"value":"1099-1689","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}