{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:48:14Z","timestamp":1750308494291,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T00:00:00Z","timestamp":1658102400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,18]]},"DOI":"10.1145\/3533767.3543288","type":"proceedings-article","created":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T14:28:50Z","timestamp":1657895330000},"page":"781-784","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Faster mutation analysis with MeMu"],"prefix":"10.1145","author":[{"given":"Ali","family":"Ghanbari","sequence":"first","affiliation":[{"name":"Iowa State University, USA"}]},{"given":"Andrian","family":"Marcus","sequence":"additional","affiliation":[{"name":"University of Texas at Dallas, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Iftekhar Ahmed Carlos Jensen Alex Groce and Paul E McKenney. 2017. Applying mutation analysis on kernel test suites: an experience report. In ICSTW. 110\u2013115. \t\t\t\t\t  Iftekhar Ahmed Carlos Jensen Alex Groce and Paul E McKenney. 2017. Applying mutation analysis on kernel test suites: an experience report. In ICSTW. 110\u2013115.","DOI":"10.1109\/ICSTW.2017.26"},{"volume-title":"Introduction to software testing","author":"Ammann Paul","key":"e_1_3_2_1_2_1","unstructured":"Paul Ammann and Jeff Offutt . 2016. Introduction to software testing . Cambridge University Press . Paul Ammann and Jeff Offutt. 2016. Introduction to software testing. Cambridge University Press."},{"key":"e_1_3_2_1_3_1","unstructured":"Oracle Corporation. 2004. Java Instrumentation API. https:\/\/bit.ly\/3czmzFV Accessed: 105\/22. \t\t\t\t\t  Oracle Corporation. 2004. Java Instrumentation API. https:\/\/bit.ly\/3czmzFV Accessed: 105\/22."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Vidroha Debroy and W Eric Wong. 2010. Using mutation to automatically suggest fixes for faulty programs. In ICST. 65\u201374. \t\t\t\t\t  Vidroha Debroy and W Eric Wong. 2010. Using mutation to automatically suggest fixes for faulty programs. In ICST. 65\u201374.","DOI":"10.1109\/ICST.2010.66"},{"volume-title":"Hints on test data selection: Help for the practicing programmer","author":"DeMillo Richard A","key":"e_1_3_2_1_5_1","unstructured":"Richard A DeMillo , Richard J Lipton , and Frederick G Sayward . 1978. Hints on test data selection: Help for the practicing programmer . IEEE Computer , 34\u201341. Richard A DeMillo, Richard J Lipton, and Frederick G Sayward. 1978. Hints on test data selection: Help for the practicing programmer. IEEE Computer, 34\u201341."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Richard A DeMillo and A Jefferson Offutt. 1991. Constraint-based automatic test data generation. TSE 900\u2013910. \t\t\t\t\t  Richard A DeMillo and A Jefferson Offutt. 1991. Constraint-based automatic test data generation. TSE 900\u2013910.","DOI":"10.1109\/32.92910"},{"key":"e_1_3_2_1_7_1","volume-title":"Eva May, Gordon Fraser, and Andreas Zeller.","author":"Galeotti Juan P","year":"2015","unstructured":"Juan P Galeotti , Carlo A Furia , Eva May, Gordon Fraser, and Andreas Zeller. 2015 . Inferring loop invariants by mutation, dynamic analysis, and static checking. TSE , 1019\u20131037. Juan P Galeotti, Carlo A Furia, Eva May, Gordon Fraser, and Andreas Zeller. 2015. Inferring loop invariants by mutation, dynamic analysis, and static checking. TSE, 1019\u20131037."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Ali Ghanbari Samuel Benton and Lingming Zhang. 2019. Practical program repair via bytecode mutation. In ISSTA. 19\u201330. \t\t\t\t\t  Ali Ghanbari Samuel Benton and Lingming Zhang. 2019. Practical program repair via bytecode mutation. In ISSTA. 19\u201330.","DOI":"10.1109\/ASE.2019.00116"},{"key":"e_1_3_2_1_9_1","unstructured":"Ali Ghanbari and Andrian Marcus. 2020. Faster Mutation Analysis with MeMu. https:\/\/github.com\/ali-ghanbari\/memu-demo Accessed: 05\/22. \t\t\t\t\t  Ali Ghanbari and Andrian Marcus. 2020. Faster Mutation Analysis with MeMu. https:\/\/github.com\/ali-ghanbari\/memu-demo Accessed: 05\/22."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Ali Ghanbari and Andrian Marcus. 2021. Toward Speeding up Mutation Analysis by Memoizing Expensive Methods. In ICSE-NIER. 71\u201375. \t\t\t\t\t  Ali Ghanbari and Andrian Marcus. 2021. Toward Speeding up Mutation Analysis by Memoizing Expensive Methods. In ICSE-NIER. 71\u201375.","DOI":"10.1109\/ICSE-NIER52604.2021.00023"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Milos Gligoric Vilas Jagannath and Darko Marinov. 2010. MuTMuT: Efficient exploration for mutation testing of multithreaded code. In ICST. 55\u201364. \t\t\t\t\t  Milos Gligoric Vilas Jagannath and Darko Marinov. 2010. MuTMuT: Efficient exploration for mutation testing of multithreaded code. In ICST. 55\u201364.","DOI":"10.1109\/ICST.2010.33"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Ren\u00e9 Just Michael D. Ernst and Gordon Fraser. 2014. Efficient mutation analysis by propagating and partitioning infected execution states. In ISSTA. 315\u2013326. \t\t\t\t\t  Ren\u00e9 Just Michael D. Ernst and Gordon Fraser. 2014. Efficient mutation analysis by propagating and partitioning infected execution states. In ISSTA. 315\u2013326.","DOI":"10.1145\/2610384.2610388"},{"key":"e_1_3_2_1_13_1","volume-title":"MAJOR: An efficient and extensible tool for mutation analysis in a Java compiler. In ASE. 612\u2013615.","author":"Just Rene","year":"2011","unstructured":"Rene Just , Franz Schweiggert , and Gregory M Kapfhammer . 2011 . MAJOR: An efficient and extensible tool for mutation analysis in a Java compiler. In ASE. 612\u2013615. Rene Just, Franz Schweiggert, and Gregory M Kapfhammer. 2011. MAJOR: An efficient and extensible tool for mutation analysis in a Java compiler. In ASE. 612\u2013615."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Kim N King and A Jefferson Offutt. 1991. A fortran language system for mutation-based software testing. SPE 685\u2013718. \t\t\t\t\t  Kim N King and A Jefferson Offutt. 1991. A fortran language system for mutation-based software testing. SPE 685\u2013718.","DOI":"10.1002\/spe.4380210704"},{"volume-title":"Memo","author":"Michie Donald","key":"e_1_3_2_1_15_1","unstructured":"Donald Michie . 1968. \u201c Memo \u201d functions and machine learning. Nature , 19\u201322. Donald Michie. 1968. \u201cMemo\u201d functions and machine learning. Nature, 19\u201322."},{"key":"e_1_3_2_1_16_1","unstructured":"OW2 Consortium. 2020. ASM Bytecode Manipulation Framework. http:\/\/bit.ly\/3fsPL2r Accessed: 05\/22. \t\t\t\t\t  OW2 Consortium. 2020. ASM Bytecode Manipulation Framework. http:\/\/bit.ly\/3fsPL2r Accessed: 05\/22."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.1509"},{"key":"e_1_3_2_1_18_1","unstructured":"PIT Contributors. 2022. PIT Mutation Testing. https:\/\/bit.ly\/36Xvhho Accessed: 05\/22. \t\t\t\t\t  PIT Contributors. 2022. PIT Mutation Testing. https:\/\/bit.ly\/36Xvhho Accessed: 05\/22."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2019.07.100"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Donghwan Shin Shin Yoo Mike Papadakis and Doo-Hwan Bae. 2019. Empirical evaluation of mutation-based test case prioritization techniques. STVR e1695. \t\t\t\t\t  Donghwan Shin Shin Yoo Mike Papadakis and Doo-Hwan Bae. 2019. Empirical evaluation of mutation-based test case prioritization techniques. STVR e1695.","DOI":"10.1002\/stvr.1695"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Roland H Untch A Jefferson Offutt and Mary Jean Harrold. 1993. Mutation analysis using mutant schemata. In ISSTA. 139\u2013148. \t\t\t\t\t  Roland H Untch A Jefferson Offutt and Mary Jean Harrold. 1993. Mutation analysis using mutant schemata. In ISSTA. 139\u2013148.","DOI":"10.1145\/174146.154265"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Bo Wang Yingfei Xiong Yangqingwei Shi Lu Zhang and Dan Hao. 2017. Faster Mutation Analysis via Equivalence modulo States. In ISSTA. 295\u2013306. \t\t\t\t\t  Bo Wang Yingfei Xiong Yangqingwei Shi Lu Zhang and Dan Hao. 2017. Faster Mutation Analysis via Equivalence modulo States. In ISSTA. 295\u2013306.","DOI":"10.1145\/3092703.3092714"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Jie Zhang Ziyi Wang Lingming Zhang Dan Hao Lei Zang Shiyang Cheng and Lu Zhang. 2016. Predictive Mutation Testing. In ISSTA. 342\u2013353. \t\t\t\t\t  Jie Zhang Ziyi Wang Lingming Zhang Dan Hao Lei Zang Shiyang Cheng and Lu Zhang. 2016. Predictive Mutation Testing. In ISSTA. 342\u2013353.","DOI":"10.1145\/2931037.2931038"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Lingming Zhang Darko Marinov and Sarfraz Khurshid. 2013. Faster mutation testing inspired by test prioritization and reduction. In ISSTA. 235\u2013245. \t\t\t\t\t  Lingming Zhang Darko Marinov and Sarfraz Khurshid. 2013. Faster mutation testing inspired by test prioritization and reduction. In ISSTA. 235\u2013245.","DOI":"10.1145\/2483760.2483782"}],"event":{"name":"ISSTA '22: 31st ACM SIGSOFT International Symposium on Software Testing and Analysis","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"Virtual South Korea","acronym":"ISSTA '22"},"container-title":["Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3533767.3543288","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3533767.3543288","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:43:41Z","timestamp":1750272221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3533767.3543288"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,18]]},"references-count":24,"alternative-id":["10.1145\/3533767.3543288","10.1145\/3533767"],"URL":"https:\/\/doi.org\/10.1145\/3533767.3543288","relation":{},"subject":[],"published":{"date-parts":[[2022,7,18]]},"assertion":[{"value":"2022-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}