{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T19:11:49Z","timestamp":1775243509355,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030021481","type":"print"},{"value":"9783030021498","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-3-030-02149-8_16","type":"book-chapter","created":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T17:25:34Z","timestamp":1538760334000},"page":"263-279","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["False Failure: Creating Failure Models for Separation Logic"],"prefix":"10.1007","author":[{"given":"Callum","family":"Bannister","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"H\u00f6fner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,6]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-319-94821-8_5","volume-title":"Interactive Theorem Proving","author":"C Bannister","year":"2018","unstructured":"Bannister, C., H\u00f6fner, P., Klein, G.: Backwards and forwards with separation logic. In: Avigad, J., Mahboubi, A. (eds.) ITP 2018. LNCS, vol. 10895, pp. 68\u201387. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94821-8_5"},{"key":"16_CR2","unstructured":"Birkhoff, G.: Lattice Theory, Colloquium Publications, vol. XXV. Annals of Mathematics Studies, 3rd edn. (1967)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Brotherston, J., Calcagno, C.: Classical BI: its semantics and proof theory. Log. Methods Comput. Sci. 6(3) (2010)","DOI":"10.2168\/LMCS-6(3:3)2010"},{"key":"16_CR4","unstructured":"Brotherston, J., Villard, J.: Sub-classical Boolean bunched logics and the meaning of par. In: Kreutzer, S. (ed.) Computer Science Logic (CSL 2015). Leibniz International Proceedings in Informatics (LIPIcs), vol. 41, pp. 325\u2013342. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2015)"},{"key":"16_CR5","volume-title":"The Structure of Arithmetic","author":"HE Campbell","year":"1970","unstructured":"Campbell, H.E.: The Structure of Arithmetic. Appleton-Century-Crofts, New York (1970)"},{"key":"16_CR6","volume-title":"Regular Algebra and Finite Machines","author":"JH Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971)"},{"key":"16_CR7","unstructured":"Dang, H.H.: Algebraic calculi for separation logic. Ph.D. thesis, University of Augsburg, Germany (2014)"},{"issue":"6","key":"16_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.jlap.2011.04.003","volume":"80","author":"HH Dang","year":"2011","unstructured":"Dang, H.H., H\u00f6fner, P., M\u00f6ller, B.: Algebraic separation logic. J. Logic Algebraic Program. 80(6), 221\u2013247 (2011)","journal-title":"J. Logic Algebraic Program."},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-319-57418-9_6","volume-title":"Relational and Algebraic Methods in Computer Science","author":"J Desharnais","year":"2017","unstructured":"Desharnais, J., M\u00f6ller, B.: Non-associative Kleene algebra and temporal logics. In: H\u00f6fner, P., Pous, D., Struth, G. (eds.) RAMiCS 2017. LNCS, vol. 10226, pp. 93\u2013108. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57418-9_6"},{"key":"16_CR10","volume-title":"A Discipline of Programming","author":"EW Dijkstra","year":"1976","unstructured":"Dijkstra, E.W.: A Discipline of Programming. Prentice Hall, Englewood Cliffs (1976)"},{"key":"16_CR11","unstructured":"Dongol, B., Hayes, I.J., Struth, G.: Relational convolution, generalised modalities and incidence algebras. arXiv:1702.04603 (2017)"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"331","DOI":"10.2307\/2214128","volume":"7","author":"J Dunn","year":"1993","unstructured":"Dunn, J.: Star and perp. Philos. Perspect. 7, 331\u2013357 (1993)","journal-title":"Philos. Perspect."},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","volume":"19","author":"RW Floyd","year":"1967","unstructured":"Floyd, R.W.: Assigning meanings to programs. Math. Aspects Comput. Sci. 19, 19\u201332 (1967)","journal-title":"Math. Aspects Comput. Sci."},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12, 576\u2013580 (1969)","journal-title":"Commun. ACM"},{"issue":"6","key":"16_CR15","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.jlap.2011.04.005","volume":"80","author":"T Hoare","year":"2011","unstructured":"Hoare, T., M\u00f6ller, B., Struth, G., Wehrman, I.: Concurrent Kleene algebra and its foundations. J. Logic Algebraic Program. 80(6), 266\u2013296 (2011)","journal-title":"J. Logic Algebraic Program."},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.jlap.2008.08.005","volume":"78","author":"P H\u00f6fner","year":"2009","unstructured":"H\u00f6fner, P., M\u00f6ller, B.: An algebra of hybrid systems. J. Logic Algebraic Program. 78, 74\u201397 (2009)","journal-title":"J. Logic Algebraic Program."},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/373243.375719","volume":"36","author":"SS Ishtiaq","year":"2001","unstructured":"Ishtiaq, S.S., O\u2019Hearn, P.W.: BI as an assertion language for mutable data structures. SIGPLAN Not. 36, 14\u201326 (2001)","journal-title":"SIGPLAN Not."},{"issue":"1","key":"16_CR18","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF00290146","volume":"22","author":"D Jacobs","year":"1985","unstructured":"Jacobs, D., Gries, D.: General correctness: a unification of partial and total correctness. Acta Inf. 22(1), 67\u201383 (1985)","journal-title":"Acta Inf."},{"issue":"1","key":"16_CR19","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/343369.343378","volume":"1","author":"D Kozen","year":"2000","unstructured":"Kozen, D.: On Hoare logic and Kleene algebra with tests. ACM Trans. Comput. Logic 1(1), 60\u201376 (2000)","journal-title":"ACM Trans. Comput. Logic"},{"key":"16_CR20","unstructured":"Mares, E.: Relevance logic. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, Spring 2014 edn. (2014)"},{"key":"16_CR21","unstructured":"M\u00f6ller, B.: Residuals and detachments. Technical report 2005\u201320, Institut f\u00fcr Informatik, Universit\u00e4t Augsburg (2005)"},{"issue":"2","key":"16_CR22","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.tcs.2005.09.069","volume":"351","author":"B M\u00f6ller","year":"2006","unstructured":"M\u00f6ller, B., Struth, G.: Algebras of modal operators and partial correctness. Theor. Comput. Sci. 351(2), 221\u2013239 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/11734673_16","volume-title":"Relational Methods in Computer Science","author":"B M\u00f6ller","year":"2006","unstructured":"M\u00f6ller, B., Struth, G.: wp Is wlp. In: MacCaull, W., Winter, M., D\u00fcntsch, I. (eds.) RelMiCS 2005. LNCS, vol. 3929, pp. 200\u2013211. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11734673_16"},{"key":"16_CR24","unstructured":"Mulvey, C.:&. In: Second Topology Conference (1986). Rendiconti del Circolo Matematico di Palermo 2(12), 99\u2013104"},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL: A Proof Assistant for Higher-Order Logic","year":"2002","unstructured":"Nipkow, T., Wenzel, M., Paulson, L.C. (eds.): Isabelle\/HOL: A Proof Assistant for Higher-Order Logic. LNCS, vol. 2283. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45949-9"},{"key":"16_CR26","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.tcs.2006.12.035","volume":"375","author":"P O\u2019Hearn","year":"2007","unstructured":"O\u2019Hearn, P.: Resources, concurrency, and local reasoning. Theor. Comput. Sci. 375, 271\u2013307 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44802-0_1","volume-title":"Computer Science Logic","author":"P O\u2019Hearn","year":"2001","unstructured":"O\u2019Hearn, P., Reynolds, J., Yang, H.: Local reasoning about programs that alter data structures. In: Fribourg, L. (ed.) CSL 2001. LNCS, vol. 2142, pp. 1\u201319. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44802-0_1"},{"key":"16_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-0091-7","volume-title":"The Semantics and Proof Theory of the Logic of Bunched Implications","author":"D Pym","year":"2002","unstructured":"Pym, D.: The Semantics and Proof Theory of the Logic of Bunched Implications. Kluwer Academic Publishers, Boston (2002)"},{"key":"16_CR29","unstructured":"Reynolds, J.C.: Intuitionistic reasoning about shared mutable data structure. In: Davies, J., Roscoe, B., Woodcock, J. (eds.) Millennial Perspectives in Computer Science, pp. 303\u2013321. Palgrave (2000)"},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: An introduction to separation logic. In: Broy, M., Sitou, W., Hoare, T. (eds.) Engineering Methods and Tools for Software Safety and Security, NATO Science for Peace and Security Series - D: Information and Communication Security, vol. 22, pp. 285\u2013310. IOS Press (2009)","DOI":"10.3233\/978-1-58603-976-9-285"},{"key":"16_CR31","unstructured":"Rosenthal, K.: Quantales and Their Applications. Pitman Research Notes in Mathematics Series, vol. 234 (1990)"},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-540-74407-8_18","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"V Vafeiadis","year":"2007","unstructured":"Vafeiadis, V., Parkinson, M.: A marriage of rely\/guarantee and separation logic. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 256\u2013271. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74407-8_18"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02149-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T18:38:24Z","timestamp":1775241504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02149-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030021481","9783030021498"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02149-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"RAMiCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Groningen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ramics-conference.org\/","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"70% - 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"}},{"value":"4.06","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4.17","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"1 full invited talk","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}