{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T04:46:03Z","timestamp":1782535563767,"version":"3.54.5"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032297297","type":"print"},{"value":"9783032297303","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-29730-3_2","type":"book-chapter","created":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T04:07:13Z","timestamp":1782533233000},"page":"25-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Conditional Borrowing Hyperedge Replacement"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7349-7693","authenticated-orcid":false,"given":"Frank","family":"Drewes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5608-996X","authenticated-orcid":false,"given":"Berthold","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8968-9013","authenticated-orcid":false,"given":"Mark","family":"Minas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,28]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0304-3975(87)90102-2","volume":"55","author":"B Courcelle","year":"1987","unstructured":"Courcelle, B.: An axiomatic definition of context-free rewriting and its application to NLC graph grammars. Theoret. Comput. Sci. 55, 141\u2013181 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90102-2","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s00236-015-0223-4","volume":"52","author":"F Drewes","year":"2015","unstructured":"Drewes, F., Hoffmann, B.: Contextual hyperedge replacement. Acta Informatica 52, 497\u2013524 (2015). https:\/\/doi.org\/10.1007\/s00236-015-0223-4","journal-title":"Acta Informatica"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-34176-2_16","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"F Drewes","year":"2012","unstructured":"Drewes, F., Hoffmann, B., Minas, M.: Contextual hyperedge replacement. In: Sch\u00fcrr, A., Varr\u00f3, D., Varr\u00f3, G. (eds.) AGTIVE 2011. LNCS, vol. 7233, pp. 182\u2013197. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34176-2_16"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Drewes, F., Hoffmann, B., Minas, M.: Predictive top-down parsing for hyperedge replacement grammars. In: Parisi-Presicce, F., Westfechtel, B. (eds.) Graph Transformation - 8th International Conf., ICGT 2015. LNCS, vol.\u00a09151, pp. 19\u201334. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-21145-9_2","DOI":"10.1007\/978-3-319-21145-9_2"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.jlamp.2018.12.006","volume":"104","author":"F Drewes","year":"2019","unstructured":"Drewes, F., Hoffmann, B., Minas, M.: Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement. J. Locical Algebraic Methods Programm. (JLAMP) 104, 303\u2013341 (2019). https:\/\/doi.org\/10.1016\/j.jlamp.2018.12.006","journal-title":"J. Locical Algebraic Methods Programm. (JLAMP)"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Drewes, F., Hoffmann, B., Minas, M.: Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars. In: Gadducci, F., Kehrer, T. (eds.) Graph Transformation - 14th International Conference, ICGT 2021. LNCS, vol. 12741, pp. 164\u2013184. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-78946-6_9","DOI":"10.1007\/978-3-030-78946-6_9"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Drewes, F., Hoffmann, B., Minas, M.: Acyclic contextual hyperedge replacement: decidability of acyclicity and generative power. In: Behr, N., Str\u00fcber, D. (eds.) ICGT 2022. LNCS, vol. 13349, pp. 3\u201319. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-09843-7_1","DOI":"10.1007\/978-3-031-09843-7_1"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Drewes, F., Hoffmann, B., Minas, M.: Graph formulas and their translation to alternating graph automata. In: Endrullis, J., Tichy, M. (eds.) Graph Transformation \u2013 18th International Conference, ICGT 2025. LNCS, vol. 15720, pp. 112\u2013132. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-94706-3_6","DOI":"10.1007\/978-3-031-94706-3_6"},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Drewes, F., Hoffmann, B., Minas, M.: Systems of graph formulas and their equivalence to alternating graph automata. In: Lambers, L., Semer\u00e1th, O. (eds.) Proceedings of the Sixteenth International Workshop on Graph Computation Models (GCM 2025). EPTCS, vol.\u00a0440, pp. 123\u2013156, January 2026. https:\/\/doi.org\/10.4204\/EPTCS.440.4","DOI":"10.4204\/EPTCS.440.4"},{"issue":"10","key":"2_CR10","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/s002360050106","volume":"34","author":"J Engelfriet","year":"1997","unstructured":"Engelfriet, J., Vereijken, J.J.: Context-free graph grammars and concatenation of graphs. Acta Informatica 34(10), 773\u2013803 (1997). https:\/\/doi.org\/10.1007\/s002360050106","journal-title":"Acta Informatica"},{"key":"2_CR11","unstructured":"Flick, N.E.: Proving Correctness of Graph Programs Relative to Recursively Nested Conditions. Ph.D. thesis, University of Oldenburg, Germany (2016). https:\/\/nbn-resolving.org\/urn:nbn:de:gbv:715-oops-29769"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Gaifman, H.: On local and non-local properties. In: Stern, J. (ed.) Proc. of the Herbrand Symposium, Logic Colloquium. Studies in Logic and the Foundations of Mathematics, vol.\u00a0105, pp. 105\u2013135. North-Holland (1982). https:\/\/doi.org\/10.1016\/S0049-237X(08)71879-2","DOI":"10.1016\/S0049-237X(08)71879-2"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Habel, A.: Hyperedge Replacement: Grammars and Languages, LNCS, vol.\u00a0643. Springer (1992). https:\/\/doi.org\/10.1007\/BFb0013875","DOI":"10.1007\/BFb0013875"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-31847-7_17","volume-title":"Formal Methods in Software and Systems Modeling","author":"A Habel","year":"2005","unstructured":"Habel, A., Pennemann, K.-H.: Nested constraints and application conditions for high-level structures. In: Kreowski, H.-J., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds.) Formal Methods in Software and Systems Modeling. LNCS, vol. 3393, pp. 293\u2013308. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31847-7_17"},{"issue":"2","key":"2_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1017\/S0960129508007202","volume":"19","author":"A Habel","year":"2009","unstructured":"Habel, A., Pennemann, K.H.: Correctness of high-level transformation systems relative to nested conditions. Math. Struct. Comput. Sci. 19(2), 245\u2013296 (2009). https:\/\/doi.org\/10.1017\/S0960129508007202","journal-title":"Math. Struct. Comput. Sci."},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Habel, A., Pennemann, K., Rensink, A.: Weakest preconditions for high-level programs. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) Graph Transformations, Third International Conference, ICGT 2006, Natal, Rio Grande do Norte, Brazil, September 17-23, 2006, Proceedings. LNCS, vol.\u00a04178, pp. 445\u2013460. Springer (2006). https:\/\/doi.org\/10.1007\/11841883_31","DOI":"10.1007\/11841883_31"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Habel, A., Radke, H.: Expressiveness of graph conditions with variables. Elect. Comm. of the EASST 30 (2010). https:\/\/doi.org\/10.14279\/tuj.eceasst.30.404, International Colloquium on Graph and Model Transformation (GraMoT\u201910)","DOI":"10.14279\/tuj.eceasst.30.404"},{"issue":"5","key":"2_CR18","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/42411.42414","volume":"31","author":"D Harel","year":"1988","unstructured":"Harel, D.: On visual formalisms. Comm. ACM 31(5), 514\u2013530 (1988)","journal-title":"Comm. ACM"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Hoffmann, B., Minas, M.: Defining models \u2013 meta models versus graph grammars. Elect. Comm. of the EASST 29 (2010). https:\/\/doi.org\/10.14279\/tuj.eceasst.29.411, 6th Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT\u201910), Paphos, Cyprus","DOI":"10.14279\/tuj.eceasst.29.411"},{"key":"2_CR20","doi-asserted-by":"publisher","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. Log. Algebraic Methods Program. 118, 100616 (2021). https:\/\/doi.org\/10.1016\/j.jlamp.2020.100616","journal-title":"J. Log. Algebraic Methods Program."},{"key":"2_CR21","unstructured":"Object Management Group: OMG Unified Modeling Language (OMG UML), Version 2.5.1. https:\/\/www.omg.org\/spec\/UML\/2.5.1 (2017), OMG File ID: Formal\/2017-12-05"},{"key":"2_CR22","unstructured":"Pennemann, K.H.: Development of Correct Graph Transformation Systems. Dissertation, Carl-von-Ossietzky-Universit\u00e4t Oldenburg (2009). https:\/\/nbn-resolving.org\/urn:nbn:de:gbv:715-oops-9483"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Poskitt, C.M., Plump, D.: Verifying monadic second-order properties of graph programs. In: Giese, H., K\u00f6nig, B. (eds.) Graph Transformation - 7th International Conference, ICGT 2014. LNCS, vol.\u00a08571, pp. 33\u201348. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09108-2_3","DOI":"10.1007\/978-3-319-09108-2_3"},{"key":"2_CR24","unstructured":"Radke, H.: A Theory of HR$$^*$$ Graph Conditions and their Application to Meta-Modeling. Dissertation, Carl-von-Ossietzky-Universit\u00e4t Oldenburg, March 2016. https:\/\/nbn-resolving.org\/urn:nbn:de:gbv:715-oops-28845"}],"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-032-29730-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T04:07:14Z","timestamp":1782533234000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-29730-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032297297","9783032297303"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-29730-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"28 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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":"Rennes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/icgt-2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}