{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:15:31Z","timestamp":1775873731027,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T00:00:00Z","timestamp":1527379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1409423, CCF-1421503, CCF-1566589"],"award-info":[{"award-number":["CCF-1409423, CCF-1421503, CCF-1566589"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,27]]},"DOI":"10.1145\/3183440.3183485","type":"proceedings-article","created":{"date-parts":[[2018,6,18]],"date-time":"2018-06-18T12:28:18Z","timestamp":1529324898000},"page":"25-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["An extensible, regular-expression-based tool for multi-language mutant generation"],"prefix":"10.1145","author":[{"given":"Alex","family":"Groce","sequence":"first","affiliation":[{"name":"Northern Arizona University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josie","family":"Holmes","sequence":"additional","affiliation":[{"name":"Northern Arizona University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darko","family":"Marinov","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"August","family":"Shi","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lingming","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Texas at Dallas"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"pyfakefs implements a fake file system that mocks the Python file system modules. https:\/\/github.com\/jmcgeheeiv\/pyfakefs. (June","year":"2011","unstructured":"2011. pyfakefs implements a fake file system that mocks the Python file system modules. https:\/\/github.com\/jmcgeheeiv\/pyfakefs. (June 2011)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","unstructured":"I. Ahmed R. Gopinath C. Brindescu A. Groce and C.Jensen. 2016. Can testedness be effectively measured?. In FSE. 10.1145\/2950290.2950324","DOI":"10.1145\/2950290.2950324"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"I. Ahmed C. Jensen A. Groce and P. E. McKenney. 2017. Applying mutation analysis on kernel test suites: an experience report. In MUTATION.","DOI":"10.1109\/ICSTW.2017.26"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","unstructured":"M. A. Alipour A. Shi R. Gopinath D. Marinov and A. Groce. 2016. Evaluating non-adequate test-case reduction. In ASE. 10.1145\/2970276.2970361","DOI":"10.1145\/2970276.2970361"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","unstructured":"J. H. Andrews L. C. Briand and Y. Labiche. 2005. Is mutation an appropriate tool for testing experiments?. In ICSE. 10.1145\/1062455.1062530","DOI":"10.1145\/1062455.1062530"},{"key":"e_1_3_2_1_6_1","unstructured":"H. Coles. 2010. PIT Mutation Testing. http:\/\/pittest.org\/. (2010)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","unstructured":"R. A. DeMillo R. J. Lipton and F. G. Sayward. 1978. Hints on test data selection: Help for the practicing programmer. Computer 4 11 (1978). 10.1109\/C-M.1978.218136","DOI":"10.1109\/C-M.1978.218136"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"M. Gligoric A. Groce C. Zhang R. Sharma A. Alipour and D. Marinov. 2013. Comparing non-adequate test suites using coverage criteria. In ISSTA. 10.1145\/2483760.2483769","DOI":"10.1145\/2483760.2483769"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","unstructured":"M. Gligoric S. Khurshid S. Misailovic and A. Shi. 2017. Mutation testing meets approximate computing. In ICSE NIER. 10.1109\/ICSE-NIER.2017.15","DOI":"10.1109\/ICSE-NIER.2017.15"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2017.2705662"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","unstructured":"R. Gopinath A. Alipour I. Ahmed C. Jensen and A. Groce. 2015. How hard does mutation analysis have to be anyway?. In ISSRE. 10.1109\/ISSRE.2015.7381815","DOI":"10.1109\/ISSRE.2015.7381815"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","unstructured":"R. Gopinath M. A. Alipour I. Ahmed C. Jensen and A. Groce. 2016. On the limits of mutation reduction strategies. In ICSE. 10.1145\/2884781.2884787","DOI":"10.1145\/2884781.2884787"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","unstructured":"R. Gopinath C. Jensen and A. Groce. 2016. Topsy-Turvy: a smarter and faster parallelization of mutation analysis. In ICSE. 10.1145\/2884781.2892655","DOI":"10.1145\/2884781.2892655"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"A. Groce I. Ahmed C. Jensen and P. E. McKenney. 2015. How verified is my code? Falsification-driven verification. In ASE.","DOI":"10.1109\/ASE.2015.40"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"A. Groce and J. Pinto. 2015. A little language for testing. In NFM.","DOI":"10.1007\/978-3-319-17524-9_15"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"F. Hariri A. Shi H. Converse S. Khurshid and D. Marinov. 2016. Evaluating the effects of compiler optimizations on mutation testing at the compiler IR level. In ISSRE.","DOI":"10.1109\/ISSRE.2016.51"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"F. Hariri A. Shi O. Legunsen M. Gligoric S. Khurshid and S. Misailovic. 2018. Approximate transformations as mutation operators. In ICST.","DOI":"10.1109\/ICST.2018.00036"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-016-0445-y"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1405716"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"S. Hong B. Lee T. Kwak Y. Jeon B. Ko Y. Kim andM. Kim. 2015. Mutation-based fault localization for real-world multilingual programs. In ASE.","DOI":"10.1109\/ASE.2015.14"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","unstructured":"R. Just D. Jalali L. Inozemtseva M. D. Ernst R. Holmes and G. Fraser. 2014. Are mutants a valid substitute for real faults in software testing?. In FSE. 10.1145\/2635868.2635929","DOI":"10.1145\/2635868.2635929"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2011.6100138"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133916"},{"key":"e_1_3_2_1_24_1","volume-title":"muupi mutation tool. https:\/\/github.com\/apepkuss\/muupi. (September","author":"Liu X.","year":"2016","unstructured":"X. Liu. 2016. muupi mutation tool. https:\/\/github.com\/apepkuss\/muupi. (September 2016)."},{"key":"e_1_3_2_1_25_1","unstructured":"J. Offutt and A. Abdurazik. 2000. In Mutation 2000: mutation testing in the twentieth and the twenty first centuries."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","unstructured":"M. Papadakis Y. Jia M. Harman and Y. Le Traon. 2015. Trivial compiler equivalence: a large scale empirical study of a simple fast and effective equivalent mutant detection technique. In ICSE.","DOI":"10.5555\/2818754.2818867"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.1509"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/174146.154265"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","unstructured":"B. Wang Y. Xiong Y. Shi L. Zhang and D. Hao. 2017. Faster mutation analysis via equivalence modulo states. In ISSTA. 10.1145\/3092703.3092714","DOI":"10.1145\/3092703.3092714"}],"event":{"name":"ICSE '18: 40th International Conference on Software Engineering","location":"Gothenburg Sweden","acronym":"ICSE '18","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE-CS Computer Society"]},"container-title":["Proceedings of the 40th International Conference on Software Engineering: Companion Proceeedings"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183440.3183485","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3183440.3183485","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3183440.3183485","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:06Z","timestamp":1750208886000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183440.3183485"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,27]]},"references-count":29,"alternative-id":["10.1145\/3183440.3183485","10.1145\/3183440"],"URL":"https:\/\/doi.org\/10.1145\/3183440.3183485","relation":{},"subject":[],"published":{"date-parts":[[2018,5,27]]},"assertion":[{"value":"2018-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}