{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:32:24Z","timestamp":1750307544287,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,19]],"date-time":"2009-07-19T00:00:00Z","timestamp":1247961600000},"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":[[2009,7,19]]},"DOI":"10.1145\/1572272.1572278","type":"proceedings-article","created":{"date-parts":[[2009,7,28]],"date-time":"2009-07-28T12:45:28Z","timestamp":1248785128000},"page":"37-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Advanced code coverage analysis using substring holes"],"prefix":"10.1145","author":[{"given":"Yoram","family":"Adler","sequence":"first","affiliation":[{"name":"IBM Haifa Research Lab, Haifa, Israel"}]},{"given":"Eitan","family":"Farchi","sequence":"additional","affiliation":[{"name":"IBM Haifa Research Lab, Haifa, Israel"}]},{"given":"Moshe","family":"Klausner","sequence":"additional","affiliation":[{"name":"IBM Haifa Research Lab, Haifa, Israel"}]},{"given":"Dan","family":"Pelleg","sequence":"additional","affiliation":[{"name":"IBM Haifa Research Lab, Haifa, Israel"}]},{"given":"Orna","family":"Raz","sequence":"additional","affiliation":[{"name":"IBM Haifa Research Lab, Haifa, Israel"}]},{"given":"Moran","family":"Shochat","sequence":"additional","affiliation":[{"name":"IBM Haifa Research Lab, Haifa, Israel"}]},{"given":"Shmuel","family":"Ur","sequence":"additional","affiliation":[{"name":"IBM Haifa Research Lab, Haifa, Israel"}]},{"given":"Aviad","family":"Zlotnick","sequence":"additional","affiliation":[{"name":"IBM Haifa Research Lab, Haifa, Israel"}]}],"member":"320","published-online":{"date-parts":[[2009,7,19]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"ICSE","author":"Adler Y.","year":"2009","unstructured":"Y. Adler , E. Farchi , M. Klausner , D. Pelleg , O. Raz , M. Shochat , S. Ur , and A. Zlotnick . Automated substring hole analysis . In ICSE , NIER Track , 2009 . Y. Adler, E. Farchi, M. Klausner, D. Pelleg, O. Raz, M. Shochat, S. Ur, and A. Zlotnick. Automated substring hole analysis. In ICSE, NIER Track, 2009."},{"key":"e_1_3_2_1_2_1","first-page":"487","volume-title":"Fast algorithms for mining association rules in large databases","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal and R. Srikant . Fast algorithms for mining association rules in large databases . In J. B. Bocca, M. Jarke, and C. Zaniolo, editors, VLDB'94, Proceedings of 20th International Conference on Very Large Data Bases, September 12-15, 1994 , Santiago de Chile, Chile, pages 487 -- 499 . Morgan Kaufmann , 1994. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In J. B. Bocca, M. Jarke, and C. Zaniolo, editors, VLDB'94, Proceedings of 20th International Conference on Very Large Data Bases, September 12-15, 1994, Santiago de Chile, Chile, pages 487--499. Morgan Kaufmann, 1994."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2006.173"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372165"},{"volume-title":"http:\/\/www.alphaworks.ibm.com\/tech\/focus. Accessed","year":"2008","key":"e_1_3_2_1_5_1","unstructured":"Focus code and functional coverage tool. http:\/\/www.alphaworks.ibm.com\/tech\/focus. Accessed December 2008 . Focus code and functional coverage tool. http:\/\/www.alphaworks.ibm.com\/tech\/focus. Accessed December 2008."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/277044.277081"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/961322.961347"},{"key":"e_1_3_2_1_8_1","first-page":"69","volume-title":"Predicting Bugs from History","author":"Zimmermann T.","year":"2008","unstructured":"T. Zimmermann , N. Nagappan , and A. Zeller . Predicting Bugs from History , chapter 4, pages 69 -- 88 . Springer , March 2008 . T. Zimmermann, N. Nagappan, and A. Zeller. Predicting Bugs from History, chapter 4, pages 69--88. Springer, March 2008."}],"event":{"name":"ISSTA '09: International Symposium on Software Testing and Analysis","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"Chicago IL USA","acronym":"ISSTA '09"},"container-title":["Proceedings of the eighteenth international symposium on Software testing and analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1572272.1572278","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1572272.1572278","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:29Z","timestamp":1750249409000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1572272.1572278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,19]]},"references-count":8,"alternative-id":["10.1145\/1572272.1572278","10.1145\/1572272"],"URL":"https:\/\/doi.org\/10.1145\/1572272.1572278","relation":{},"subject":[],"published":{"date-parts":[[2009,7,19]]},"assertion":[{"value":"2009-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}