{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T23:07:10Z","timestamp":1781651230573,"version":"3.54.5"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031258022","type":"print"},{"value":"9783031258039","type":"electronic"}],"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-3-031-25803-9_8","type":"book-chapter","created":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T20:10:16Z","timestamp":1675195816000},"page":"129-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Separating Separation Logic \u2013 Modular Verification of\u00a0Red-Black Trees"],"prefix":"10.1007","author":[{"given":"Gerhard","family":"Schellhorn","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Bodenm\u00fcller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Bitterlich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wolfgang","family":"Reif","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,2,1]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624162","volume-title":"The B-Book: Assigning Programs to Meanings","author":"JR Abrial","year":"1996","unstructured":"Abrial, J.R., Hoare, A., Chapron, P.: The B-Book: Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)"},{"key":"8_CR2","unstructured":"Affeldt, R., Garrigue, J., Qi, X., Tanaka, K.: Proving tree algorithms for succinct data structures. In: 10th International Conference on Interactive Theorem Proving (ITP 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol. 141, pp. 5:1\u20135:19 (2019)"},{"key":"8_CR3","unstructured":"Appel, A.: Efficient Verified Red-Black Trees (2011)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Armborst, L., Huisman, M.: Permission-based verification of red-black trees and their merging. In: Proceedings of FormaliSE, vol. 21, pp. 111\u2013123 (2021)","DOI":"10.1109\/FormaliSE52586.2021.00017"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-030-76020-5_14","volume-title":"Logic, Computation and Rigorous Methods","author":"S Bodenm\u00fcller","year":"2021","unstructured":"Bodenm\u00fcller, S., Schellhorn, G., Bitterlich, M., Reif, W.: Flashix: modular verification of a concurrent and crash-safe flash file system. In: Raschke, A., Riccobene, E., Schewe, K.-D. (eds.) Logic, Computation and Rigorous Methods. LNCS, vol. 12750, pp. 239\u2013265. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-76020-5_14"},{"issue":"1\u20132","key":"8_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00165-003-0012-7","volume":"15","author":"E B\u00f6rger","year":"2003","unstructured":"B\u00f6rger, E.: The ASM refinement method. Formal Aspects Comput. 15(1\u20132), 237\u2013257 (2003)","journal-title":"Formal Aspects Comput."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Chargu\u00e9raud, A.: Program verification through characteristic formulae. In: Proceedings of ACM SIGPLAN International Conference on Functional Programming (ICFP), pp. 321\u2013332. Association for Computing Machinery (2010)","DOI":"10.1145\/1932681.1863590"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Chargu\u00e9raud, A.: Higher-order representation predicates in separation logic. In: Proceedings of ACM SIGPLAN Conference on Certified Programs and Proofs (CPP), pp. 3\u201314. Association for Computing Machinery (2016)","DOI":"10.1145\/2854065.2854068"},{"key":"8_CR9","volume-title":"Introduction to Algorithms","author":"T Cormen","year":"2009","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Derrick, J., Boiten, E.: Refinement in Z and in Object-Z: Foundations and Advanced Applications. FACIT. Springer, Cham (2001). Second, Revised Edition (2014)","DOI":"10.1007\/978-1-4471-5355-9"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-319-57288-8_5","volume-title":"NASA Formal Methods","author":"C Dross","year":"2017","unstructured":"Dross, C., Moy, Y.: Auto-active proof of red-black trees in SPARK. In: Barrett, C., Davies, M., Kahsai, T. (eds.) NFM 2017. LNCS, vol. 10227, pp. 68\u201383. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57288-8_5"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-46425-5_8","volume-title":"Programming Languages and Systems","author":"J Elgaard","year":"2000","unstructured":"Elgaard, J., M\u00f8ller, A., Schwartzbach, M.I.: Compile-time debugging of C programs working on trees. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol. 1782, pp. 119\u2013134. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46425-5_8"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Ernst, G., Pf\u00e4hler, J., Schellhorn, G., Reif, W.: Modular, crash-safe refinement for ASMs with submachines. Sci. Comput. Program. 131, 3\u201321 (2016). Abstract State Machines, Alloy, B, TLA, VDM and Z (ABZ 2014)","DOI":"10.1016\/j.scico.2016.04.009"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-24690-6_14","volume-title":"Software Engineering and Formal Methods","author":"G Ernst","year":"2011","unstructured":"Ernst, G., Schellhorn, G., Reif, W.: Verification of B$$^{+}$$ trees: an experiment combining shape analysis and interactive theorem proving. In: Barthe, G., Pardo, A., Schneider, G. (eds.) SEFM 2011. LNCS, vol. 7041, pp. 188\u2013203. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24690-6_14"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-031-13188-2_13","volume-title":"Computer Aided Verification","author":"M Faella","year":"2022","unstructured":"Faella, M., Parlato, G.: Reasoning about data trees using CHCs. In: Shoham, S., Vizel, Y. (eds.) CAV 2022. LNCS, vol. 13372, pp. 249\u2013271. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-13188-2_13"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-540-24725-8_26","volume-title":"Programming Languages and Systems","author":"J-C Filli\u00e2tre","year":"2004","unstructured":"Filli\u00e2tre, J.-C., Letouzey, P.: Functors for proofs and programs. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 370\u2013384. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24725-8_26"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. In: Proceedings of the 19th Symposium on Foundations of Computer Science (SFCS), pp. 8\u201321. IEEE (1978)","DOI":"10.1109\/SFCS.1978.3"},{"key":"8_CR18","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"D Harel","year":"2000","unstructured":"Harel, D., Tiuryn, J., Kozen, D.: Dynamic Logic. MIT Press, Cambridge (2000)"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-18381-2_25","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"F Havasi","year":"2011","unstructured":"Havasi, F.: An improved B+ tree for flash file systems. In: \u010cern\u00e1, I., et al. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 297\u2013307. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18381-2_25"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-20398-5_4","volume-title":"NASA Formal Methods","author":"B Jacobs","year":"2011","unstructured":"Jacobs, B., Smans, J., Philippaerts, P., Vogels, F., Penninckx, W., Piessens, F.: VeriFast: a powerful, sound, predictable, fast verifier for C and Java. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds.) NFM 2011. LNCS, vol. 6617, pp. 41\u201355. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20398-5_4"},{"key":"8_CR21","volume-title":"Algorithms and Data Structures - The Basic Toolbox","author":"P Sanders","year":"2008","unstructured":"Sanders, P., Mehlhorn, K.: Algorithms and Data Structures - The Basic Toolbox. Springer, Heidelberg (2008)"},{"issue":"4","key":"8_CR22","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1017\/S0956796801004026","volume":"11","author":"S Kahrs","year":"2001","unstructured":"Kahrs, S.: Red-black trees with types. J. Funct. Program. 11(4), 182\u2013196 (2001)","journal-title":"J. Funct. Program."},{"key":"8_CR23","unstructured":"KIV Proofs for the Correctness of Red-Black Trees (2022). https:\/\/kiv.isse.de\/projects\/RBtree.html"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-319-22102-1_17","volume-title":"Interactive Theorem Proving","author":"P Lammich","year":"2015","unstructured":"Lammich, P.: Refinement to imperative\/HOL. In: Urban, C., Zhang, X. (eds.) ITP 2015. LNCS, vol. 9236, pp. 253\u2013269. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22102-1_17"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-030-51054-1_18","volume-title":"Automated Reasoning","author":"P Lammich","year":"2020","unstructured":"Lammich, P.: Efficient verified implementation of Introsort and Pdqsort. In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12167, pp. 307\u2013323. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51054-1_18"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-662-49122-5_2","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P M\u00fcller","year":"2016","unstructured":"M\u00fcller, P., Schwerhoff, M., Summers, A.J.: Viper: a verification infrastructure for permission-based reasoning. In: Jobstmann, B., Leino, K.R.M. (eds.) VMCAI 2016. LNCS, vol. 9583, pp. 41\u201362. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49122-5_2"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-319-43144-4_19","volume-title":"Interactive Theorem Proving","author":"T Nipkow","year":"2016","unstructured":"Nipkow, T.: Automatic functional correctness proofs for functional search trees. In: Blanchette, J.C., Merz, S. (eds.) ITP 2016. LNCS, vol. 9807, pp. 307\u2013322. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-43144-4_19"},{"key":"8_CR28","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1017\/S095679682100023X","volume":"31","author":"L O\u2019Connor","year":"2021","unstructured":"O\u2019Connor, L., et al.: Cogent: uniqueness types and certifying compilation. J. Funct. Program. 31, 25 (2021)","journal-title":"J. Funct. Program."},{"issue":"4","key":"8_CR29","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1007\/s10817-019-09534-y","volume":"64","author":"R Pe\u00f1a","year":"2019","unstructured":"Pe\u00f1a, R.: An assertional proof of red\u2013black trees using Dafny. J. Autom. Reason. 64(4), 767\u2013791 (2019). https:\/\/doi.org\/10.1007\/s10817-019-09534-y","journal-title":"J. Autom. Reason."},{"key":"8_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-319-19249-9_26","volume-title":"FM 2015: Formal Methods","author":"N Polikarpova","year":"2015","unstructured":"Polikarpova, N., Tschannen, J., Furia, C.A.: A fully verified container library. In: Bj\u00f8rner, N., de Boer, F. (eds.) FM 2015. LNCS, vol. 9109, pp. 414\u2013434. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19249-9_26"},{"key":"8_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-319-46520-3_16","volume-title":"Automated Technology for Verification and Analysis","author":"A Reynolds","year":"2016","unstructured":"Reynolds, A., Iosif, R., Serban, C., King, T.: A decision procedure for separation logic in SMT. In: Artho, C., Legay, A., Peled, D. (eds.) ATVA 2016. LNCS, vol. 9938, pp. 244\u2013261. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46520-3_16"},{"key":"8_CR32","unstructured":"Reynolds, J.C.: Separation logic: a logic for shared mutable data structures. In: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science, pp. 55\u201374. IEEE (2002)"},{"key":"8_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/978-3-030-48077-6_2","volume-title":"Rigorous State-Based Methods","author":"G Schellhorn","year":"2020","unstructured":"Schellhorn, G., Bodenm\u00fcller, S., Pf\u00e4hler, J., Reif, W.: Adding concurrency to a sequential refinement tower. In: Raschke, A., M\u00e9ry, D., Houdek, F. (eds.) ABZ 2020. LNCS, vol. 12071, pp. 6\u201323. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-48077-6_2"},{"key":"8_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-031-08166-8_20","volume-title":"The Logic of Software. A Tasting Menu of Formal Methods","author":"G Schellhorn","year":"2022","unstructured":"Schellhorn, G., Bodenm\u00fcller, S., Bitterlich, M., Reif, W.: Software & system verification with KIV. In: Ahrendt, W., Beckert, B., Bubel, R., Johnsen, E.B. (eds.) The Logic of Software. A Tasting Menu of Formal Methods. LNCS, vol. 13360, pp. 408\u2013436. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-08166-8_20"},{"key":"8_CR35","unstructured":"Sedgewick, R., Wayne, K.: Algorithms, 4th edn. Addison-Wesley (2011)"},{"key":"8_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-319-89960-2_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B Zhan","year":"2018","unstructured":"Zhan, B.: Efficient verification of imperative programs using auto2. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10805, pp. 23\u201340. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89960-2_2"}],"container-title":["Lecture Notes in Computer Science","Verified Software. Theories, Tools and Experiments."],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-25803-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T20:21:32Z","timestamp":1675196492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25803-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031258022","9783031258039"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25803-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VSTTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Working Conference on Verified Software: Theories, Tools, and Experiments","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trento","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vstte2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/vstte22.fbk.eu\/","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","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":"9","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":"45% - 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.1","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":"4","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)"}}]}}