{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T14:58:29Z","timestamp":1782572309079,"version":"3.54.5"},"publisher-location":"Cham","reference-count":23,"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_13","type":"book-chapter","created":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T06:02:53Z","timestamp":1623909773000},"page":"240-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Verifying Graph Programs with Monadic Second-Order Logic"],"prefix":"10.1007","author":[{"given":"Gia S.","family":"Wulandari","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Detlef","family":"Plump","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-030-17601-3_4","volume-title":"Engineering Trustworthy Software Systems","author":"N Bj\u00f8rner","year":"2019","unstructured":"Bj\u00f8rner, N., de Moura, L., Nachmanson, L., Wintersteiger, C.M.: Programming Z3. In: Bowen, J.P., Liu, Z., Zhang, Z. (eds.) SETSS 2018. LNCS, vol. 11430, pp. 148\u2013201. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17601-3_4"},{"key":"13_CR2","unstructured":"Campbell, G.: Efficient graph rewriting. BSc thesis, Department of Computer Science, University of York (2019). ArXiv e-print arXiv:1906.05170"},{"key":"13_CR3","unstructured":"Campbell, X., Courtehoute, B., Plump, D.: Fast rule-based graph programs. ArXiv e-print arXiv:2012.11394 (2020)"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990). https:\/\/doi.org\/10.1016\/0890-5401(90)90043-H","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/3-540-55251-0_7","volume-title":"CAAP 1992","author":"B Courcelle","year":"1992","unstructured":"Courcelle, B.: Monadic second-order definable graph transductions. In: Raoult, J.-C. (ed.) CAAP 1992. LNCS, vol. 581, pp. 124\u2013144. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55251-0_7"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Encyclopedia of Mathematics and Its Applications, vol. 138. Cambridge University Press (2012). https:\/\/doi.org\/10.1017\/CBO9780511977619","DOI":"10.1017\/CBO9780511977619"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Habel, A., Pennemann, K.-H.: Correctness of high-level transformation systems relative to nested conditions. Math. Struct. Comput. Sci. 19, 245\u2013296 (2009). https:\/\/doi.org\/10.1017\/S0960129508007202","DOI":"10.1017\/S0960129508007202"},{"key":"13_CR8","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":"13_CR9","doi-asserted-by":"publisher","unstructured":"Habel, A., Radke, H.: Expressiveness of graph conditions with variables. Electron. Commun. EASST 30 (2010). https:\/\/doi.org\/10.14279\/tuj.eceasst.30.404","DOI":"10.14279\/tuj.eceasst.30.404"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Nipkow, T.: Hoare logics in Isabelle\/HOL. In: Schwichtenberg, H., Steinbr\u00fcggen, R., (eds.), Proof and System-Reliability, pp. 341\u2013367. Kluwer Academic Publishers (2002). https:\/\/doi.org\/10.1007\/978-94-010-0413-8_11","DOI":"10.1007\/978-94-010-0413-8_11"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Nipkow, T., Klein, G.: Concrete Semantics - With Isabelle\/HOL. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-319-10542-0","DOI":"10.1007\/978-3-319-10542-0"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-35746-6_3","volume-title":"Tools for Practical Software Verification","author":"C Paulin-Mohring","year":"2012","unstructured":"Paulin-Mohring, C.: Introduction to the Coq proof-assistant for practical software verification. In: Meyer, B., Nordio, M. (eds.) LASER 2011. LNCS, vol. 7682, pp. 45\u201395. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35746-6_3"},{"key":"13_CR13","unstructured":"Pennemann, K.-H.: Development of Correct Graph Transformation Systems. PhD thesis, Universit\u00e4t Oldenburg (2009)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-03564-7_6","volume-title":"Algebraic Informatics","author":"D Plump","year":"2009","unstructured":"Plump, D.: The graph programming language GP. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2009. LNCS, vol. 5725, pp. 99\u2013122. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03564-7_6"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Plump, D.: From imperative to rule-based graph programs. J. Logic Algebraic Meth. Program. 88, 154\u2013173 (2017). https:\/\/doi.org\/10.1016\/j.jlamp.2016.12.001","DOI":"10.1016\/j.jlamp.2016.12.001"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Poskitt, C.M.: Verification of Graph Programs. PhD thesis, The University of York (2013)","DOI":"10.1007\/978-3-642-33654-6_30"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Poskitt, C.M., Plump, D.: Hoare-style verification of graph programs. Fundam. Informaticae 118(1\u20132), 135\u2013175 (2012). https:\/\/doi.org\/10.3233\/FI-2012-708","DOI":"10.3233\/FI-2012-708"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Poskitt, C.M., Plump, D.: Verifying total correctness of graph programs. In: Graph Computation Models (GCM 2012), Revised Selected Papers, volume 61 of Electronic Communications of the EASST (2013). https:\/\/doi.org\/10.14279\/tuj.eceasst.61.827","DOI":"10.14279\/tuj.eceasst.61.827"},{"key":"13_CR19","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":"13_CR20","unstructured":"Radke, H.: A Theory of HR* Graph Conditions and their Application to Meta-Modeling. PhD thesis, University of Oldenburg, Germany (2016)"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Wulandari, G., Plump, D.: Verifying graph programs with first-order logic. In: Proceedings of GCM 2020, volume 330 of EPTCS, pp. 181\u2013200 (2020). https:\/\/doi.org\/10.4204\/EPTCS.330.11","DOI":"10.4204\/EPTCS.330.11"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Wulandari, G.S.: Verification of graph programs with monadic second-order logic. Submitted PhD thesis (2021)","DOI":"10.1007\/978-3-030-78946-6_13"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Wulandari, G.S., Plump, D.: Verifying graph programs with monadic second-order logic (extended version). Technical report, University of York (2021). https:\/\/uoycs-plasma.github.io\/GP2\/publications","DOI":"10.1007\/978-3-030-78946-6_13"}],"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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T23:31:54Z","timestamp":1624318314000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78946-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030789459","9783030789466"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78946-6_13","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)"}}]}}