{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:29:15Z","timestamp":1742974155827,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819606016"},{"type":"electronic","value":"9789819606023"}],"license":[{"start":{"date-parts":[[2024,11,25]],"date-time":"2024-11-25T00:00:00Z","timestamp":1732492800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,25]],"date-time":"2024-11-25T00:00:00Z","timestamp":1732492800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-0602-3_3","type":"book-chapter","created":{"date-parts":[[2024,11,24]],"date-time":"2024-11-24T03:46:42Z","timestamp":1732420002000},"page":"46-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extending Symbolic Heap to\u00a0Support Shared Ownership"],"prefix":"10.1007","author":[{"given":"Jiyang","family":"Wu","sequence":"first","affiliation":[]},{"given":"Qinxiang","family":"Cao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,25]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Apt, K.R., de Boer, F.S., Olderog, E.: Verification of Sequential and Concurrent Programs. Texts in Computer Science. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-1-84882-745-5","key":"3_CR1","DOI":"10.1007\/978-1-84882-745-5"},{"unstructured":"Bornat, R., Calcagno, C., O\u2019Hearn, P.: Local reasoning, separation and aliasing. In: Proceeddings of the Workshop on Semantics, Program Analysis, and Computing Environments (2004)","key":"3_CR2"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-44898-5_4","volume-title":"Static Analysis","author":"J Boyland","year":"2003","unstructured":"Boyland, J.: Checking interference with fractional permissions. In: Cousot, R. (ed.) SAS 2003. LNCS, vol. 2694, pp. 55\u201372. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44898-5_4"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-030-53291-8_13","volume-title":"Computer Aided Verification","author":"J Brotherston","year":"2020","unstructured":"Brotherston, J., Costa, D., Hobor, A., Wickerson, J.: Reasoning over permissions regions in concurrent separation logic. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12225, pp. 203\u2013224. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_13"},{"issue":"1\u20134","key":"3_CR5","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10817-018-9457-5","volume":"61","author":"Q Cao","year":"2018","unstructured":"Cao, Q., Beringer, L., Gruetter, S., Dodds, J., Appel, A.W.: VST-Floyd: a separation logic tool to verify correctness of C programs. J. Autom. Reason. 61(1\u20134), 367\u2013422 (2018)","journal-title":"J. Autom. Reason."},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-662-54434-1_10","volume-title":"Programming Languages and Systems","author":"A Chargu\u00e9raud","year":"2017","unstructured":"Chargu\u00e9raud, A., Pottier, F.: Temporary Read-Only Permissions for Separation Logic. In: Yang, H. (ed.) ESOP 2017. LNCS, vol. 10201, pp. 260\u2013286. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54434-1_10"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-642-10672-9_13","volume-title":"Programming Languages and Systems","author":"R Dockins","year":"2009","unstructured":"Dockins, R., Hobor, A., Appel, A.W.: A fresh look at separation algebras and share accounting. In: Hu, Z. (ed.) APLAS 2009. LNCS, vol. 5904, pp. 161\u2013177. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10672-9_13"},{"issue":"OOPSLA2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/3622798","volume":"7","author":"T Hance","year":"2023","unstructured":"Hance, T., Howell, J., Padon, O., Parno, B.: Leaf: modularity for temporary sharing in separation logic. Proc. ACM Program. Lang. 7(OOPSLA2), 31\u201358 (2023)","journal-title":"Proc. ACM Program. Lang."},{"doi-asserted-by":"crossref","unstructured":"Hobor, A., Villard, J.: The ramifications of sharing in data structures. In: Giacobazzi, R., Cousot, R. (eds.) The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2013, Rome, Italy, 23\u201325 January 2013, pp. 523\u2013536. ACM (2013)","key":"3_CR9","DOI":"10.1145\/2429069.2429131"},{"doi-asserted-by":"crossref","unstructured":"Krebbers, R., Timany, A., Birkedal, L.: Interactive proofs in higher-order concurrent separation logic. In: Castagna, G., Gordon, A.D. (eds.) Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, 18\u201320 January 2017, pp. 205\u2013217. ACM (2017)","key":"3_CR10","DOI":"10.1145\/3009837.3009855"},{"doi-asserted-by":"crossref","unstructured":"Krishna, S., Shasha, D.E., Wies, T.: Go with the flow: compositional abstractions for concurrent data structures. Proc. ACM Program. Lang. 2(POPL), 37:1\u201337:31 (2018)","key":"3_CR11","DOI":"10.1145\/3158125"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-319-89884-1_14","volume-title":"Programming Languages and Systems","author":"X-B Le","year":"2018","unstructured":"Le, X.-B., Hobor, A.: Logical reasoning for disjoint permissions. In: Ahmed, A. (ed.) ESOP 2018. LNCS, vol. 10801, pp. 385\u2013414. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_14"},{"doi-asserted-by":"crossref","unstructured":"Leroy, X.: Formal certification of a compiler back-end or: programming a compiler with a proof assistant. In: Morrisett, J.G., Jones, S.L.P. (eds.) Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2006, Charleston, South Carolina, USA, 11\u201313 January 2006, pp. 42\u201354. ACM (2006)","key":"3_CR13","DOI":"10.1145\/1111037.1111042"},{"key":"3_CR14","volume-title":"Purely Functional Data Structures","author":"C Okasaki","year":"1999","unstructured":"Okasaki, C.: Purely Functional Data Structures. Cambridge University Press, Cambridge (1999)"},{"doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: Separation logic: a logic for shared mutable data structures. In: Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 22\u201325 July 2002, Copenhagen, Denmark, pp. 55\u201374. IEEE Computer Society (2002)","key":"3_CR15","DOI":"10.1109\/LICS.2002.1029817"},{"doi-asserted-by":"crossref","unstructured":"Vindum, S.F., Birkedal, L.: Contextual refinement of the Michael-Scott queue (proof pearl). In: Hritcu, C., Popescu, A. (eds.) CPP 2021: 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, Virtual Event, Denmark, 17\u201319 January 2021, pp. 76\u201390. ACM (2021)","key":"3_CR16","DOI":"10.1145\/3437992.3439930"},{"doi-asserted-by":"crossref","unstructured":"Wang, S., Cao, Q., Mohan, A., Hobor, A.: Certifying graph-manipulating C programs via localizations within data structures. Proc. ACM Program. Lang. 3(OOPSLA), 171:1\u2013171:30 (2019)","key":"3_CR17","DOI":"10.1145\/3360597"},{"doi-asserted-by":"crossref","unstructured":"Winskel, G.: The Formal Semantics of Programming Languages - An Introduction. Foundation of Computing Series. MIT Press (1993)","key":"3_CR18","DOI":"10.7551\/mitpress\/3054.001.0001"}],"container-title":["Lecture Notes in Computer Science","Dependable Software Engineering. Theories, Tools, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0602-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,24]],"date-time":"2024-11-24T04:18:03Z","timestamp":1732421883000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0602-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,25]]},"ISBN":["9789819606016","9789819606023"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0602-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,25]]},"assertion":[{"value":"25 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SETTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Dependable Software Engineering: Theories, Tools, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"setta2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/setta2024.cs.cityu.edu.hk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}