{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:29:27Z","timestamp":1743146967114,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031367083"},{"type":"electronic","value":"9783031367090"}],"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-36709-0_7","type":"book-chapter","created":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T18:03:02Z","timestamp":1689271382000},"page":"123-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mechanised DPO Theory: Uniqueness of\u00a0Derivations and\u00a0Church-Rosser Theorem"],"prefix":"10.1007","author":[{"given":"Robert","family":"S\u00f6ldner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Detlef","family":"Plump","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,12]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1297658.1297660","volume":"9","author":"J Avigad","year":"2007","unstructured":"Avigad, J., Donnelly, K., Gray, D., Raff, P.: A formally verified proof of the prime number theorem. ACM Trans. Comput. Log. 9(1), 2 (2007). https:\/\/doi.org\/10.1145\/1297658.1297660","journal-title":"ACM Trans. Comput. Log."},{"unstructured":"Ballarin, C.: Tutorial to locales and locale interpretation (2021). https:\/\/isabelle.in.tum.de\/doc\/locales.pdf","key":"7_CR2"},{"doi-asserted-by":"publisher","unstructured":"Brucker, A.D., Herzberg, M.: A formal semantics of the core DOM in Isabelle\/HOL. In: Companion Proceedings of the The Web Conference 2018, WWW 2018, pp. 741\u2013749. International World Wide Web Conferences Steering Committee (2018). https:\/\/doi.org\/10.1145\/3184558.3185980","key":"7_CR3","DOI":"10.1145\/3184558.3185980"},{"doi-asserted-by":"publisher","unstructured":"Campbell, G., Courtehoute, B., Plump, D.: Fast rule-based graph programs. Sci. Comput. Program. 214 (2022). https:\/\/doi.org\/10.1016\/j.scico.2021.102727","key":"7_CR4","DOI":"10.1016\/j.scico.2021.102727"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2017.04.010","volume":"686","author":"SA da Costa Cavalheiro","year":"2017","unstructured":"da Costa Cavalheiro, S.A., Foss, L., Ribeiro, L.: Theorem proving graph grammars with attributes and negative application conditions. Theoret. Comput. Sci. 686, 25\u201377 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2017.04.010","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR6","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31188-2","volume-title":"Fundamentals of Algebraic Graph Transformation","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. MTCSAES, Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-31188-2"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/3-540-07854-1_188","volume-title":"Mathematical Foundations of Computer Science 1976","author":"H Ehrig","year":"1976","unstructured":"Ehrig, H., Kreowski, H.-J.: Parallelism of manipulations in multidimensional information structures. In: Mazurkiewicz, A. (ed.) MFCS 1976. LNCS, vol. 45, pp. 284\u2013293. Springer, Heidelberg (1976). https:\/\/doi.org\/10.1007\/3-540-07854-1_188"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/mana.19790910111","volume":"91","author":"H Ehrig","year":"1979","unstructured":"Ehrig, H., Kreowski, H.J.: Pushout-properties: an analysis of gluing constructions for graphs. Math. Nachr. 91, 135\u2013149 (1979)","journal-title":"Math. Nachr."},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-87827-8_28","volume-title":"Computer Mathematics","author":"G Gonthier","year":"2008","unstructured":"Gonthier, G.: The four colour theorem: engineering of a formal proof. In: Kapur, D. (ed.) ASCM 2007. LNCS (LNAI), vol. 5081, p. 333. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87827-8_28"},{"doi-asserted-by":"crossref","unstructured":"Habel, A., M\u00fcller, J., Plump, D.: Double-pushout graph transformation revisited. Math. Struct. Comput. Sci. 11(5), 637\u2013688 (2001). https:\/\/doi.org\/10.17\/S0960129501003425","key":"7_CR10","DOI":"10.1017\/S0960129501003425"},{"doi-asserted-by":"publisher","unstructured":"Hales, T., et al.: A formal proof of the Kepler conjecture. In: Forum of Mathematics, Pi, vol 5 (2015). https:\/\/doi.org\/10.1017\/fmp.2017.1","key":"7_CR11","DOI":"10.1017\/fmp.2017.1"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-319-50230-4_11","volume-title":"Software Technologies: Applications and Foundations","author":"I Hristakiev","year":"2016","unstructured":"Hristakiev, I., Plump, D.: Attributed graph transformation via rule schemata: Church-Rosser theorem. In: Milazzo, P., Varr\u00f3, D., Wimmer, M. (eds.) STAF 2016. LNCS, vol. 9946, pp. 145\u2013160. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50230-4_11"},{"key":"7_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810275","volume-title":"Logic in Computer Science - Modelling and Reasoning about Systems","author":"M Huth","year":"2004","unstructured":"Huth, M., Ryan, M.D.: Logic in Computer Science - Modelling and Reasoning about Systems, 2nd edn. Cambridge University Press, Cambridge (2004)","edition":"2"},{"doi-asserted-by":"publisher","unstructured":"Klein, G., et al.: seL4: formal verification of an OS kernel. In: Proceedings Symposium on Operating Systems Principles (SOSP 2009), pp. 207\u2013220. Association for Computing Machinery (2009). https:\/\/doi.org\/10.1145\/1629575.1629596","key":"7_CR14","DOI":"10.1145\/1629575.1629596"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-24727-2_20","volume-title":"Foundations of Software Science and Computation Structures","author":"S Lack","year":"2004","unstructured":"Lack, S., Soboci\u0144ski, P.: Adhesive categories. In: Walukiewicz, I. (ed.) FoSSaCS 2004. LNCS, vol. 2987, pp. 273\u2013288. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24727-2_20"},{"issue":"7","key":"7_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1538788.1538814","volume":"52","author":"X Leroy","year":"2009","unstructured":"Leroy, X.: Formal verification of a realistic compiler. Commun. ACM 52(7), 107\u2013115 (2009). https:\/\/doi.org\/10.1145\/1538788.1538814","journal-title":"Commun. ACM"},{"doi-asserted-by":"publisher","unstructured":"Libkin, L.: Elements of Finite Model Theory. Texts in Theoretical Computer Science. Springer, Cham (2004). https:\/\/doi.org\/10.1007\/978-3-662-07003-1","key":"7_CR17","DOI":"10.1007\/978-3-662-07003-1"},{"doi-asserted-by":"publisher","unstructured":"Nipkow, T., Klein, G.: Concrete Semantics: with Isabelle\/HOL. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10542-0. http:\/\/concrete-semantics.org\/","key":"7_CR18","DOI":"10.1007\/978-3-319-10542-0"},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s11786-014-0183-z","volume":"9","author":"L Noschinski","year":"2014","unstructured":"Noschinski, L.: A graph library for Isabelle. Math. Comput. Sci. 9(1), 23\u201339 (2014). https:\/\/doi.org\/10.1007\/s11786-014-0183-z","journal-title":"Math. Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Paulson, L.C., Nipkow, T., Wenzel, M.: From LCF to Isabelle\/HOL. Formal Aspects Comput. 31(6), 675\u2013698 (2019). https:\/\/doi.org\/10.1007\/s00165-019-00492-1","key":"7_CR20","DOI":"10.1007\/s00165-019-00492-1"},{"doi-asserted-by":"publisher","unstructured":"Plump, D.: Reasoning about graph programs. In: Proceedings with Terms and Graphs (TERMGRAPH 2016). Electronic Proceedings in Theoretical Computer Science, vol. 225, pp. 35\u201344 (2016). https:\/\/doi.org\/10.4204\/EPTCS.225.6","key":"7_CR21","DOI":"10.4204\/EPTCS.225.6"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF00289616","volume":"4","author":"BK Rosen","year":"1975","unstructured":"Rosen, B.K.: Deriving graphs from graphs by applying a production. Acta Informatica 4, 337\u2013357 (1975)","journal-title":"Acta Informatica"},{"doi-asserted-by":"publisher","unstructured":"Schirmer, N., Wenzel, M.: State spaces - the locale way. In: Proceedings International Workshop on Systems Software Verification (SSV 2009). Electronic Notes in Theoretical Computer Science, vol. 254, pp. 161\u2013179 (2009). https:\/\/doi.org\/10.1016\/j.entcs.2009.09.065","key":"7_CR23","DOI":"10.1016\/j.entcs.2009.09.065"},{"doi-asserted-by":"publisher","unstructured":"S\u00f6ldner, R., Plump, D.: Towards Mechanised proofs in Double-Pushout graph transformation. In: Proceedings International Workshop on Graph Computation Models (GCM 2022). Electronic Proceedings in Theoretical Computer Science, vol. 374, pp. 59\u201375 (2022). https:\/\/doi.org\/10.4204\/EPTCS.374.6","key":"7_CR24","DOI":"10.4204\/EPTCS.374.6"},{"issue":"8","key":"7_CR25","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1017\/S096012951800021X","volume":"28","author":"M Strecker","year":"2018","unstructured":"Strecker, M.: Interactive and automated proofs for graph transformations. Math. Struct. Comput. Sci. 28(8), 1333\u20131362 (2018). https:\/\/doi.org\/10.1017\/S096012951800021X","journal-title":"Math. Struct. Comput. Sci."},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/3-540-48256-3_12","volume-title":"Theorem Proving in Higher Order Logics","author":"M Wenzel","year":"1999","unstructured":"Wenzel, M.: Isar \u2014 a generic interpretative approach to readable formal proof documents. In: Bertot, Y., Dowek, G., Th\u00e9ry, L., Hirschowitz, A., Paulin, C. (eds.) TPHOLs 1999. LNCS, vol. 1690, pp. 167\u2013183. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48256-3_12"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-030-78946-6_13","volume-title":"Graph Transformation","author":"GS Wulandari","year":"2021","unstructured":"Wulandari, G.S., Plump, D.: Verifying graph programs with monadic second-order logic. In: Gadducci, F., Kehrer, T. (eds.) ICGT 2021. LNCS, vol. 12741, pp. 240\u2013261. Springer, Cham (2021). https:\/\/doi.org\/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-031-36709-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T18:03:42Z","timestamp":1689271422000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36709-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031367083","9783031367090"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36709-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"12 July 2023","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":"Leicester","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/icgt-2023","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":"29","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":"2","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":"48% - 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.78","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)"}}]}}