{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T16:19:50Z","timestamp":1756311590832},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319471051"},{"type":"electronic","value":"9783319471068"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-47106-8_2","type":"book-chapter","created":{"date-parts":[[2016,9,23]],"date-time":"2016-09-23T07:53:34Z","timestamp":1474617214000},"page":"18-33","source":"Crossref","is-referenced-by-count":6,"title":["HOMI: Searching Higher Order Mutants for\u00a0Software Improvement"],"prefix":"10.1007","author":[{"given":"Fan","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Harman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Krinke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,24]]},"reference":[{"key":"2_CR1","unstructured":"Agrawal, H., DeMillo, R.A., Hathaway, B., Hsu, W., Hsu, W., Krauser, E.W., Martin, R.J., Mathur, A.P., Spafford, E.: Design of mutant operators for the C programming language. techreport SERC-TR-41-P, Purdue University, West Lafayette, Indiana, March 1989"},{"issue":"3","key":"2_CR2","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1002\/stvr.1486","volume":"24","author":"A Arcuri","year":"2014","unstructured":"Arcuri, A., Briand, L.: A hitchhiker\u2019s guide to statistical tests for assessing randomized algorithms in software engineering. Softw. Test. Verif. Reliab. 24(3), 219\u2013250 (2014)","journal-title":"Softw. Test. Verif. Reliab."},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-3-642-23716-4_6","volume-title":"Search Based Software Engineering","author":"A Arcuri","year":"2011","unstructured":"Arcuri, A., Fraser, G.: On parameter tuning in search based software engineering. In: Cohen, M.B., \u00d3 Cinn\u00e9ide, M. (eds.) SSBSE 2011. LNCS, vol. 6956, pp. 33\u201347. Springer, Heidelberg (2011)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Barr, E.T., Brun, Y., Devanbu, P., Harman, M., Sarro, F.: The plastic surgery hypothesis. In: Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering, FSE 2014, pp. 306\u2013317. ACM, New York (2014)","DOI":"10.1145\/2635868.2635898"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Berger, E.D., Zorn, B.G.: Diehard: probabilistic memory safety for unsafe languages. In: Programming Language Design and Implementation, PLDI 2006 (2006)","DOI":"10.1145\/1133255.1134000"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Brake, N., Cordy, J.R., Dan, Y.E., Litoiu, M., Popes U, V.: Automating discovery of software tuning parameters. In: Workshop on Software Engineering for Adaptive and Self-managing Systems, SEAMS 2008 (2008)","DOI":"10.1145\/1370018.1370031"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Bruce, B.R., Petke, J., Harman, M.: Reducing energy consumption using genetic improvement. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, GECCO 2015, pp. 1327\u20131334. ACM, New York (2015)","DOI":"10.1145\/2739480.2754752"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2) (2002)","DOI":"10.1109\/4235.996017"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"DeMillo, R.A., Lipton, R.J., Sayward, F.G.: Hints on test data selection: Help for the practicing programmer. Computer (4), 34\u201341 (1978)","DOI":"10.1109\/C-M.1978.218136"},{"issue":"4","key":"2_CR10","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10664-005-3861-2","volume":"10","author":"H Do","year":"2005","unstructured":"Do, H., Elbaum, S., Rothermel, G.: Supporting controlled experimentation with testing techniques: an infrastructure and its potential impact. Empirical Softw. Eng. 10(4), 405\u2013435 (2005)","journal-title":"Empirical Softw. Eng."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Harman, M., Jia, Y., Langdon, W.B.: Strong higher order mutation-based test data generation. In: Proceedings of the 19th ACM SIGSOFT Symposium and the 13th European Conference on Foundations of Software Engineering, ESEC\/FSE 2011, pp. 212\u2013222 (2011)","DOI":"10.1145\/2025113.2025144"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Harman, M., Jia, Y., Reales Mateo, P., Polo, M.: Angels and monsters: an empirical investigation of potential test effectiveness and efficiency improvement from strongly subsuming higher order mutation. In: Proceedings of the 29th ACM\/IEEE International Conference on Automated Software Engineering, ASE 2014, pp. 397\u2013408. ACM, New York (2014)","DOI":"10.1145\/2642937.2643008"},{"issue":"14","key":"2_CR13","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1016\/S0950-5849(01)00189-6","volume":"43","author":"M Harman","year":"2001","unstructured":"Harman, M., Jones, B.F.: Search-based software engineering. Inf. Softw. Technol. 43(14), 833\u2013839 (2001)","journal-title":"Inf. Softw. Technol."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Harman, M., Langdon, W.B., Jia, Y., White, D.R., Arcuri, A., Clark, J.A.: The gismoe challenge: Constructing the pareto program surface using genetic programming to find better programs (keynote paper). In: Proceedings of the 27th IEEE\/ACM International Conference on Automated Software Engineering, ASE 2012, pp. 1\u201314. ACM, New York (2012)","DOI":"10.1145\/2351676.2351678"},{"issue":"1","key":"2_CR15","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: ParamILS: an automatic algorithm configuration framework. J. Artif. Intell. Res. 36(1), 267\u2013306 (2009)","journal-title":"J. Artif. Intell. Res."},{"issue":"5","key":"2_CR16","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1109\/TSE.2010.62","volume":"37","author":"Y Jia","year":"2011","unstructured":"Jia, Y., Harman, M.: An analysis and survey of the development of mutation testing. IEEE Trans. Softw. Eng. 37(5), 649\u2013678 (2011)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Jia, Y., Harman, M.: MILU: a customizable, runtime-optimized higher order mutation testing tool for the full C language. In: Proceedings of the TAIC PART 2008, Windsor, UK, pp. 94\u201398, 29\u201331 August 2008","DOI":"10.1109\/TAIC-PART.2008.18"},{"issue":"10","key":"2_CR18","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1016\/j.infsof.2009.04.016","volume":"51","author":"Y Jia","year":"2009","unstructured":"Jia, Y., Harman, M.: Higher order mutation testing. Inf. Softw. Technol. 51(10), 1379\u20131393 (2009). Source Code Analysis and Manipulation","journal-title":"Inf. Softw. Technol."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Jia, Y., Wu, F., Harman, M., Krinke, J.: Genetic improvement using higher order mutation. In: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation, GECCO Companion 2015, pp. 803\u2013804. ACM, New York (2015)","DOI":"10.1145\/2739482.2768417"},{"issue":"1","key":"2_CR20","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/TEVC.2013.2281544","volume":"19","author":"W Langdon","year":"2015","unstructured":"Langdon, W., Harman, M.: Optimizing existing software with genetic programming. IEEE Trans. Evol. Comput. 19(1), 118\u2013135 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Langdon, W.B., Modat, M., Petke, J., Harman, M.: Improving 3D medical image registration CUDA software with genetic programming. In: Conference on Genetic and Evolutionary Computation, GECCO 2014 (2014)","DOI":"10.1145\/2576768.2598244"},{"issue":"1","key":"2_CR22","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TSE.2011.104","volume":"38","author":"C Goues Le","year":"2012","unstructured":"Le Goues, C., Nguyen, T., Forrest, S., Weimer, W.: Genprog: a generic method for automatic software repair. IEEE Trans. Softw. Eng. 38(1), 54\u201372 (2012)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Nanavati, J., Wu, F., Harman, M., Jia, Y., Krinke, J.: Mutation testing of memory-related operators. In: 2015 IEEE Eighth International Conference on Software Testing, Verification and Validation Workshops (ICSTW), pp. 1\u201310, April 2015","DOI":"10.1109\/ICSTW.2015.7107449"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/978-3-319-22183-0_29","volume-title":"Search-Based Software Engineering","author":"G Neumann","year":"2015","unstructured":"Neumann, G., Harman, M., Poulding, S.: Transformed Vargha-Delaney effect size. In: Barros, M., Labiche, Y. (eds.) SSBSE 2015. LNCS, vol. 9275, pp. 318\u2013324. Springer, Heidelberg (2015)"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Papadakis, M., Jia, Y., Harman, M., Traon, Y.L.: Trivial compiler equivalence: a large scale empirical study of a simple, fast and effective equivalent mutant detection technique. In: 2015 IEEE\/ACM 37th IEEE International Conference on Software Engineering, vol. 1, pp. 936\u2013946, May 2015","DOI":"10.1109\/ICSE.2015.103"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/978-3-662-44303-3_12","volume-title":"Genetic Programming","author":"J Petke","year":"2014","unstructured":"Petke, J., Harman, M., Langdon, W.B., Weimer, W.: Using genetic improvement and code transplants to specialise a C++ program to a problem class. In: Nicolau, M., Krawiec, K., Heywood, M.I., Castelli, M., Garc\u00eda-S\u00e1nchez, P., Merelo, J.J., Rivas Santos, V.M., Sim, K. (eds.) EuroGP 2014. LNCS, vol. 8599, pp. 137\u2013149. Springer, Heidelberg (2014)"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-3-642-39742-4_21","volume-title":"Search Based Software Engineering","author":"J Petke","year":"2013","unstructured":"Petke, J., Langdon, W.B., Harman, M.: Applying genetic improvement to MiniSAT. In: Ruhe, G., Zhang, Y. (eds.) SSBSE 2013. LNCS, vol. 8084, pp. 257\u2013262. Springer, Heidelberg (2013)"},{"issue":"4","key":"2_CR28","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TEVC.2010.2083669","volume":"15","author":"DR White","year":"2011","unstructured":"White, D.R., Arcuri, A., Clark, J.A.: Evolutionary improvement of programs. IEEE Trans. Evol. Comput. 15(4), 515\u2013538 (2011)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Wu, F., Weimer, W., Harman, M., Jia, Y., Krinke, J.: Deep parameter optimisation. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, GECCO 2015, pp. 1375\u20131382. ACM, New York (2015)","DOI":"10.1145\/2739480.2754648"},{"issue":"4","key":"2_CR30","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput. 3(4), 257\u2013271 (1999)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Search Based Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-47106-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T19:16:25Z","timestamp":1568402185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-47106-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319471051","9783319471068"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-47106-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}