{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T19:51:43Z","timestamp":1777578703239,"version":"3.51.4"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030789459","type":"print"},{"value":"9783030789466","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-78946-6_5","type":"book-chapter","created":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T06:02:53Z","timestamp":1623909773000},"page":"81-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Incorrectness Logic for Graph Programs"],"prefix":"10.1007","author":[{"given":"Christopher M.","family":"Poskitt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Al-Sibahi, A.S., Dimovski, A.S., Wasowski, A.: Symbolic execution of high-level transformations. In: SLE 2016, pp. 207\u2013220. ACM (2016)","DOI":"10.1145\/2997364.2997382"},{"key":"5_CR2","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-745-5","volume-title":"Verification of Sequential and Concurrent Programs","author":"KR Apt","year":"2009","unstructured":"Apt, K.R., de Boer, F.S., Olderog, E.: Verification of Sequential and Concurrent Programs. Texts in Computer Science. Springer, London (2009). https:\/\/doi.org\/10.1007\/978-1-84882-745-5"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"110675","DOI":"10.1016\/j.jss.2020.110675","volume":"168","author":"B Azizi","year":"2020","unstructured":"Azizi, B., Zamani, B., Rahimi, S.K.: SEET: symbolic execution of ETL transformations. J. Syst. Softw. 168, 110675 (2020)","journal-title":"J. Syst. Softw."},{"issue":"7","key":"5_CR4","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1016\/j.ic.2008.04.002","volume":"206","author":"P Baldan","year":"2008","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B.: A framework for the verification of infinite-state graph transformation systems. Inf. Comput. 206(7), 869\u2013907 (2008)","journal-title":"Inf. Comput."},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-319-92991-0_10","volume-title":"Graph Transformation","author":"JH Brenas","year":"2018","unstructured":"Brenas, J.H., Echahed, R., Strecker, M.: Verifying graph transformation systems with description logics. In: Lambers, L., Weber, J. (eds.) ICGT 2018. LNCS, vol. 10887, pp. 155\u2013170. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-92991-0_10"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Bruni, R., Giacobazzi, R., Gori, R., Ranzato, F.: A logic for locally complete abstract interpretations. In: LICS 2021. IEEE (2021, to appear)","DOI":"10.1109\/LICS52264.2021.9470608"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1137\/0207005","volume":"7","author":"SA Cook","year":"1978","unstructured":"Cook, S.A.: Soundness and completeness of an axiom system for program verification. SIAM J. Comput. 7(1), 70\u201390 (1978)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s00165-017-0443-1","volume":"30","author":"C Corrodi","year":"2018","unstructured":"Corrodi, C., Heu\u00dfner, A., Poskitt, C.M.: A semantics comparison workbench for a concurrent, asynchronous, distributed programming language. Formal Aspects Comput. 30(1), 163\u2013192 (2018)","journal-title":"Formal Aspects Comput."},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10009-011-0186-x","volume":"14","author":"AH Ghamarian","year":"2012","unstructured":"Ghamarian, A.H., de Mol, M., Rensink, A., Zambon, E., Zimakova, M.: Modelling and analysis using GROOVE. Int. J. Softw. Tools Technol. Transfer 14(1), 15\u201340 (2012)","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1017\/S0960129508007202","volume":"19","author":"A Habel","year":"2009","unstructured":"Habel, A., Pennemann, K.: Correctness of high-level transformation systems relative to nested conditions. Math. Struct. Comput. Sci. 19(2), 245\u2013296 (2009)","journal-title":"Math. Struct. Comput. Sci."},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11841883_31","volume-title":"Graph Transformations","author":"A Habel","year":"2006","unstructured":"Habel, A., Pennemann, K.-H., Rensink, A.: Weakest preconditions for high-level programs. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 445\u2013460. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11841883_31"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-45832-8_12","volume-title":"Graph Transformation","author":"A Habel","year":"2002","unstructured":"Habel, A., Plump, D.: Relabelling in graph transformation. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol. 2505, pp. 135\u2013147. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45832-8_12"},{"key":"5_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-43916-3","volume-title":"Graph Transformation for Software Engineers - With Applications to Model-Based Development and Domain-Specific Language Engineering","author":"R Heckel","year":"2020","unstructured":"Heckel, R., Taentzer, G.: Graph Transformation for Software Engineers - With Applications to Model-Based Development and Domain-Specific Language Engineering. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43916-3"},{"issue":"10","key":"5_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 (CACM) 12(10), 576\u2013580 (1969)","journal-title":"Commun. ACM (CACM)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-38592-6_13","volume-title":"Formal Techniques for Distributed Systems","author":"T Isenberg","year":"2013","unstructured":"Isenberg, T., Steenken, D., Wehrheim, H.: Bounded model checking of graph transformation systems via SMT solving. In: Beyer, D., Boreale, M. (eds.) FMOODS\/FORTE -2013. LNCS, vol. 7892, pp. 178\u2013192. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38592-6_13"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-15928-2_8","volume-title":"Graph Transformations","author":"B K\u00f6nig","year":"2010","unstructured":"K\u00f6nig, B., Esparza, J.: Verification of graph transformation systems with context-free specifications. In: Ehrig, H., Rensink, A., Rozenberg, G., Sch\u00fcrr, A. (eds.) ICGT 2010. LNCS, vol. 6372, pp. 107\u2013122. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15928-2_8"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-030-23611-3_7","volume-title":"Graph Transformation","author":"A Makhlouf","year":"2019","unstructured":"Makhlouf, A., Percebois, C., Tran, H.N.: Two-level reasoning about graph transformation programs. In: Guerra, E., Orejas, F. (eds.) ICGT 2019. LNCS, vol. 11629, pp. 111\u2013127. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23611-3_7"},{"key":"5_CR18","unstructured":"Murray, T.: An under-approximate relational logic: heralding logics of insecurity, incorrect implementation & more. CoRR abs\/2003.04791 (2020)"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"100616","DOI":"10.1016\/j.jlamp.2020.100616","volume":"118","author":"M Navarro","year":"2021","unstructured":"Navarro, M., Orejas, F., Pino, E., Lambers, L.: A navigational logic for reasoning about graph properties. J. Logical Algebraic Methods Program. 118, 100616 (2021)","journal-title":"J. Logical Algebraic Methods Program."},{"issue":"3","key":"5_CR20","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s10270-016-0548-7","volume":"17","author":"BJ Oakes","year":"2018","unstructured":"Oakes, B.J., Troya, J., L\u00facio, L., Wimmer, M.: Full contract verification for ATL using symbolic execution. Softw. Syst. Model. 17(3), 815\u2013849 (2018)","journal-title":"Softw. Syst. Model."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"O\u2019Hearn, P.W.: Incorrectness logic. Proc. ACM Program. Lang. 4(POPL), 10:1\u201310:32 (2020)","DOI":"10.1145\/3371078"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.tcs.2018.02.031","volume":"741","author":"F Orejas","year":"2018","unstructured":"Orejas, F., Pino, E., Navarro, M., Lambers, L.: Institutions for navigational logics for graphical structures. Theoret. Comput. Sci. 741, 19\u201324 (2018)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Plump, D.: The design of GP 2. In: WRS 2011. EPTCS, vol. 82, pp. 1\u201316 (2011)","DOI":"10.4204\/EPTCS.82.1"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Poskitt, C.M.: Verification of graph programs. Ph.D. thesis, University of York (2013)","DOI":"10.1007\/978-3-642-33654-6_30"},{"issue":"1\u20132","key":"5_CR25","first-page":"135","volume":"118","author":"CM Poskitt","year":"2012","unstructured":"Poskitt, C.M., Plump, D.: Hoare-style verification of graph programs. Fund. Inform. 118(1\u20132), 135\u2013175 (2012)","journal-title":"Fund. Inform."},{"key":"5_CR26","unstructured":"Poskitt, C.M., Plump, D.: Verifying total correctness of graph programs. ECEASST, vol. 61 (2013)"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-09108-2_3","volume-title":"Graph Transformation","author":"CM Poskitt","year":"2014","unstructured":"Poskitt, C.M., Plump, D.: Verifying monadic second-order properties of graph programs. In: Giese, H., K\u00f6nig, B. (eds.) ICGT 2014. LNCS, vol. 8571, pp. 33\u201348. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09108-2_3"},{"key":"5_CR28","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_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-030-51372-6_15","volume-title":"Graph Transformation","author":"S Schneider","year":"2020","unstructured":"Schneider, S., Dyck, J., Giese, H.: Formal verification of invariants for attributed graph transformation systems based on nested attributed graph conditions. In: Gadducci, F., Kehrer, T. (eds.) ICGT 2020. LNCS, vol. 12150, pp. 257\u2013275. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51372-6_15"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-24690-6_12","volume-title":"Software Engineering and Formal Methods","author":"E de Vries","year":"2011","unstructured":"de Vries, E., Koutavas, V.: Reverse Hoare logic. In: Barthe, G., Pardo, A., Schneider, G. (eds.) SEFM 2011. LNCS, vol. 7041, pp. 155\u2013171. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24690-6_12"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Wulandari, G.S., Plump, D.: Verifying graph programs with first-order logic. In: GCM 2020. EPTCS, vol. 330, pp. 181\u2013200 (2020)","DOI":"10.4204\/EPTCS.330.11"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78946-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T12:39:00Z","timestamp":1672490340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78946-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030789459","9783030789466"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78946-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"18 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Graph Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","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":"icgt2021","order":10,"name":"conference_id","label":"Conference ID","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":"26","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":"54% - 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":"3","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":"In addition, the proceedings contain 2 tool 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)"}}]}}