{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:06:03Z","timestamp":1762459563430,"version":"3.37.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319747293"},{"type":"electronic","value":"9783319747309"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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-319-74730-9_8","type":"book-chapter","created":{"date-parts":[[2018,1,22]],"date-time":"2018-01-22T05:34:11Z","timestamp":1516599251000},"page":"92-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Checking Graph Programs for Confluence"],"prefix":"10.1007","author":[{"given":"Ivaylo","family":"Hristakiev","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":[[2018,1,23]]},"reference":[{"unstructured":"Bak, C.: GP 2: efficient implementation of a graph programming language. Ph.D. thesis, University of York (2015). \nhttp:\/\/etheses.whiterose.ac.uk\/id\/eprint\/12586","key":"8_CR1"},{"doi-asserted-by":"publisher","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, Second edn. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-1-84800-998-1","key":"8_CR2","DOI":"10.1007\/978-1-84800-998-1"},{"doi-asserted-by":"publisher","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science, Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/3-540-31188-2","key":"8_CR3","DOI":"10.1007\/3-540-31188-2"},{"issue":"1\u20132","key":"8_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.3233\/FI-2012-705","volume":"118","author":"H Ehrig","year":"2012","unstructured":"Ehrig, H., Golas, U., Habel, A., Lambers, L., Orejas, F.: \n            $$\\cal{M}$$\n            \n              \n                M\n              \n            \n          -adhesive transformation systems with nested application conditions: part 2: embedding, critical pairs and local confluence. Fundamenta Informaticae 118(1\u20132), 35\u201363 (2012). \nhttps:\/\/doi.org\/10.3233\/FI-2012-705","journal-title":"Fundamenta Informaticae"},{"doi-asserted-by":"publisher","unstructured":"Ehrig, H., Habel, A., Padberg, J., Prange, U.: Adhesive high-level replacement categories and systems. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 144\u2013160. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30203-2_12","key":"8_CR5","DOI":"10.1007\/978-3-540-30203-2_12"},{"doi-asserted-by":"publisher","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). \nhttps:\/\/doi.org\/10.1007\/3-540-45832-8_12","key":"8_CR6","DOI":"10.1007\/3-540-45832-8_12"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-33654-6_15","volume-title":"Graph Transformations","author":"A Habel","year":"2012","unstructured":"Habel, A., Plump, D.: \n            $$\\cal{M}, \\cal{N}$$\n            \n              \n                \n                  M\n                  ,\n                  N\n                \n              \n            \n          -adhesive transformation systems. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2012. LNCS, vol. 7562, pp. 218\u2013233. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-33654-6_15"},{"unstructured":"Hristakiev, I.: Confluence analysis for a graph programming language. Ph.D. thesis, University of York (2017, to appear)","key":"8_CR8"},{"doi-asserted-by":"publisher","unstructured":"Hristakiev, I., Plump, D.: A unification algorithm for GP 2. In: Graph Computation Models (GCM 2014), Revised Selected Papers. Electronic Communications of the EASST, vol. 71 (2015). \nhttps:\/\/doi.org\/10.14279\/tuj.eceasst.71.1002","key":"8_CR9","DOI":"10.14279\/tuj.eceasst.71.1002"},{"doi-asserted-by":"publisher","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, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-50230-4_11","key":"8_CR10","DOI":"10.1007\/978-3-319-50230-4_11"},{"unstructured":"Hristakiev, I., Plump, D.: Checking graph programs for confluence (long version) (2017). \nhttps:\/\/www.cs.york.ac.uk\/plasma\/publications\/pdf\/HristakievPlump.GCM17.Long.pdf","key":"8_CR11"},{"doi-asserted-by":"publisher","unstructured":"Hristakiev, I., Plump, D.: Towards critical pair analysis for the graph programming language GP 2. In: James, P., Roggenbach, M. (eds.) WADT 2016. LNCS, vol. 10644, pp. 153\u2013169. Springer, Heidelberg (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-72044-9_11\n\n. Long version available at: \nhttps:\/\/www.cs.york.ac.uk\/plasma\/publications\/pdf\/HristakievPlump.WADT16.Long.pdf","key":"8_CR12","DOI":"10.1007\/978-3-319-72044-9_11"},{"doi-asserted-by":"publisher","unstructured":"Kroening, D., Strichman, O.: Decision Procedures - An Algorithmic Point of View. Texts in Theoretical Computer Science, Springer, Second edn. (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-50497-0","key":"8_CR13","DOI":"10.1007\/978-3-662-50497-0"},{"doi-asserted-by":"publisher","unstructured":"Kulcs\u00e1r, G., Deckwerth, F., Lochau, M., Varr\u00f3, G., Sch\u00fcrr, A.: Improved conflict detection for graph transformation with attributes. In: Rensink, A., Zambon, E. (eds.) Proceedings of Graphs as Models (GaM 2015). Electronic Proceedings in Theoretical Computer Science, vol. 181, pp. 97\u2013112 (2015). \nhttps:\/\/doi.org\/10.4204\/EPTCS.181.7","key":"8_CR14","DOI":"10.4204\/EPTCS.181.7"},{"doi-asserted-by":"publisher","unstructured":"de Moura, L.M., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-78800-3_24\n\n, \nhttps:\/\/github.com\/Z3Prover\/z3","key":"8_CR15","DOI":"10.1007\/978-3-540-78800-3_24"},{"issue":"1\u20132","key":"8_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.3233\/FI-2012-706","volume":"118","author":"F Orejas","year":"2012","unstructured":"Orejas, F., Lambers, L.: Lazy graph transformation. Fundamenta Informaticae 118(1\u20132), 65\u201396 (2012). \nhttps:\/\/doi.org\/10.3233\/FI-2012-706","journal-title":"Fundamenta Informaticae"},{"doi-asserted-by":"publisher","unstructured":"Plump, D.: Confluence of graph transformation revisited. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday. LNCS, vol. 3838, pp. 280\u2013308. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11601548_16","key":"8_CR17","DOI":"10.1007\/11601548_16"},{"doi-asserted-by":"publisher","unstructured":"Plump, D.: The design of GP 2. In: Escobar, S. (ed.) Proceedings of International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2011). Electronic Proceedings in Theoretical Computer Science, vol. 82, pp. 1\u201316 (2012). \nhttps:\/\/doi.org\/10.4204\/EPTCS.82.1","key":"8_CR18","DOI":"10.4204\/EPTCS.82.1"}],"container-title":["Lecture Notes in Computer Science","Software Technologies: Applications and Foundations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-74730-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,22]],"date-time":"2018-01-22T05:39:23Z","timestamp":1516599563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-74730-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319747293","9783319747309"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74730-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}