{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:33:51Z","timestamp":1773192831128,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"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":[[2005,9]]},"DOI":"10.1145\/1081706.1081728","type":"proceedings-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T12:34:39Z","timestamp":1131366879000},"page":"115-125","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":59,"title":["Context- and path-sensitive memory leak detection"],"prefix":"10.1145","author":[{"given":"Yichen","family":"Xie","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA"}]},{"given":"Alex","family":"Aiken","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA"}]}],"member":"320","published-online":{"date-parts":[[2005,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(200006)30:7%3C775::AID-SPE309%3E3.0.CO;2-H"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1024393.1024412"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/178243.178264"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/231379.231389"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040331"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the Winter USENIX Conference","author":"Hastings R.","year":"1992","unstructured":"R. Hastings and B. Joyce . Purify: Fast detection of memory leaks and access errors . In Proceedings of the Winter USENIX Conference , Dec. 1992 .]] R. Hastings and B. Joyce. Purify: Fast detection of memory leaks and access errors. In Proceedings of the Winter USENIX Conference, Dec. 1992.]]"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/781131.781150"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 1st International Symposium on Leveraging Applications of Formal Methods","author":"Ivancic F.","year":"2004","unstructured":"F. Ivancic , Z. Yang , M. Ganai , A. Gupta , and P. Ashar . Efficient SAT-based bounded model checking for software verification . In Proceedings of the 1st International Symposium on Leveraging Applications of Formal Methods , 2004 .]] F. Ivancic, Z. Yang, M. Ganai, A. Gupta, and P. Ashar. Efficient SAT-based bounded model checking for software verification. In Proceedings of the 1st International Symposium on Leveraging Applications of Formal Methods, 2004.]]"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/347324.383378"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/775832.775928"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/143095.143137"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/647170.718290"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/349299.349327"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/288548.289051"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/320384.320400"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/207110.207111"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040334"},{"key":"e_1_3_2_1_19_1","volume-title":"Path sensitive analysis using boolean satisfiability. Technical report","author":"Xie Y.","year":"2002","unstructured":"Y. Xie and A. Chou . Path sensitive analysis using boolean satisfiability. Technical report , Stanford University , Nov. 2002 .]] Y. Xie and A. Chou. Path sensitive analysis using boolean satisfiability. Technical report, Stanford University, Nov. 2002.]]"}],"event":{"name":"ESEC\/FSE05: Joint 10th European Software Engineering Conference 2005","location":"Lisbon Portugal","acronym":"ESEC\/FSE05","sponsor":["ACM Association for Computing Machinery","SIGSOFT ACM Special Interest Group on Software Engineering"]},"container-title":["Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1081706.1081728","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1081706.1081728","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:34Z","timestamp":1750248514000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1081706.1081728"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":18,"alternative-id":["10.1145\/1081706.1081728","10.1145\/1081706"],"URL":"https:\/\/doi.org\/10.1145\/1081706.1081728","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1095430.1081728","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2005,9]]},"assertion":[{"value":"2005-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}