{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T14:01:07Z","timestamp":1726063267669},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030383633"},{"type":"electronic","value":"9783030383640"}],"license":[{"start":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T00:00:00Z","timestamp":1576800000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-38364-0_32","type":"book-chapter","created":{"date-parts":[[2019,12,19]],"date-time":"2019-12-19T04:07:51Z","timestamp":1576728471000},"page":"361-369","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Improvement of Applying Multi-objective Optimization Algorithm into Higher Order Mutation Testing"],"prefix":"10.1007","author":[{"given":"Quang-Vu","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai-Bang","family":"Truong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,20]]},"reference":[{"issue":"4","key":"32_CR1","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/C-M.1978.218136","volume":"11","author":"RA DeMillo","year":"1978","unstructured":"DeMillo, R.A., Lipton, R.J., Sayward, F.G.: Hints on test data selection: help for the practicing programmer. IEEE Comput. 11(4), 34\u201341 (1978)","journal-title":"IEEE Comput."},{"issue":"4","key":"32_CR2","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/TSE.1977.231145","volume":"SE-3","author":"RG Hamlet","year":"1977","unstructured":"Hamlet, R.G.: Testing programs with the aid of a compiler. IEEE Trans. Softw. Eng. SE-3(4), 279\u2013290 (1977)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-319-06569-4_12","volume-title":"Advanced Computational Methods for Knowledge Engineering","author":"Quang Vu Nguyen","year":"2014","unstructured":"Nguyen, Q.V., Madeyski, L.: Problems of mutation testing and higher order mutation testing. In Do, T., Le Thi, H.A., Nguyen, N.T. (eds.) ICCSAMA 2014, Advanced Computational Methods for Knowledge Engineering. Advances in Intelligent Systems and Computing, vol. 282, pp. 157\u2013172. Springer (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-06569-4_12"},{"issue":"5","key":"32_CR4","doi-asserted-by":"publisher","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":"32_CR5","doi-asserted-by":"publisher","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, 1379\u20131393 (2009)","journal-title":"Inf. Softw. Technol."},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Harman, M., Jia, Y., Langdon, W.B.: A manifesto for higher order mutation testing. In: Third International Conference on Software Testing, Verification, and Validation Workshops (2010)","DOI":"10.1109\/ICSTW.2010.13"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/125489.125473","volume":"1","author":"AJ Offutt","year":"1992","unstructured":"Offutt, A.J.: Investigations of the software testing coupling effect. ACM Trans. Softw. Eng. Methodol. 1, 5\u201320 (1992)","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"issue":"2","key":"32_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/stvr.392","volume":"19","author":"M Polo","year":"2008","unstructured":"Polo, M., Piattini, M., Garcia-Rodriguez, I.: Decreasing the cost of mutation testing with second-order mutants. Softw. Test. Verif. Reliab. 19(2), 111\u2013131 (2008)","journal-title":"Softw. Test. Verif. Reliab."},{"issue":"1","key":"32_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/TSE.2013.44","volume":"40","author":"L Madeyski","year":"2014","unstructured":"Madeyski, L., Orzeszyna, W., Torkar, R., J\u00f3zala, M.: Overcoming the equivalent mutant problem: a systematic literature review and a comparative experiment of second order mutation. IEEE Trans. Softw. Eng. 40(1), 23\u201342 (2014). \nhttps:\/\/doi.org\/10.1109\/TSE.2013.44","journal-title":"IEEE Trans. Softw. Eng."},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Jia, Y., Harman, M.: Constructing subtle faults using higher order mutation testing. In: Proceedings of Eighth International Working Conference on Source Code Analysis and Manipulation (2008)","DOI":"10.1109\/SCAM.2008.36"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Omar, E., Ghosh, S., Whitley, D.: Constructing subtle higher order mutants for Java and AspectJ programs. International Symposium on Software Reliability Engineering, pp. 340\u2013349 (2013)","DOI":"10.1109\/ISSRE.2013.6698887"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Omar, E., Ghosh, S., Whitley, D.: Comparing search techniques for fnding subtle higher order mutants. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, pp. 1271\u20131278 (2014)","DOI":"10.1145\/2576768.2598286"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-17578-7_17","volume-title":"Advances in Software Engineering","author":"Fevzi Belli","year":"2010","unstructured":"Fevzi Belli, F., Guler, N., Hollmann A., Suna, E., Yildiz, E.: Model based higher-order mutation analysis. In: Advances in Software Engineering. Communications in Computer and Information Science, vol. 117, pp. 164\u2013173 (2010)"},{"issue":"3","key":"32_CR14","first-page":"13","volume":"2","author":"AO Akinde","year":"2012","unstructured":"Akinde, A.O.: Using higher order mutation for reducing equivalent mutants in mutation testing. Asian J. Comput. Sci. Inf. Technol. 2(3), 13\u201318 (2012)","journal-title":"Asian J. Comput. Sci. Inf. Technol."},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Langdon, W.B., Harman, M., Jia, Y.: Multi-objective higher order mutation testing with genetic programming. In: Proceedings Fourth Testing: Academic and Industrial Conference Practice and Research (2009)","DOI":"10.1109\/TAICPART.2009.18"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"2416","DOI":"10.1016\/j.jss.2010.07.027","volume":"83","author":"WB Langdon","year":"2010","unstructured":"Langdon, W.B., Harman, M., Jia, Y.: Efficient multi-objective higher order mutation testing with genetic programming. J. Syst. Softw. 83, 2416\u20132430 (2010)","journal-title":"J. Syst. Softw."},{"key":"32_CR17","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-319-17996-4_35","volume-title":"Advanced Computational Methods for Knowledge Engineering","author":"QV Nguyen","year":"2015","unstructured":"Nguyen, Q.V., Madeyski, L.: Searching for strongly subsuming higher order mutants by applying multi-objective optimization algorithm. In: Le Thi, H.A., Nguyen, N.T., Do, T.V. (eds.) Advanced Computational Methods for Knowledge Engineering. Advances in Intelligent Systems and Computing, vol. 358, pp. 391\u2013402. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-17996-4_35"},{"key":"32_CR18","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1080\/01969722.2016.1128763","volume":"47","author":"QV Nguyen","year":"2016","unstructured":"Nguyen, Q.V., Madeyski, L.: Empirical evaluation of multi-objective optimization algorithms searching for higher order mutants. Cybern. Syst. Int. J. 47, 48\u201368 (2016)","journal-title":"Cybern. Syst. Int. J."},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Nguyen, Q.V., Madeyski, L.: Higher order mutation testing to drive development of new test cases: an empirical comparison of three strategies. Lecture Notes in Computer Science (2016)","DOI":"10.1007\/978-3-662-49381-6_23"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Nguyen, Q.V., Madeyski, L.: On the relationship between the order of mutation testing and the properties of generated higher order mutants. Lecture Notes in Computer Science (2016)","DOI":"10.1007\/978-3-662-49381-6_24"},{"key":"32_CR21","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.3233\/JIFS-169117","volume":"32","author":"QV Nguyen","year":"2017","unstructured":"Nguyen, Q.V., Madeyski, L.: Addressing mutation testing problems by applying multi-objective optimization algorithms and higher order mutation. J. Intell. Fuzzy Syst. 32, 1173\u20131182 (2017). \nhttps:\/\/doi.org\/10.3233\/JIFS-169117","journal-title":"J. Intell. Fuzzy Syst."},{"key":"32_CR22","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1007\/978-3-319-75417-8_62","volume-title":"Intelligent Information and Database Systems","author":"Quang-Vu Nguyen","year":"2018","unstructured":"Nguyen Q.V., Pham D.T.H.: Is higher order mutant harder to kill than first order mutant? An experimental study. Lecture Notes in Computer Science, vol. 10751. Springer (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-75417-8_62"},{"issue":"1","key":"32_CR23","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1049\/iet-sen.2008.0038","volume":"4","author":"L Madeyski","year":"2010","unstructured":"Madeyski, L., Radyk, N.: Judy - a mutation testing tool for Java. IET Softw. 4(1), 32\u201342 (2010). \nhttps:\/\/doi.org\/10.1049\/iet-sen.2008.0038","journal-title":"IET Softw."},{"issue":"2","key":"32_CR24","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multi objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"32_CR25","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, Part I: solving problems with box constraints. IEEE Trans. Evol. Comput. 18(4), 577\u2013601 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"32_CR26","first-page":"386","volume-title":"Lecture Notes in Computer Science","author":"Joshua B. Kollat","year":"2005","unstructured":"Kollat, J.B., Reed, P.M.: The value of online adaptive search: a performance comparison of NSGAII, \u03b5-NSGAII and \u03b5-MOEA. In: Coello, C.A.C., Aguirre, A.H., Zitzler, E. (eds.) Third International Conference on Evolutionary Multi-Criterion Optimization, EMO 2005, Guanajuato, Mexico, 9\u201311 March 2005 (2005)"},{"key":"32_CR27","doi-asserted-by":"crossref","unstructured":"Deb, K., Mohan, M., Mishra, S.: A Fast Multi-objective Evolutionary Algorithm for Finding Well-Spread Pareto-Optimal Solutions. KenGAL, Report No. 2003002. Indian Institute of Technology, Kanpur, India (2003)","DOI":"10.1007\/3-540-36970-8_16"},{"key":"32_CR28","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength Pareto evolutionary algorithm for multi-objective optimization. In: Giannakoglou, K., Tsahalis, D., Periaux, J., Papailiou. K., Fogarty, T. (eds.) Evolutionary Methods for Design, Optimisations and Control, pp. 19\u201326 (2002)"},{"key":"32_CR29","volume-title":"Code Complete","author":"S McConnell","year":"2004","unstructured":"McConnell, S.: Code Complete, 2nd edn. Microsoft Press, Redmond (2004)","edition":"2"}],"container-title":["Advances in Intelligent Systems and Computing","Advanced Computational Methods for Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38364-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,19]],"date-time":"2019-12-19T04:16:34Z","timestamp":1576728994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38364-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,20]]},"ISBN":["9783030383633","9783030383640"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38364-0_32","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,12,20]]},"assertion":[{"value":"20 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSAMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Science, Applied Mathematics and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hanoi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsama2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lita.univ-lorraine.fr\/~iccsama2019\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}