{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T18:22:55Z","timestamp":1747333375116,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030529901"},{"type":"electronic","value":"9783030529918"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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-52991-8_4","type":"book-chapter","created":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T15:04:41Z","timestamp":1595343881000},"page":"58-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Quantitative Analysis of Mutant Equivalence"],"prefix":"10.1007","author":[{"given":"Amani","family":"Ayad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Imen","family":"Marsit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sara","family":"Tawfig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji Meng","family":"Loh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed Nazih","family":"Omri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6578-5510","authenticated-orcid":false,"given":"Ali","family":"Mili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,22]]},"reference":[{"key":"4_CR1","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). \nhttps:\/\/doi.org\/10.1007\/978-3-540-24855-2_155"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Andrews, J., Briand, L., Labiche, Y.: Is mutation an appropriate tool for testing experiments? In: Proceedings, ICSE (2005)","DOI":"10.1145\/1062455.1062530"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Androutsopoulos, K., Clark, D., Dan, H., Hierons, R.M., Harman, M.: An analysis of the relationship between conditional entropy and failed error propagation in software testing. In: Proceedings, ICSE 2014 (2014)","DOI":"10.1145\/2568225.2568314"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/TDSC.2004.2","volume":"1","author":"A Avizienis","year":"2004","unstructured":"Avizienis, A., Laprie, J.C., Randell, B., Landwehr, C.E.: Basic concepts and taxonomy of dependable and secure computing. IEEE Trans. Dependable Secure Comput. 1(1), 11\u201333 (2004)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Ayad, A., Marsit, I., Loh, J., Omri, M.N., Mili, A.: Quanatitative metrics for mutation testing. In: Proceedings, ICSOFT 2019, Prague, Czech Republic, July 2019","DOI":"10.5220\/0007841800490059"},{"key":"4_CR6","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-29157-0_1","volume-title":"Software Technologies","author":"A Ayad","year":"2019","unstructured":"Ayad, A., Marsit, I., Mohamed Omri, N., Loh, J.M., Mili, A.: Using semantic metrics to predict mutation equivalence. In: van Sinderen, M., Maciaszek, L.A. (eds.) ICSOFT 2018. CCIS, vol. 1077, pp. 3\u201327. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-29157-0_1"},{"issue":"1","key":"4_CR7","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"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Carvalho, L., Guimares, M., Fernandes, L., Hajjaji, M.A., Gheyi, R., Thuem, T.: Equivalent mutants in configurable systems: an empirical study. In: Proceedings, VAMOS 2018, Madrid, Spain (2018)","DOI":"10.1145\/3168365.3168379"},{"key":"4_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"I Csiszar","year":"2011","unstructured":"Csiszar, I., Koerner, J.: Information Theory: Coding Theorems for Discrete Memoryless Systems. Cambridge University Press, Cambridge (2011)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-1-4757-5939-6_17","volume-title":"Mutation Testing for the New Century","author":"ME Delamaro","year":"2001","unstructured":"Delamaro, M.E., Maldonado, J.C., Vincenzi, A.M.R.: Proteum \/im 2.0: an integrated mutation testing environment. In: Wong, W.E. (ed.) Mutation Testing for the New Century, vol. 24, pp. 91\u2013101. Springer, Boston (2001). \nhttps:\/\/doi.org\/10.1007\/978-1-4757-5939-6_17"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Gruen, B., Schuler, D., Zeller, A.: The impact of equivalent mutants. In: Proceedings, MUTATION 2009, Denver, CO, USA (2009)","DOI":"10.1109\/ICSTW.2009.37"},{"issue":"4","key":"4_CR12","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. J. Softw. Test. Verif. Reliab. 9(4), 233\u2013262 (1999)","journal-title":"J. Softw. Test. Verif. Reliab."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Inozemtseva, L., Holmes, R.: Coverage is not strongly correlated with test suite effectiveness. In: Procedings, 36th International Conference on Software Engineering. ACM Press (2014)","DOI":"10.1145\/2568225.2568271"},{"key":"4_CR14","unstructured":"Just, R., Ernst, M., Fraser, G.: Using state infection conditions to detect equivalent mutants and speed up mutation analysis. In: Dagstuhl Seminar 13021: Symbolic Methods in Testing, Wadern, Germany (2013)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Just, R., Ernst, M., Fraser, G.: Efficient mutation analysis by propagating and partitioning infected execution states. In: Proceedings, ISSTA 2014, San Jose, CA, USA (2014)","DOI":"10.1145\/2610384.2610388"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Just, R., Jalali, D., Inozemtseva, L., Ernst, M., Holmes, R., Fraser, G.: Are mutants a valid substitute for real faults in software testing? In: Proceedings, FSE (2014)","DOI":"10.1145\/2635868.2635929"},{"key":"4_CR17","unstructured":"Just, R., Ernst, M.D., Fraser, G.: Using state infection conditions to detect equivalent mutants and sped up mutation analysis. In: Proceedings, Dagstuhl Seminar 13021: Symbolic Methods in Testing (2013)"},{"issue":"4","key":"4_CR18","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1109\/TSE.2017.2684805","volume":"44","author":"M Kintis","year":"2018","unstructured":"Kintis, M., Papadakis, M., Jia, Y., Malveris, N., Le Traon, Y., Harman, M.: Detecting trivial mutant equivalences via compiler optimizations. IEEE Trans. Softw. Eng. 44(4), 308\u2013333 (2018)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"4_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-9170-5","volume-title":"Dependability: Basic Concepts and Terminology: In English, French, German, Italian and Japanese","author":"JC Laprie","year":"1991","unstructured":"Laprie, J.C.: Dependability: Basic Concepts and Terminology: In English, French, German, Italian and Japanese. Springer, Heidelberg (1991). \nhttps:\/\/doi.org\/10.1007\/978-3-7091-9170-5"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-79789-7_1","volume-title":"Predictably Dependable Computing Systems","author":"JC Laprie","year":"1995","unstructured":"Laprie, J.C.: Dependability - its attributes, impairments and means. In: Randell, B., Laprie, J.C., Kopetz, H., Littlewood, B. (eds.) Predictably Dependable Computing Systems, pp. 1\u201319. Springer, Heidelberg (1995). \nhttps:\/\/doi.org\/10.1007\/978-3-642-79789-7_1"},{"key":"4_CR21","unstructured":"Laprie, J.C.: Dependable computing: concepts, challenges, directions. In: Proceedings, COMPSAC (2004)"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Marsit, I., Omri, M.N., Loh, J.M., Mili, A.: Impact of mutation operators on mutant equivalence. In: Proceedings, ICSOFT 2018, pp. 55\u201366 (2018)","DOI":"10.5220\/0006833000210032"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Namin, A.S., Kakarla, S.: The use of mutation in testing experiments and its sensitivity to external threats. In: Proceedings, ISSTA (2011)","DOI":"10.1145\/2001420.2001461"},{"key":"4_CR24","unstructured":"Nica, S., Wotawa, F.: Using constraints for equivalent mutant detection. In: Andres, C., Llana, L. (eds.) Second Workshop on Formal methods in the Development of Software, pp. 1\u20138. EPTCS (2012). \nhttps:\/\/doi.org\/10.420\/EPTCS.86.1"},{"issue":"3","key":"4_CR25","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 Offut","year":"1997","unstructured":"Offut, A.J., Pan, J.: Automatically detecting equivalent mutants and infeasible paths. Softw. Test. Verif. Reliab. 7(3), 165\u2013192 (1997)","journal-title":"Softw. Test. Verif. Reliab."},{"issue":"P3","key":"4_CR26","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.scico.2014.05.012","volume":"95","author":"M Papadakis","year":"2014","unstructured":"Papadakis, M., Delamaro, M., LeTraon, Y.: Mitigating the effects of equivalent mutants with mutant clasification strategies. Sci. Comput. Program. 95(P3), 298\u2013319 (2014)","journal-title":"Sci. Comput. Program."},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Papadakis, M., Kintis, M., Zhang, J., Jia, Y., Traon, Y.L., Harman, M.: Mutation testing advances: an analysis and survey. In: Advances in Computers (2019)","DOI":"10.1016\/bs.adcom.2018.03.015"},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"Schuler, D., Zeller, A.: Covering and uncovering equivalent mutants. In: Proceedings, International Conference on Software Testing, Verification and Validation, pp. 45\u201354 (2010). \nhttps:\/\/doi.org\/10.1109\/ICST.2010.30","DOI":"10.1109\/ICST.2010.30"},{"issue":"379\u2013423","key":"4_CR29","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1002\/j.1538-7305.1948.tb00917.x","volume":"27","author":"C Shannon","year":"1948","unstructured":"Shannon, C.: A mathematical theory of communication. Bell Syst. Tech. J. 27(379\u2013423), 623\u2013656 (1948)","journal-title":"Bell Syst. Tech. J."},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Wang, B., Xiong, Y., Shi, Y., Zhang, L., Hao, D.: Faster mutation analysis via equivalence modulo states. In: Proceedings, ISSTA 2017, Santa Barbara, CA, USA (2017)","DOI":"10.1145\/3092703.3092714"},{"key":"4_CR31","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, ICSE (2014)","DOI":"10.1145\/2568225.2568265"}],"container-title":["Communications in Computer and Information Science","Software Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-52991-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T15:16:39Z","timestamp":1595344599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-52991-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030529901","9783030529918"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-52991-8_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSOFT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Software Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","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":"26 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icsoft2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icsoft.org\/?y=2019","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"PRIMORIS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"116","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}