{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:22:04Z","timestamp":1751660524100,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,1,17]],"date-time":"2021-01-17T00:00:00Z","timestamp":1610841600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Flemish research fund (FWO)","award":["Postroctoral Fellowship"],"award-info":[{"award-number":["Postroctoral Fellowship"]}]},{"name":"VILLUM Foundation","award":["25804"],"award-info":[{"award-number":["25804"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,1,17]]},"DOI":"10.1145\/3437992.3439931","type":"proceedings-article","created":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T23:11:11Z","timestamp":1611184271000},"page":"91-104","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Reasoning about monotonicity in separation logic"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2237-851X","authenticated-orcid":false,"given":"Amin","family":"Timany","sequence":"first","affiliation":[{"name":"Aarhus University, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1320-0098","authenticated-orcid":false,"given":"Lars","family":"Birkedal","sequence":"additional","affiliation":[{"name":"Aarhus University, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,1,20]]},"reference":[{"volume-title":"Hutto","year":"1995","author":"Ahamad Mustaque","key":"e_1_3_2_2_1_1"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158153"},{"volume-title":"Program Logics for Certified Compilers","author":"Appel Andrew W.","key":"e_1_3_2_2_3_1"},{"key":"e_1_3_2_2_4_1","unstructured":"Lars Birkedal and Ale? Bizjak. 2017. Lecture Notes on Iris: HigherOrder Concurrent Separation Log. ( 2017 ). htp:\/\/iris-project. org\/ tutorial-pdfs\/iris-lecture-notes.pdf  Lars Birkedal and Ale? Bizjak. 2017. Lecture Notes on Iris: HigherOrder Concurrent Separation Log. ( 2017 ). htp:\/\/iris-project. org\/ tutorial-pdfs\/iris-lecture-notes.pdf"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2018.03.016"},{"key":"e_1_3_2_2_6_1","unstructured":"Germ\u00e1n Andr\u00e9s Delbianco Ilya Sergey Aleksandar Nanevski and Anindya Banerjee. 2017. Concurrent Data Structures Linked in Time (Artifact). Dagstuhl Artifacts Series 3 2 ( 2017 ) 4 : 1-4 :4. htps:\/\/doi. org\/10.4230\/DARTS.3. 2. 4  Germ\u00e1n Andr\u00e9s Delbianco Ilya Sergey Aleksandar Nanevski and Anindya Banerjee. 2017. Concurrent Data Structures Linked in Time (Artifact). Dagstuhl Artifacts Series 3 2 ( 2017 ) 4 : 1-4 :4. htps:\/\/doi. org\/10.4230\/DARTS.3. 2. 4"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3434323"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462160"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2951913.2951943"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Ralf Jung Robbert Krebbers Jacques-Henri Jourdan Ales Bizjak Lars Birkedal and Derek Dreyer. 2018. Iris from the ground up: A modular foundation for higher-order concurrent separation logic. J. Funct. Program. 28 ( 2018 ) e20. htps:\/\/doi.org\/10.1017\/S0956796818000151  Ralf Jung Robbert Krebbers Jacques-Henri Jourdan Ales Bizjak Lars Birkedal and Derek Dreyer. 2018. Iris from the ground up: A modular foundation for higher-order concurrent separation logic. J. Funct. Program. 28 ( 2018 ) e20. htps:\/\/doi.org\/10.1017\/S0956796818000151","DOI":"10.1017\/S0956796818000151"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676980"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3236772"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009855"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54833-8_16"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1929553.1929565"},{"key":"e_1_3_2_2_16_1","volume-title":"1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016","volume":"52","author":"Timany Amin","year":"2016"}],"event":{"name":"CPP '21: 10th ACM SIGPLAN International Conference on Certified Programs and Proofs","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Virtual Denmark","acronym":"CPP '21"},"container-title":["Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437992.3439931","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437992.3439931","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:19Z","timestamp":1750193239000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437992.3439931"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,17]]},"references-count":16,"alternative-id":["10.1145\/3437992.3439931","10.1145\/3437992"],"URL":"https:\/\/doi.org\/10.1145\/3437992.3439931","relation":{},"subject":[],"published":{"date-parts":[[2021,1,17]]},"assertion":[{"value":"2021-01-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}