{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T23:42:37Z","timestamp":1725925357884},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319720432"},{"type":"electronic","value":"9783319720449"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-72044-9_11","type":"book-chapter","created":{"date-parts":[[2017,12,7]],"date-time":"2017-12-07T09:14:43Z","timestamp":1512638083000},"page":"153-169","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Towards Critical Pair Analysis for the Graph Programming Language GP 2"],"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":[[2017,12,8]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/B978-044450813-3\/50010-2","volume-title":"Handbook of Automated Reasoning","author":"F Baader","year":"2001","unstructured":"Baader, F., Snyder, W.: Unification theory. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. 2, pp. 445\u2013532. Elsevier and MIT Press, Amsterdam and Cambridge (2001)"},{"key":"11_CR2","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"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"RJ Duffin","year":"1965","unstructured":"Duffin, R.J.: Topology of series-parallel networks. J. Math. Anal. Appl. 10(2), 303\u2013318 (1965). \nhttps:\/\/doi.org\/10.1016\/0022-247X(65)90125-3","journal-title":"J. Math. Anal. Appl."},{"key":"11_CR4","series-title":"Monographs in Theoretical Computer Science","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. Monographs in Theoretical Computer Science. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/3-540-31188-2"},{"issue":"1\u20132","key":"11_CR5","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          -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"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-30203-2_13","volume-title":"Graph Transformations","author":"H Ehrig","year":"2004","unstructured":"Ehrig, H., Prange, U., Taentzer, G.: Fundamental theory for typed attributed graph transformation. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 161\u2013177. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30203-2_13"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.tcs.2012.01.032","volume":"424","author":"U Golas","year":"2012","unstructured":"Golas, U., Lambers, L., Ehrig, H., Orejas, F.: Attributed graph transformation with inheritance: efficient conflict detection and local confluence analysis using abstract critical pairs. TCS 424, 46\u201368 (2012). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2012.01.032","journal-title":"TCS"},{"key":"11_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). \nhttps:\/\/doi.org\/10.1007\/3-540-45832-8_12"},{"key":"11_CR9","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          -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"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-45832-8_14","volume-title":"Graph Transformation","author":"R Heckel","year":"2002","unstructured":"Heckel, R., K\u00fcster, J.M., Taentzer, G.: Confluence of typed attributed graph transformation systems. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol. 2505, pp. 161\u2013176. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-45832-8_14"},{"key":"11_CR11","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). \nhttp:\/\/journal.ub.tu-berlin.de\/eceasst\/article\/view\/1002\n\n, \nhttps:\/\/doi.org\/10.14279\/tuj.eceasst.71.1002","DOI":"10.14279\/tuj.eceasst.71.1002"},{"key":"11_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 Collocated Workshops, Revised Selected Papers. LNCS, vol. 9946, pp. 145\u2013160. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-50230-4_11"},{"key":"11_CR13","unstructured":"Hristakiev, I., Plump, D.: Towards critical pair analysis for the graph programming language GP 2 (long version) (2017). \nhttps:\/\/www.cs.york.ac.uk\/plasma\/publications\/pdf\/HristakievPlump.WADT16.Long.pdf"},{"key":"11_CR14","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: Proceedings of Graphs as Models, GaM 2015, EPTCS, vol. 181, pp. 97\u2013112 (2015). \nhttps:\/\/doi.org\/10.4204\/EPTCS.181.7","DOI":"10.4204\/EPTCS.181.7"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11601548_16","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity","author":"D Plump","year":"2005","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. LNCS, vol. 3838, pp. 280\u2013308. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11601548_16"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Plump, D.: The design of GP 2. In: Proceedings of International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2011, EPTCS, vol. 82, pp. 1\u201316 (2012). \nhttps:\/\/doi.org\/10.4204\/EPTCS.82.1","DOI":"10.4204\/EPTCS.82.1"}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Algebraic Development Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72044-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,7]],"date-time":"2017-12-07T09:18:20Z","timestamp":1512638300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72044-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319720432","9783319720449"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72044-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}