{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:04:31Z","timestamp":1743156271014,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819975839"},{"type":"electronic","value":"9789819975846"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-981-99-7584-6_5","type":"book-chapter","created":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T00:05:39Z","timestamp":1699488339000},"page":"65-82","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Compositional Vulnerability Detection with\u00a0Insecurity Separation Logic"],"prefix":"10.1007","author":[{"given":"Toby","family":"Murray","sequence":"first","affiliation":[]},{"given":"Pengbo","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Gidon","family":"Ernst","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,9]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Al Fardan, N.J., Paterson, K.G.: Lucky thirteen: breaking the TLS and DTLS record protocols. In: IEEE Symposium on Security and Privacy, pp. 526\u2013540. IEEE (2013)","DOI":"10.1109\/SP.2013.42"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Banerjee, A., Naumann, D.A., Rosenberg, S.: Expressive declassification policies and modular static enforcement. In: IEEE Symposium on Security and Privacy, pp. 339\u2013353. IEEE (2008)","DOI":"10.1109\/SP.2008.20"},{"issue":"POPL","key":"5_CR3","first-page":"1","volume":"4","author":"G Barthe","year":"2020","unstructured":"Barthe, G., et al.: Formal verification of a constant-time preserving C compiler. PACMPL 4(POPL), 1\u201330 (2020)","journal-title":"PACMPL"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Benton, N.: Simple relational correctness proofs for static analyses and program transformations. In: POPL, pp. 14\u201325 (2004)","DOI":"10.1145\/982962.964003"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Calcagno, C., Distefano, D., O\u2019Hearn, P., Yang, H.: Compositional shape analysis by means of Bi-abduction. In: POPL, pp. 289\u2013300 (2009)","DOI":"10.1145\/1594834.1480917"},{"issue":"6","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.3233\/JCS-2009-0393","volume":"18","author":"MR Clarkson","year":"2010","unstructured":"Clarkson, M.R., Schneider, F.B.: Hyperproperties. J. Comput. Secur. 18(6), 1157\u20131210 (2010)","journal-title":"J. Comput. Secur."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Daniel, L.A., Bardin, S., Rezk, T.: BINSEC\/REL: efficient relational symbolic execution for constant-time at binary-level. In: IEEE Symposium on Security and Privacy, pp. 1021\u20131038. IEEE (2020)","DOI":"10.1109\/SP40000.2020.00074"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"De Vries, E., Koutavas, V.: Reverse Hoare logic. In: SEFM, pp. 155\u2013171 (2011)","DOI":"10.1007\/978-3-642-24690-6_12"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Eilers, M., M\u00fcller, P., Hitz, S.: Modular product programs. In: ESOP, pp. 502\u2013529 (2018)","DOI":"10.1007\/978-3-319-89884-1_18"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-030-25543-5_13","volume-title":"Computer Aided Verification","author":"G Ernst","year":"2019","unstructured":"Ernst, G., Murray, T.: SecCSL: security concurrent separation logic. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11562, pp. 208\u2013230. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25543-5_13"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Farina, G.P., Chong, S., Gaboardi, M.: Relational symbolic execution. In: PPDP, pp. 1\u201314 (2019)","DOI":"10.1145\/3354166.3354175"},{"issue":"OOPSLA1","key":"5_CR12","first-page":"1","volume":"6","author":"QL Le","year":"2022","unstructured":"Le, Q.L., Raad, A., Villard, J., Berdine, J., Dreyer, D., O\u2019Hearn, P.W.: Finding real bugs in big programs with incorrectness logic. PACMPL 6(OOPSLA1), 1\u201327 (2022)","journal-title":"PACMPL"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/11734727_14","volume-title":"Information Security and Cryptology - ICISC 2005","author":"D Molnar","year":"2006","unstructured":"Molnar, D., Piotrowski, M., Schultz, D., Wagner, D.: The program counter security model: automatic detection and removal of control-flow side channel attacks. In: Won, D.H., Kim, S. (eds.) ICISC 2005. LNCS, vol. 3935, pp. 156\u2013168. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11734727_14"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Murray, T., Yan, P., Ernst, G.: Compositional vulnerability detection with insecurity separation logic(extended version) (2023). https:\/\/covern.org\/insecurity.html","DOI":"10.1007\/978-981-99-7584-6_5"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-540-28644-8_4","volume-title":"CONCUR 2004 - Concurrency Theory","author":"PW O\u2019Hearn","year":"2004","unstructured":"O\u2019Hearn, P.W.: Resources, concurrency and local reasoning. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 49\u201367. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28644-8_4"},{"issue":"POPL","key":"5_CR16","first-page":"1","volume":"4","author":"PW O\u2019Hearn","year":"2019","unstructured":"O\u2019Hearn, P.W.: Incorrectness logic. PACMPL 4(POPL), 1\u201332 (2019)","journal-title":"PACMPL"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-030-53291-8_14","volume-title":"Computer Aided Verification","author":"A Raad","year":"2020","unstructured":"Raad, A., Berdine, J., Dang, H.-H., Dreyer, D., O\u2019Hearn, P., Villard, J.: Local reasoning about the presence of bugs: incorrectness separation logic. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12225, pp. 225\u2013252. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_14"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: Separation logic: a logic for shared mutable data structures. In: LICS, pp. 55\u201374. IEEE (2002)","DOI":"10.1109\/LICS.2002.1029817"},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/JSAC.2002.806121","volume":"21","author":"A Sabelfeld","year":"2003","unstructured":"Sabelfeld, A., Myers, A.C.: Language-based information-flow security. IEEE J. Sel. Areas Commun. 21(1), 5\u201319 (2003)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"1\u20133","key":"5_CR20","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.tcs.2006.12.036","volume":"375","author":"H Yang","year":"2007","unstructured":"Yang, H.: Relational separation logic. Theoret. Comput. Sci. 375(1\u20133), 308\u2013334 (2007)","journal-title":"Theoret. Comput. Sci."},{"issue":"OOPSLA1","key":"5_CR21","first-page":"522","volume":"7","author":"N Zilberstein","year":"2023","unstructured":"Zilberstein, N., Dreyer, D., Silva, A.: Outcome logic: a unifying foundation for correctness and incorrectness reasoning. PACMPL 7(OOPSLA1), 522\u2013550 (2023)","journal-title":"PACMPL"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-7584-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T18:12:35Z","timestamp":1730484755000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-7584-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819975839","9789819975846"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-7584-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICFEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Engineering Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brisbane, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfem2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/formal-analysis.com\/icfem\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This proceedings includes one invited paper and eight doctoral symposium papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}