{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T05:50:06Z","timestamp":1790401806236,"version":"4.1.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030654733","type":"print"},{"value":"9783030654740","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-65474-0_12","type":"book-chapter","created":{"date-parts":[[2021,1,13]],"date-time":"2021-01-13T13:13:42Z","timestamp":1610543622000},"page":"248-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Interprocedural Shape Analysis Using Separation Logic-Based Transformer Summaries"],"prefix":"10.1007","author":[{"given":"Hugo","family":"Illous","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthieu","family":"Lemerre","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xavier","family":"Rival","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,1,13]]},"reference":[{"issue":"4","key":"12_CR1","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1017\/S0956796800000496","volume":"2","author":"F Bourdoncle","year":"1992","unstructured":"Bourdoncle, F.: Abstract interpretation by dynamic partitioning. J. Funct. Program 2(4), 407\u2013423 (1992)","journal-title":"J. Funct. Program"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-540-74061-2_25","volume-title":"Static Analysis","author":"C Calcagno","year":"2007","unstructured":"Calcagno, C., Distefano, D., O\u2019Hearn, P.W., Yang, H.: Footprint analysis: a shape analysis that discovers preconditions. In: Nielson, H.R., Fil\u00e9, G. (eds.) SAS 2007. LNCS, vol. 4634, pp. 402\u2013418. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74061-2_25"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Calcagno, C., Distefano, D., O\u2019Hearn, P., Yang, H.: Compositional shape analysis by means of bi-abduction. In: Symposium on Principles of Programming Languages (POPL), pp. 289\u2013300. ACM (2009)","DOI":"10.1145\/1594834.1480917"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-662-48288-9_15","volume-title":"Static Analysis","author":"G Castelnuovo","year":"2015","unstructured":"Castelnuovo, G., Naik, M., Rinetzky, N., Sagiv, M., Yang, H.: Modularity in lattices: a case study on the correspondence between top-down and bottom-up analysis. In: Blazy, S., Jensen, T. (eds.) SAS 2015. LNCS, vol. 9291, pp. 252\u2013274. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48288-9_15"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Chang, B.Y.E., Rival, X.: Relational inductive shape analysis. In Symposium on Principles of Programming Languages (POPL), pp. 247\u2013260. ACM (2008)","DOI":"10.1145\/1328897.1328469"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-540-74061-2_24","volume-title":"Static Analysis","author":"B-YE Chang","year":"2007","unstructured":"Chang, B.-Y.E., Rival, X., Necula, G.C.: Shape analysis with structural invariant checkers. In: Nielson, H.R., Fil\u00e9, G. (eds.) SAS 2007. LNCS, vol. 4634, pp. 384\u2013401. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74061-2_24"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Chatterjee, R., Ryder, B.G., Landi, W.A.: Relevant context inference. In: Symposium on Principles of Programming Languages (POPL), pp. 133\u2013146. ACM (1999)","DOI":"10.1145\/292540.292554"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Codish, M., Debray, S.K., Giacobazzi, R.: Compositional analysis of modular logic programs. In: Symposium on Principles of Programming Languages (POPL), pp. 451\u2013464. ACM (1993)","DOI":"10.1145\/158511.158703"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Symposium on Principles of Programming Languages (POPL), ACM (1977)","DOI":"10.1145\/512950.512973"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-45937-5_13","volume-title":"Compiler Construction","author":"P Cousot","year":"2002","unstructured":"Cousot, P., Cousot, R.: Modular static program analysis. In: Horspool, R.N. (ed.) CC 2002. LNCS, vol. 2304, pp. 159\u2013179. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45937-5_13"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Symposium on Principles of Programming Languages (POPL), pp. 84\u201397. ACM (1978)","DOI":"10.1145\/512760.512770"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Dillig, I., Dillig, T., Aiken, A. and Sagiv, M.: Precise and compact modular procedure summaries for heap manipulating programs. In: Hall, M.W., Padua, D.A. (eds.) Conference on Programming Languages Design and Implementation (PLDI), pp. 567\u2013577. ACM (2011)","DOI":"10.1145\/1993316.1993565"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/11691372_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Distefano","year":"2006","unstructured":"Distefano, D., O\u2019Hearn, P.W., Yang, H.: A local shape analysis based on separation logic. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 287\u2013302. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11691372_19"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-642-22110-1_29","volume-title":"Computer Aided Verification","author":"K Dudka","year":"2011","unstructured":"Dudka, K., Peringer, P., Vojnar, T.: Predator: a practical tool for checking manipulation of dynamic data structures using separation logic. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 372\u2013378. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_29"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-03237-0_14","volume-title":"Static Analysis","author":"BS Gulavani","year":"2009","unstructured":"Gulavani, B.S., Chakraborty, S., Ramalingam, G., Nori, A.V.: Bottom-up shape analysis. In: Palsberg, J., Su, Z. (eds.) SAS 2009. LNCS, vol. 5673, pp. 188\u2013204. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03237-0_14"},{"key":"12_CR16","unstructured":"Illous, H.: Abstract Heap Relations for a Compositional Shape Analysis. PhD thesis, \u00c9cole Normale Sup\u00e9rieure (2018)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-319-57288-8_15","volume-title":"NASA Formal Methods","author":"H Illous","year":"2017","unstructured":"Illous, H., Lemerre, M., Rival, X.: A relational shape abstract domain. In: Barrett, C., Davies, M., Kahsai, T. (eds.) NFM 2017. LNCS, vol. 10227, pp. 212\u2013229. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57288-8_15"},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1667048.1667050","volume":"32","author":"B Jeannet","year":"2010","unstructured":"Jeannet, B., Loginov, A., Reps, T., Sagiv, M.: A relational approach to interprocedural shape analysis. ACM Trans. Program. Lang. Syst. (TOPLAS) 32(2), 5 (2010)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Jeannet, B., Loginov, A., Reps, T.W., Sagiv, S.: A relational approach to interprocedural shape analysis. In: Static Analysis Symposium (SAS), pp. 246\u2013264 (2004)","DOI":"10.1007\/978-3-540-27864-1_19"},{"issue":"3","key":"12_CR20","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s00165-014-0326-7","volume":"27","author":"F Kirchner","year":"2015","unstructured":"Kirchner, F., Kosmatov, N., Prevosto, V., Signoles, J., Yakobowski, B.: Frama-c: a software analysis perspective. Formal Aspects Comput. 27(3), 573\u2013609 (2015)","journal-title":"Formal Aspects Comput."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Lattner, C., Lenharth, A., Adve, V.: Making context-sensitive points-to analysis with heap cloning practical for the real world. In: Ferrante, J., McKinley, K.S. (eds), Conference on Programming Languages Design and Implementation (PLDI), pp. 278\u2013289. ACM (2007)","DOI":"10.1145\/1273442.1250766"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-319-08867-9_4","volume-title":"Computer Aided Verification","author":"QL Le","year":"2014","unstructured":"Le, Q.L., Gherghina, C., Qin, S., Chin, W.-N.: Shape analysis via second-order bi-abduction. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 52\u201368. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_4"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-030-32304-2_3","volume-title":"Static Analysis","author":"Y Lei","year":"2019","unstructured":"Lei, Y., Sui, Y.: Fast and precise handling of positive weight cycles for field-sensitive pointer analysis. In: Chang, B.-Y.E. (ed.) SAS 2019. LNCS, vol. 11822, pp. 27\u201347. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32304-2_3"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF00288637","volume":"3","author":"Z Manna","year":"1974","unstructured":"Manna, Z., Pnueli, A.: Axiomatic approach to total correctness of programs. Acta Informatica 3, 243\u2013263 (1974)","journal-title":"Acta Informatica"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-540-78791-4_17","volume-title":"Compiler Construction","author":"M Marron","year":"2008","unstructured":"Marron, M., Hermenegildo, M., Kapur, D., Stefanovic, D.: Efficient context-sensitive shape analysis with graph based heap models. In: Hendren, L. (ed.) CC 2008. LNCS, vol. 4959, pp. 245\u2013259. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78791-4_17"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Precise interprocedural analysis through linear algebra. In: Symposium on Principles of Programming Languages (POPL), pp. 330\u2013341. ACM (2004)","DOI":"10.1145\/982962.964029"},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-540-77505-8_26","volume-title":"Advances in Computer Science - ASIAN 2006. Secure Software and Related Issues","author":"C Popeea","year":"2007","unstructured":"Popeea, C., Chin, W.-N.: Inferring disjunctive postconditions. In: Okada, M., Satoh, I. (eds.) ASIAN 2006. LNCS, vol. 4435, pp. 331\u2013345. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77505-8_26"},{"key":"12_CR28","unstructured":"Reynolds, J.: Separation logic: a logic for shared mutable data structures. In: Symposium on Logics In Computer Science (LICS), pp. 55\u201374. IEEE (2002)"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Rinetzky, N., Bauer, J., Reps, T., Sagiv, M., Wilhelm, R.: A semantics for procedure local heaps and its abstractions. In: Symposium on Principles of Programming Languages (POPL), pp. 296\u2013309 (2005)","DOI":"10.1145\/1047659.1040330"},{"key":"12_CR30","doi-asserted-by":"publisher","unstructured":"Noam Rinetzky, Mooly Sagiv, and Eran Yahav. Interprocedural shape analysis for cutpoint-free programs. In: Hankin, C., Siveroni, I. (eds.) Static Analysis Symposium (SAS), Springer, Berlin, pp. 284\u2013302 (2005) https:\/\/doi.org\/10.1007\/11547662_20","DOI":"10.1007\/11547662_20"},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-45306-7_10","volume-title":"Compiler Construction","author":"N Rinetzky","year":"2001","unstructured":"Rinetzky, N., Sagiv, M.: Interprocedural shape analysis for recursive programs. In: Wilhelm, R. (ed.) CC 2001. LNCS, vol. 2027, pp. 133\u2013149. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45306-7_10"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Rival, X., Chang, B.Y.E.: Calling context abstraction with shapes. In: Symposium on Principles of Programming Languages (POPL), pp. 173\u2013186. ACM (2011)","DOI":"10.1145\/1925844.1926406"},{"issue":"1","key":"12_CR33","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/271510.271517","volume":"20","author":"M Sagiv","year":"1998","unstructured":"Sagiv, M., Reps, T., Whilhelm, R.: Solving shape-analysis problems in languages with destructive updating. ACM Trans. Program. Lang. Syst. (TOPLAS) 20(1), 50 (1998)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"12_CR34","unstructured":"Schaefer, I., Podelski, A.: Local reasoning for termination. In: COSMICAH 2005: Workshop on Verification of COncurrent Systems with dynaMIC Allocated Heaps, pp. 16\u201330 (2005)"},{"key":"12_CR35","unstructured":"Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis. In: Program Flow Analysis: Theory and Applications, chapter 7. Prentice-Hall Inc, Englewood Cliffs, New Jersey (1981)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65474-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,13]],"date-time":"2021-01-13T13:48:27Z","timestamp":1610545707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65474-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030654733","9783030654740"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65474-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"13 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Static Analysis Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chicago, IL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sas2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/sas-2020","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","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":"14","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":"41% - 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":"7","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":"Due to the Corona pandemic the event was held virtually.","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)"}}]}}