{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:12Z","timestamp":1772163912881,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,1,12]],"date-time":"2005-01-12T00:00:00Z","timestamp":1105488000000},"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,1,12]]},"DOI":"10.1145\/1040305.1040330","type":"proceedings-article","created":{"date-parts":[[2005,1,30]],"date-time":"2005-01-30T12:58:48Z","timestamp":1107089928000},"page":"296-309","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":61,"title":["A semantics for procedure local heaps and its abstractions"],"prefix":"10.1145","author":[{"given":"Noam","family":"Rinetzky","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Bauer","sequence":"additional","affiliation":[{"name":"University des Saarlandes, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Reps","sequence":"additional","affiliation":[{"name":"University of Wisconsin, Madison, WI"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mooly","family":"Sagiv","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reinhard","family":"Wilhelm","sequence":"additional","affiliation":[{"name":"University des Saarlandes, Saarbr\u00fccken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,1,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/777388.777395"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760267.1760303"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/362384.362685"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/567752.567778"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCL.1992.185463"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/178243.178263"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/360204.375719"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27864-1_19"},{"key":"e_1_3_2_1_10_1","first-page":"321","volume-title":"Algorithmic Languages","author":"Jonkers H.B.M.","year":"1981","unstructured":"H.B.M. Jonkers . Abstract storage structures. In de~Bakker and van Vllet, editors , Algorithmic Languages , pages 321 -- 343 . IFIP, North Holland , 1981 .]] H.B.M. Jonkers. Abstract storage structures. In de~Bakker and van Vllet, editors, Algorithmic Languages, pages 321--343. IFIP, North Holland, 1981.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/28220.28222"},{"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.1145\/347324.348031"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/555142"},{"key":"e_1_3_2_1_15_1","first-page":"55","volume-title":"Logic in Computer Science","author":"Reynolds J.","year":"2002","unstructured":"J. Reynolds . Separation logic: a logic for shared mutable data structures . In Logic in Computer Science , pages 55 -- 74 , 2002 .]] J. Reynolds. Separation logic: a logic for shared mutable data structures. In Logic in Computer Science, pages 55--74, 2002.]]"},{"key":"e_1_3_2_1_16_1","volume-title":"Master's thesis","author":"Rinetzky N.","year":"2001","unstructured":"N. Rinetzky . Interprocedural shape analysis. Master's thesis , Technion Israel Institute of Technology , Haifa, Israel , 2001 .]] N. Rinetzky. Interprocedural shape analysis. Master's thesis, Technion Israel Institute of Technology, Haifa, Israel, 2001.]]"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/647477.727768"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/514188.514190"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(99)00012-X"}],"event":{"name":"POPL05: The 32nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 2005","location":"Long Beach California USA","acronym":"POPL05","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1040305.1040330","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1040305.1040330","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:25:00Z","timestamp":1750249500000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1040305.1040330"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1,12]]},"references-count":18,"alternative-id":["10.1145\/1040305.1040330","10.1145\/1040305"],"URL":"https:\/\/doi.org\/10.1145\/1040305.1040330","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1047659.1040330","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2005,1,12]]},"assertion":[{"value":"2005-01-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}