{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:44:25Z","timestamp":1780994665204,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017,1]]},"DOI":"10.1145\/3009837.3009855","type":"proceedings-article","created":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T16:20:29Z","timestamp":1482423629000},"page":"205-217","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":88,"title":["Interactive proofs in higher-order concurrent separation logic"],"prefix":"10.1145","author":[{"given":"Robbert","family":"Krebbers","sequence":"first","affiliation":[{"name":"Delft University of Technology, Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amin","family":"Timany","sequence":"additional","affiliation":[{"name":"KU Leuven, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lars","family":"Birkedal","sequence":"additional","affiliation":[{"name":"Aarhus University, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,1]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11693024_6"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190235"},{"key":"e_1_3_2_1_4_1","volume-title":"Tactics for Separation Logic","author":"Appel A. W.","year":"2006","unstructured":"A. W. Appel . Tactics for Separation Logic , 2006 . Available at http:\/\/www.cs.princeton.edu\/~appel\/papers\/septacs.pdf. A. W. Appel. Tactics for Separation Logic, 2006. Available at http:\/\/www.cs.princeton.edu\/~appel\/papers\/septacs.pdf."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2670099"},{"key":"e_1_3_2_1_6_1","first-page":"315","volume":"7406","author":"Bengtson J.","year":"2012","unstructured":"J. Bengtson , J. B. Jensen , and L. Birkedal . Charge! - A Framework for Higher-Order Separation Logic in Coq. In ITP , volume 7406 of LNCS, pages 315 \u2013 331 , 2012 . J. Bengtson, J. B. Jensen, and L. Birkedal. Charge! - A Framework for Higher-Order Separation Logic in Coq. In ITP, volume 7406 of LNCS, pages 315\u2013331, 2012.","journal-title":"In ITP"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11575467_5"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926401"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500592"},{"key":"e_1_3_2_1_10_1","volume-title":"The Coq Proof Assistant Reference Manual","author":"Team Coq Development","year":"2016","unstructured":"Coq Development Team . The Coq Proof Assistant Reference Manual , 2016 . Available at https:\/\/coq.inria.fr\/doc\/. Coq Development Team. The Coq Proof Assistant Reference Manual, 2016. Available at https:\/\/coq.inria.fr\/doc\/."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44202-9_9"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1765236.1765246"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1883978.1884012"},{"key":"e_1_3_2_1_14_1","volume-title":"RustBelt","author":"Dreyer D.","year":"2016","unstructured":"D. Dreyer . ERC Project \u201c RustBelt \u201d, 2016 . Available at http:\/\/plv.mpi-sws.org\/rustbelt\/. D. Dreyer. ERC Project \u201cRustBelt\u201d, 2016. Available at http:\/\/plv.mpi-sws.org\/rustbelt\/."},{"key":"e_1_3_2_1_15_1","volume-title":"Logical step-indexed logical relations. LMCS, 7(2:16)","author":"Dreyer D.","year":"2011","unstructured":"D. Dreyer , A. Ahmed , and L. Birkedal . Logical step-indexed logical relations. LMCS, 7(2:16) , 2011 . D. Dreyer, A. Ahmed, and L. Birkedal. Logical step-indexed logical relations. LMCS, 7(2:16), 2011."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480922"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1762174.1762193"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1887654.1887681"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/155278"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09724-4"},{"key":"e_1_3_2_1_21_1","first-page":"41","volume":"6617","author":"Jacobs B.","year":"2011","unstructured":"B. Jacobs , J. Smans , P. Philippaerts , F. Vogels , W. Penninckx , and F. Piessens . VeriFast: A Powerful, Sound, Predictable, Fast Verifier for C and Java. In NFM , volume 6617 of LNCS, pages 41 \u2013 55 , 2011 . B. Jacobs, J. Smans, P. Philippaerts, F. Vogels, W. Penninckx, and F. Piessens. VeriFast: A Powerful, Sound, Predictable, Fast Verifier for C and Java. In NFM, volume 6617 of LNCS, pages 41\u201355, 2011.","journal-title":"In NFM"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429105"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2951913.2951943"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676980"},{"key":"e_1_3_2_1_26_1","volume-title":"The Essence of Higher-Order Concurrent Separation Logic","author":"Krebbers R.","year":"2016","unstructured":"R. Krebbers , R. Jung , A. Bizjak , J.-H. Jourdan , D. Dreyer , and L. Birkedal . The Essence of Higher-Order Concurrent Separation Logic , 2016 . Draft . R. Krebbers, R. Jung, A. Bizjak, J.-H. Jourdan, D. Dreyer, and L. Birkedal. The Essence of Higher-Order Concurrent Separation Logic, 2016. Draft."},{"key":"e_1_3_2_1_27_1","volume-title":"POPL","author":"Krogh-Jespersen M.","year":"2017","unstructured":"M. Krogh-Jespersen , K. Svendsen , and L. Birkedal . A Logical Account of a Type-and-Effect System . In POPL , 2017 . M. Krogh-Jespersen, K. Svendsen, and L. Birkedal. A Logical Account of a Type-and-Effect System. In POPL, 2017."},{"key":"e_1_3_2_1_28_1","first-page":"532","volume":"9632","author":"Malecha G.","year":"2016","unstructured":"G. Malecha and J. Bengtson . Extensible and Efficient Automation Through Reflective Tactics. In ESOP , volume 9632 of LNCS, pages 532 \u2013 559 , 2016 . G. Malecha and J. Bengtson. Extensible and Efficient Automation Through Reflective Tactics. In ESOP, volume 9632 of LNCS, pages 532\u2013559, 2016.","journal-title":"Extensible and Efficient Automation Through Reflective Tactics. In ESOP"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03359-9_24"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/788022.789002"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54833-8_16"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706331"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1929553.1929565"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/645891.671433"},{"key":"e_1_3_2_1_35_1","first-page":"359","volume":"9236","author":"Sch\u00e4fer S.","year":"2015","unstructured":"S. Sch\u00e4fer , T. Tebbi , and G. Smolka . Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions. In ITP , volume 9236 of LNCS, pages 359 \u2013 374 , 2015 . S. Sch\u00e4fer, T. Tebbi, and G. Smolka. Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions. In ITP, volume 9236 of LNCS, pages 359\u2013374, 2015.","journal-title":"In ITP"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2737964"},{"key":"e_1_3_2_1_37_1","first-page":"375","volume":"9236","author":"Sieczkowski F.","year":"2015","unstructured":"F. Sieczkowski , A. Bizjak , and L. Birkedal . ModuRes: A Coq library for modular reasoning about concurrent higher-order imperative programming languages. In ITP , volume 9236 of LNCS, pages 375 \u2013 390 , 2015 . F. Sieczkowski, A. Bizjak, and L. Birkedal. ModuRes: A Coq library for modular reasoning about concurrent higher-order imperative programming languages. In ITP, volume 9236 of LNCS, pages 375\u2013 390, 2015.","journal-title":"In ITP"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71067-7_23"},{"issue":"4","key":"e_1_3_2_1_39_1","first-page":"795","volume":"21","author":"Spitters B.","year":"2011","unstructured":"B. Spitters and E. van der Weegen . Type classes for mathematics in type theory. MSCS , 21 ( 4 ): 795 \u2013 825 , 2011 . B. Spitters and E. van der Weegen. Type classes for mathematics in type theory. MSCS, 21(4):795\u2013825, 2011.","journal-title":"MSCS"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54833-8_9"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37036-6_11"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500600"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/2392200.2392220"},{"key":"e_1_3_2_1_44_1","first-page":"305","volume":"3223","author":"Wildmoser M.","year":"2004","unstructured":"M. Wildmoser and T. Nipkow . Certifying Machine Code Safety: Shallow Versus Deep Embedding. In TPHOLs , volume 3223 of LNCS, pages 305 \u2013 320 , 2004 . M. Wildmoser and T. Nipkow. Certifying Machine Code Safety: Shallow Versus Deep Embedding. In TPHOLs, volume 3223 of LNCS, pages 305\u2013320, 2004.","journal-title":"Certifying Machine Code Safety: Shallow Versus Deep Embedding. In TPHOLs"}],"event":{"name":"POPL '17: The 44th Annual ACM SIGPLAN Symposium on Principles of Programming Languages","location":"Paris France","acronym":"POPL '17","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3009837.3009855","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3009837.3009855","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:36:21Z","timestamp":1750203381000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3009837.3009855"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":42,"alternative-id":["10.1145\/3009837.3009855","10.1145\/3009837"],"URL":"https:\/\/doi.org\/10.1145\/3009837.3009855","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3093333.3009855","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2017,1]]},"assertion":[{"value":"2017-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}