{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T02:41:00Z","timestamp":1767926460951,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,18]],"date-time":"2016-01-18T00:00:00Z","timestamp":1453075200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-15-CE25-0008"],"award-info":[{"award-number":["ANR-15-CE25-0008"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,1,18]]},"DOI":"10.1145\/2854065.2854068","type":"proceedings-article","created":{"date-parts":[[2016,1,12]],"date-time":"2016-01-12T13:18:57Z","timestamp":1452604737000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Higher-order representation predicates in separation logic"],"prefix":"10.1145","author":[{"given":"Arthur","family":"Chargu\u00e9raud","sequence":"first","affiliation":[{"name":"Inria, France"}]}],"member":"320","published-online":{"date-parts":[[2016,1,18]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"LNCS","first-page":"36","volume-title":"Algorithms - 22th Annual European Symposium (ESA)","author":"Acar Umut A.","unstructured":"Umut A. Acar , Arthur Chargu\u00e9raud , and Mike Rainey . Theory and practice of chunked sequences . In Andreas S. Schulz and Dorothea Wagner, editors, Algorithms - 22th Annual European Symposium (ESA) , volume 8737 of LNCS , pages 25\u2013 36 . Springer, 2014. Umut A. Acar, Arthur Chargu\u00e9raud, and Mike Rainey. Theory and practice of chunked sequences. In Andreas S. Schulz and Dorothea Wagner, editors, Algorithms - 22th Annual European Symposium (ESA), volume 8737 of LNCS, pages 25\u201336. Springer, 2014."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1275497.1275499"},{"key":"e_1_3_2_1_4_1","first-page":"430","volume-title":"ICFP","author":"Chargu\u00e9raud Arthur","unstructured":"Arthur Chargu\u00e9raud . Characteristic formulae for the verification of imperative programs. In Manuel M. T. Chakravarty, Zhenjiang Hu, and Olivier Danvy, editors , ICFP , pages 418\u2013 430 . ACM, 2011. Arthur Chargu\u00e9raud. Characteristic formulae for the verification of imperative programs. In Manuel M. T. Chakravarty, Zhenjiang Hu, and Olivier Danvy, editors, ICFP, pages 418\u2013430. ACM, 2011."},{"key":"e_1_3_2_1_5_1","volume-title":"Characteristic formulae for the verification of imperative programs","author":"Chargu\u00e9raud Arthur","year":"2015","unstructured":"Arthur Chargu\u00e9raud . Characteristic formulae for the verification of imperative programs , 2015 . Arthur Chargu\u00e9raud. Characteristic formulae for the verification of imperative programs, 2015."},{"key":"e_1_3_2_1_6_1","unstructured":"Submitted for publication. http: \/\/arthur.chargueraud.org\/research\/2013\/cf\/cf.pdf.  Submitted for publication. http: \/\/arthur.chargueraud.org\/research\/2013\/cf\/cf.pdf."},{"key":"e_1_3_2_1_7_1","volume-title":"The Coq proof assistant reference manual, version 8.1. At http:\/\/coq.inria.fr\/","author":"Development Team The Coq","year":"2007","unstructured":"The Coq Development Team . The Coq proof assistant reference manual, version 8.1. At http:\/\/coq.inria.fr\/ , 2007 . The Coq Development Team. The Coq proof assistant reference manual, version 8.1. At http:\/\/coq.inria.fr\/, 2007."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796805005769"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225090"},{"key":"e_1_3_2_1_10_1","volume-title":"October","author":"Leroy Xavier","year":"2005","unstructured":"Xavier Leroy , Damien Doligez , Jacques Garrigue , Didier R\u00e9my , and J\u00e9r\u00f4me Vouillon . The Objective Caml system , October 2005 . Xavier Leroy, Damien Doligez, Jacques Garrigue, Didier R\u00e9my, and J\u00e9r\u00f4me Vouillon. The Objective Caml system, October 2005."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159803.1159812"},{"key":"e_1_3_2_1_12_1","first-page":"19","volume-title":"Computer Science Logic","author":"O\u2019Hearn Peter","unstructured":"Peter O\u2019Hearn , John Reynolds , and Hongseok Yang . Local reasoning about programs that alter data structures . In Computer Science Logic , pages 1\u2013 19 . Springer, 2001. Peter O\u2019Hearn, John Reynolds, and Hongseok Yang. Local reasoning about programs that alter data structures. In Computer Science Logic, pages 1\u201319. Springer, 2001."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964024"},{"key":"e_1_3_2_1_14_1","volume-title":"Purely Functional Data Structures","author":"Okasaki Chris","year":"1999","unstructured":"Chris Okasaki . Purely Functional Data Structures . Cambridge University Press , 1999 . Chris Okasaki. Purely Functional Data Structures. Cambridge University Press, 1999."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/645683.664578"},{"key":"e_1_3_2_1_16_1","first-page":"199","volume-title":"ECOOP 2010 \u2013 Object-Oriented Programming","author":"Svendsen Kasper","unstructured":"Kasper Svendsen , Lars Birkedal , and Matthew Parkinson . Verifying generics and delegates . In ECOOP 2010 \u2013 Object-Oriented Programming , pages 175\u2013 199 . Springer, 2010. Kasper Svendsen, Lars Birkedal, and Matthew Parkinson. Verifying generics and delegates. In ECOOP 2010 \u2013 Object-Oriented Programming, pages 175\u2013199. Springer, 2010."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.10.022"}],"event":{"name":"CPP 2016: Certified Proofs and Programs","location":"St. Petersburg FL USA","acronym":"CPP 2016","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation"]},"container-title":["Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2854065.2854068","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2854065.2854068","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:46Z","timestamp":1750225726000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2854065.2854068"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,18]]},"references-count":16,"alternative-id":["10.1145\/2854065.2854068","10.1145\/2854065"],"URL":"https:\/\/doi.org\/10.1145\/2854065.2854068","relation":{},"subject":[],"published":{"date-parts":[[2016,1,18]]},"assertion":[{"value":"2016-01-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}