{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:41:17Z","timestamp":1780994477940,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T00:00:00Z","timestamp":1168992000000},"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":[[2007,1,17]]},"DOI":"10.1145\/1190216.1190234","type":"proceedings-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T15:41:00Z","timestamp":1175787660000},"page":"97-108","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":91,"title":["Types, bytes, and separation logic"],"prefix":"10.1145","author":[{"given":"Harvey","family":"Tuch","sequence":"first","affiliation":[{"name":"National ICT Australia, Australia and UNSW, Sydney, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerwin","family":"Klein","sequence":"additional","affiliation":[{"name":"National ICT Australia, Australia and UNSW, Sydney, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Norrish","sequence":"additional","affiliation":[{"name":"National ICT Australia, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2007,1,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11823230_13"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/380921.380932"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30538-5_9"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.41331"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31984-9_2"},{"key":"e_1_3_2_1_6_1","volume-title":"June","author":"Bloch J.","year":"2006","unstructured":"J. Bloch. Nearly all binary searches and mergesorts are broken. newblock http:\/\/googleresearch.blogspot.com\/2006\/06\/extra-extra-read-all-about-it-nearly.html, June 2006."},{"key":"e_1_3_2_1_7_1","volume-title":"Teaching an ML compiler to speak C \"natively\". Electronic Notes in Theoretical Computer Science, 59(1)","author":"Blume M.","year":"2001","unstructured":"M. Blume. No-longer-foreign: Teaching an ML compiler to speak C \"natively\". Electronic Notes in Theoretical Computer Science, 59(1), 2001."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"R. Bornat. Proving pointer programs in Hoare Logic. In R. Backhouse and J. Oliveira editors Mathematics of Program Construction (MPC 2000) volume 1837 of LNCS pages 102--126. Springer 2000.","DOI":"10.5555\/648085.747307"},{"key":"e_1_3_2_1_9_1","first-page":"23","volume-title":"Machine Intelligence 7","author":"Burstall R.","year":"1972","unstructured":"R. Burstall. Some techniques for proving correctness of programs which alter data structures. In B. Meltzer and D. Michie, editors, Machine Intelligence 7, pages 23--50. Edinburgh University Press, 1972."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_30"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11591191_27"},{"key":"e_1_3_2_1_12_1","first-page":"15","volume-title":"6th International Conference on Formal Engineering Methods, ICFEM 2004","volume":"3308","author":"Filli\u00e2tre J.-C.","year":"2004","unstructured":"J.-C. Filli\u00e2tre and C. March\u00e9. Multi-prover verification of C programs. InFormal Methods and Software Engineering, 6th International Conference on Formal Engineering Methods, ICFEM 2004, Seattle, USA, volume 3308 ofLNCS, pages 15--29. Springer, 2004."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11541868_1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1767111.1767128"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/360204.375719"},{"key":"e_1_3_2_1_17_1","volume-title":"L4 emphfootnotesize eXemphfootnotesize perimental Kernel Reference Manual Version X.2","author":"Team Ka","year":"2001","unstructured":"L4Ka Team. L4 emphfootnotesize eXemphfootnotesize perimental Kernel Reference Manual Version X.2. University of Karlsruhe, Oct. 2001. http:\/\/l4ka.org\/projects\/version4\/l4-x2.pdf."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11901433_22"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1099014.1709524"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378851"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065887.1065892"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1791547"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/645683.664578"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292552"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","unstructured":"H. Tuch and G. Klein. A unified memory model for pointers. In G. Sutcliffe and A. Voronkov editors 12th International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR-12) volume 3835 ofLNCS pages 474--488 2005. 10.1007\/11591191_33","DOI":"10.1007\/11591191_33"},{"key":"e_1_3_2_1_29_1","unstructured":"H. Tuch G. Klein and M. Norrish. Verification of the L4 kernel memory allocator. Formal proof document. http:\/\/www.ertos.nicta.com.au\/research\/l4.verified\/kmalloc.pml July 2006."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/358818.358825"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30124-0_21"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","unstructured":"M. Wenzel. Type classes and overloading in higher-order logic. In E. L. Gunter and A. Felty editors Theorem Proving in Higher Order Logics'97 volume 1275 ofLNCS pages 307--322. Springer 1997.","DOI":"10.5555\/646524.694718"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"M. Wildmoser and T. Nipkow. Certifying machine code safety: Shallow versus deep embedding. In K. Slind A. Bunker and G. Gopalakrishnan editors Theorem Proving in Higher Order Logics 2004 volume 3223 ofLNCS pages 305--320. Springer 2004.","DOI":"10.1007\/978-3-540-30142-4_22"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/646794.704850"},{"key":"e_1_3_2_1_35_1","volume-title":"Int. Workshop on Software Verification and Validation","author":"Zee K.","year":"2004","unstructured":"K. Zee, P. Lam, V. Kuncak, and M. Rinard. Combining theorem proving with static analysis for data structure consistency. In Int. Workshop on Software Verification and Validation, 2004."}],"event":{"name":"POPL07: The 34th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Nice France","acronym":"POPL07","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 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1190216.1190234","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1190216.1190234","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:47:42Z","timestamp":1750243662000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1190216.1190234"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,17]]},"references-count":31,"alternative-id":["10.1145\/1190216.1190234","10.1145\/1190216"],"URL":"https:\/\/doi.org\/10.1145\/1190216.1190234","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1190215.1190234","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2007,1,17]]},"assertion":[{"value":"2007-01-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}