{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:29Z","timestamp":1772163989829,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,1,8]],"date-time":"2014-01-08T00:00:00Z","timestamp":1389139200000},"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":[[2014,1,8]]},"DOI":"10.1145\/2535838.2535864","type":"proceedings-article","created":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T08:40:06Z","timestamp":1389688806000},"page":"465-476","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Proof search for propositional abstract separation logics via labelled sequents"],"prefix":"10.1145","author":[{"given":"Zh\u00e9","family":"H\u00f3u","sequence":"first","affiliation":[{"name":"The Australian National University, Canberra, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ranald","family":"Clouston","sequence":"additional","affiliation":[{"name":"The Australian National University, Canberra, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajeev","family":"Gor\u00e9","sequence":"additional","affiliation":[{"name":"The Australian National University, Canberra, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alwen","family":"Tiu","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,1,8]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Unpublished","author":"Appel A. W.","year":"2006","unstructured":"A. W. Appel . Tactics for separation logic . Unpublished , 2006 . A. W. Appel. Tactics for separation logic. Unpublished, 2006."},{"key":"e_1_3_2_2_2_1","volume-title":"The Description Logic Handbook: Theory, Implementation, and Applications","author":"Baader F.","year":"2003","unstructured":"F. Baader . The Description Logic Handbook: Theory, Implementation, and Applications . Cambridge University Press , 2003 . F. Baader. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, 2003."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11575467_5"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2011.12.003"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.24"},{"key":"e_1_3_2_2_7_1","series-title":"phLNCS","first-page":"108","volume-title":"FSTTCS","author":"Calcagno C.","year":"2001","unstructured":"C. Calcagno , H. Yang , and P. W. O'Hearn . Computability and complexity results for a spatial assertion language for data structures . In FSTTCS , volume 2245 of phLNCS , pages 108 -- 119 , 2001 . C. Calcagno, H. Yang, and P. W. O'Hearn. Computability and complexity results for a spatial assertion language for data structures. In FSTTCS, volume 2245 of phLNCS, pages 108--119, 2001."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2007.30"},{"key":"e_1_3_2_2_9_1","series-title":"phLNCS","volume-title":"Modular safety checking for fine-grained concurrency. In phSAS","author":"Calcagno C.","year":"2007","unstructured":"C. Calcagno , M. Parkinson , and V. Vafeiadis . Modular safety checking for fine-grained concurrency. In phSAS , volume 4634 of phLNCS , 2007 . C. Calcagno, M. Parkinson, and V. Vafeiadis. Modular safety checking for fine-grained concurrency. In phSAS, volume 4634 of phLNCS, 2007."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1529282.1529402"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10672-9_13"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926416"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11944836_33"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exn066"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5381\/jot.2009.8.4.a3"},{"key":"e_1_3_2_2_16_1","first-page":"172","volume-title":"LNCS","author":"H\u00f3u Z.","year":"2013","unstructured":"Z. H\u00f3u , A. Tiu , and R. Gor\u00e9 . A labelled sequent calculus for BBI: Proof theory and proof search. In Tableaux , LNCS , 2013 . page 172 -- 187 ; extended version at arXiv:1302.4783. Z. H\u00f3u, A. Tiu, and R. Gor\u00e9. A labelled sequent calculus for BBI: Proof theory and proof search. In Tableaux, LNCS, 2013. page 172--187; extended version at arXiv:1302.4783."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/360204.375719"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28869-2_19"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1181195.1181213"},{"key":"e_1_3_2_2_20_1","author":"Larchey-Wendling D.","year":"2013","unstructured":"D. Larchey-Wendling . The formal strong completeness of partial monoidal boolean BI. To appear in J. Logic. Comput. , 2013 . D. Larchey-Wendling. The formal strong completeness of partial monoidal boolean BI. To appear in J. Logic. Comput., 2013.","journal-title":"J. Logic. Comput."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129509007567"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.18"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03359-9_24"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511527340"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.2307\/421090"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429095"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/645683.664578"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190234"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03359-9_32"},{"key":"e_1_3_2_2_32_1","series-title":"LNCS","first-page":"256","volume-title":"CONCUR","author":"Vafeiadis V.","year":"2007","unstructured":"V. Vafeiadis and M. Parkinson . A marriage of rely\/guarantee and separation logic . In CONCUR , volume 4703 of LNCS , pages 256 -- 271 , 2007 . V. Vafeiadis and M. Parkinson. A marriage of rely\/guarantee and separation logic. In CONCUR, volume 4703 of LNCS, pages 256--271, 2007."}],"event":{"name":"POPL '14: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"San Diego California USA","acronym":"POPL '14","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2535838.2535864","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2535838.2535864","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:06Z","timestamp":1750219806000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2535838.2535864"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,8]]},"references-count":29,"alternative-id":["10.1145\/2535838.2535864","10.1145\/2535838"],"URL":"https:\/\/doi.org\/10.1145\/2535838.2535864","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2578855.2535864","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2014,1,8]]},"assertion":[{"value":"2014-01-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}