{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T23:45:06Z","timestamp":1787615106831,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,5,1]],"date-time":"2010-05-01T00:00:00Z","timestamp":1272672000000},"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":[[2010,5]]},"DOI":"10.1145\/1806799.1806862","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"425-434","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["From behaviour preservation to behaviour modification"],"prefix":"10.1145","author":[{"given":"Friedrich","family":"Steimann","sequence":"first","affiliation":[{"name":"Lehrgebiet Programmiersysteme, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Fernuniversit\u00e4t in Hagen, Hagen"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas","family":"Thies","sequence":"additional","affiliation":[{"name":"Lehrgebiet Programmiersysteme, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Fernuniversit\u00e4t in Hagen, Hagen"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,5]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Technical Report 161. Yale","author":"Baldwin D.","year":"1979","unstructured":"Baldwin , D. , and Sayward , F . 1979 . Heuristics for de termining equivalence of program mutations. Technical Report 161. Yale University, Dept. of Computer Science . Baldwin, D., and Sayward, F. 1979. Heuristics for determining equivalence of program mutations. Technical Report 161. Yale University, Dept. of Computer Science."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00625279"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/C-M.1978.218136"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.92910"},{"key":"e_1_3_2_1_5_1","volume-title":"Refactoring: Improving the Design of Existing Code","author":"Fowler M.","year":"1999","unstructured":"Fowler , M. 1999 . Refactoring: Improving the Design of Existing Code . Addison-Wesley 1999. Fowler, M. 1999. Refactoring: Improving the Design of Existing Code. Addison-Wesley 1999."},{"key":"e_1_3_2_1_6_1","unstructured":"Gosling J. Joy B. and Steele G. 2005. The Java Language Specification Third Edition. Addison-Wesley. http:\/\/java.sun.com\/docs\/books\/jls\/.   Gosling J. Joy B. and Steele G. 2005. The Java Language Specification Third Edition. Addison-Wesley. http:\/\/java.sun.com\/docs\/books\/jls\/."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1977.231145"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of Mutation 2000: Mutation Testing for the New Century","author":"Harman M.","year":"2000","unstructured":"Harman , M. , Danicic , S. , and Hierons , R . 2000. The Relationship Between Program Dependence and Mutation Analysis . In Proceedings of Mutation 2000: Mutation Testing for the New Century ( 2000 ), 5--13. Harman, M., Danicic, S., and Hierons, R. 2000. The Relationship Between Program Dependence and Mutation Analysis. In Proceedings of Mutation 2000: Mutation Testing for the New Century (2000), 5--13."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1689(199912)9:4<233::AID-STVR191>3.0.CO;2-3"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1982.235571"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368088.1368147"},{"key":"e_1_3_2_1_12_1","volume-title":"13th International Symposium on Software Reliability Engineering. IEEE Computer Society Press (November","author":"Ma Y.","year":"2002","unstructured":"Ma , Y. , Kwon , Y. , and Offutt , J . 2002. Inter-class mutation operators for Java . 13th International Symposium on Software Reliability Engineering. IEEE Computer Society Press (November 2002 ), 352--363. Ma, Y., Kwon, Y., and Offutt, J. 2002. Inter-class mutation operators for Java. 13th International Symposium on Software Reliability Engineering. IEEE Computer Society Press (November 2002), 352--363."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.4370040303"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1138929.1138945"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1689(199709)7:3<165::AID-STVR143>3.0.CO;2-U"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the 11th Conference on Computer Assurance","author":"Offutt J.","year":"1996","unstructured":"Offutt , J. , and Pan , J . 1996. Detecting equivalent mutants and the feasible path problem . In Proceedings of the 11th Conference on Computer Assurance ( 1996 ), 224--236. Offutt, J., and Pan, J. 1996. Detecting equivalent mutants and the feasible path problem. In Proceedings of the 11th Conference on Computer Assurance (1996), 224--236."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1449764.1449787"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1572272.1572282"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03013-0_19"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/949305.949308"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2391451.2391453"}],"event":{"name":"ICSE '10: 32nd International Conference on Software Engineering","location":"Cape Town South Africa","acronym":"ICSE '10","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS"]},"container-title":["Proceedings of the 32nd ACM\/IEEE International Conference on Software Engineering - Volume 1"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806799.1806862","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806799.1806862","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:37Z","timestamp":1750246777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806799.1806862"}},"subtitle":["constraint-based mutant generation"],"short-title":[],"issued":{"date-parts":[[2010,5]]},"references-count":21,"alternative-id":["10.1145\/1806799.1806862","10.1145\/1806799"],"URL":"https:\/\/doi.org\/10.1145\/1806799.1806862","relation":{},"subject":[],"published":{"date-parts":[[2010,5]]},"assertion":[{"value":"2010-05-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}