{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T18:22:45Z","timestamp":1747333365123,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319689715"},{"type":"electronic","value":"9783319689722"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68972-2_11","type":"book-chapter","created":{"date-parts":[[2017,10,10]],"date-time":"2017-10-10T01:42:41Z","timestamp":1507599761000},"page":"164-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["TCE+: An Extension of the TCE Method for Detecting Equivalent Mutants in Java Programs"],"prefix":"10.1007","author":[{"given":"Mahdi","family":"Houshmand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samad","family":"Paydar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,11]]},"reference":[{"issue":"5","key":"11_CR1","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."},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF00625279","volume":"18","author":"TA Budd","year":"1982","unstructured":"Budd, T.A., Angluin, D.: Two notions of correctness and their relation to testing. Acta Informatica 18(1), 31\u201345 (1982)","journal-title":"Acta Informatica"},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/(SICI)1099-1689(199709)7:3<165::AID-STVR143>3.0.CO;2-U","volume":"7","author":"AJ Offutt","year":"1997","unstructured":"Offutt, A.J., Pan, J.: Automatically detecting equivalent mutants and infeasible paths. Softw. Testing Verification Reliab. 7(3), 165\u2013192 (1997)","journal-title":"Softw. Testing Verification Reliab."},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/TSE.2013.44","volume":"40","author":"L Madeyski","year":"2014","unstructured":"Madeyski, L., et al.: 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)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"5","key":"11_CR5","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1002\/stvr.1473","volume":"23","author":"D Schuler","year":"2013","unstructured":"Schuler, D., Zeller, A.: Covering and uncovering equivalent mutants. Softw. Testing Verification Reliab. 23(5), 353\u2013374 (2013)","journal-title":"Softw. Testing Verification Reliab."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Papadakis, M., Le Traon, Y.: Mutation testing strategies using mutant classification. In: Proceedings of the 28th Annual ACM Symposium on Applied Computing. ACM (2013)","DOI":"10.1145\/2480362.2480592"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1007\/978-3-540-24855-2_155","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"K Adamopoulos","year":"2004","unstructured":"Adamopoulos, K., Harman, M., Hierons, R.M.: How to overcome the equivalent mutant problem and achieve tailored selective mutation using co-evolution. In: Deb, K. (ed.) GECCO 2004. LNCS, vol. 3103, pp. 1338\u20131349. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-24855-2_155"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Kintis, M., Malevris, N.: Using data flow patterns for equivalent mutant detection. In: 2014 IEEE Seventh International Conference on Software Testing, Verification and Validation Workshops (ICSTW). IEEE (2014)","DOI":"10.1109\/ICSTW.2014.21"},{"issue":"10","key":"11_CR9","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(10), 1379\u20131393 (2009)","journal-title":"Inf. Softw. Technol."},{"issue":"4","key":"11_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1002\/(SICI)1099-1689(199912)9:4<233::AID-STVR191>3.0.CO;2-3","volume":"9","author":"R Hierons","year":"1999","unstructured":"Hierons, R., Harman, M., Danicic, S.: Using program slicing to assist in the detection of equivalent mutants. Softw. Testing Verification Reliab. 9(4), 233\u2013262 (1999)","journal-title":"Softw. Testing Verification Reliab."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Schuler, D., Andreas Z.: (Un-) Covering equivalent mutants. In: 2010 Third International Conference on Software Testing, Verification and Validation. IEEE (2010)","DOI":"10.1109\/ICST.2010.30"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Papadakis, M., et al.: 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. IEEE (2015)","DOI":"10.1109\/ICSE.2015.103"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Kintis, M., Malevris, N.: Identifying more equivalent mutants via code similarity. In: 2013 20th Asia-Pacific Software Engineering Conference, vol. 1. IEEE (2013)","DOI":"10.1109\/APSEC.2013.34"},{"issue":"06","key":"11_CR14","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1142\/S021819400200113X","volume":"12","author":"AMR Vincenzi","year":"2002","unstructured":"Vincenzi, A.M.R., et al.: Bayesian-learning based guidelines to determine equivalent mutants. Int. J. Softw. Eng. Knowl. Eng. 12(06), 675\u2013689 (2002)","journal-title":"Int. J. Softw. Eng. Knowl. Eng."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Nica, S., Wotawa, F.: Using constraints for equivalent mutant detection. arXiv preprint arXiv:1207.2234 (2012)","DOI":"10.4204\/EPTCS.86.1"},{"key":"11_CR16","unstructured":"Just, R., Ernst, M.D., Fraser, G.: Using state infection conditions to detect equivalent mutants and speed up mutation analysis. arXiv preprint arXiv:1303.2784 (2013)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Rojas, J.M., Fraser, G.: Code defenders: a mutation testing game. In: The 11th International Workshop on Mutation Analysis. IEEE (2015)","DOI":"10.1109\/ICSTW.2016.43"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.infsof.2015.07.009","volume":"68","author":"M Kintis","year":"2015","unstructured":"Kintis, M., Malevris, N.: MEDIC: A static analysis framework for equivalent mutant identification. Inf. Softw. Technol. 68, 1\u201317 (2015)","journal-title":"Inf. Softw. Technol."},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Yao, X., Harman, M., Jia, Y.: A study of equivalent and stubborn mutation operators using human analysis of equivalence. In: Proceedings of the 36th International Conference on Software Engineering. ACM (2014)","DOI":"10.1145\/2568225.2568265"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Harman, M., Jia, Y., Langdon, W.B.: A manifesto for higher order mutation testing. In: 2010 Third International Conference on Software Testing, Verification, and Validation Workshops (ICSTW). IEEE (2010)","DOI":"10.1109\/ICSTW.2010.13"},{"key":"11_CR21","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. AISC, vol. 358, pp. 391\u2013402. Springer, Cham (2015). doi:10.1007\/978-3-319-17996-4_35"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Omar, E., Ghosh, S., Whitley, D.: Constructing subtle higher order mutants for Java and AspectJ programs. In: 2013 IEEE 24th International Symposium on Software Reliability Engineering (ISSRE). IEEE (2013)","DOI":"10.1109\/ISSRE.2013.6698887"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Ma, Y.-S., Offutt, J., Kwon, Y.-R.: MuJava: a mutation system for Java. In: Proceedings of the 28th International Conference on Software Engineering. ACM (2006)","DOI":"10.1145\/1134285.1134425"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Just, R., et al.: Are mutants a valid substitute for real faults in software testing? In: Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering. ACM (2014)","DOI":"10.1145\/2635868.2635929"},{"key":"11_CR25","unstructured":"Weitao, W., Hirohide, H.: Improvement of equivalent mutant detection using loop count restriction. In: The International Conference on Software Engineering, Mobile Computing and Media Informatics (SEMCMI 2015) (2015)"},{"issue":"3","key":"11_CR26","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/(SICI)1097-024X(199803)28:3<297::AID-SPE156>3.0.CO;2-M","volume":"28","author":"S Diehl","year":"1998","unstructured":"Diehl, S.: A formal introduction to the compilation of Java. Softw.-Pract. Experience 28(3), 297\u2013327 (1998)","journal-title":"Softw.-Pract. Experience"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68972-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T01:58:20Z","timestamp":1633917500000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-68972-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319689715","9783319689722"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68972-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"11 October 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FSEN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Fundamentals of Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Teheran","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Iran","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 April 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fsen2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fsen.ir\/2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}