{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:37Z","timestamp":1740099037983,"version":"3.37.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319753959"},{"type":"electronic","value":"9783319753966"}],"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-75396-6_14","type":"book-chapter","created":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T21:33:53Z","timestamp":1517866433000},"page":"245-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Graph Attribution Through Sub-Graphs"],"prefix":"10.1007","author":[{"given":"Harmen","family":"Kastenberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1714-6319","authenticated-orcid":false,"given":"Arend","family":"Rensink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,7]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-540-74061-2_16","volume-title":"Static Analysis","author":"J Bauer","year":"2007","unstructured":"Bauer, J., Wilhelm, R.: Static analysis of dynamic communication systems by partner abstraction. In: Nielson, H.R., Fil\u00e9, G. (eds.) SAS 2007. LNCS, vol. 4634, pp. 249\u2013264. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74061-2_16"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Boisvert, B., F\u00e9raud, L., Soloviev, S.: Typed lambda-terms in categorical attributed graph transformation. In: Dur\u00e1n, F., Rusu, V. (eds.) Algebraic Methods in Model-based Software Engineering (AMMSE). Electr. Notes Theor. Comput. Sci., vol. 56, pp. 33\u201347 (2011)","DOI":"10.4204\/EPTCS.56.3"},{"issue":"1","key":"14_CR3","first-page":"31","volume":"74","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamental theory for typed attributed graphs and graph transformation based on adhesive HLR categories. Fund. Inf. 74(1), 31\u201361 (2006)","journal-title":"Fund. Inf."},{"key":"14_CR4","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. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-31188-2"},{"issue":"1","key":"14_CR5","first-page":"1","volume":"74","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., Padberg, J., Prange, U., Habel, A.: Adhesive high-level replacement systems: a new categorical framework for graph transformation. Fund. Inf. 74(1), 1\u201329 (2006)","journal-title":"Fund. Inf."},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-33654-6_13","volume-title":"Graph Transformations","author":"U Golas","year":"2012","unstructured":"Golas, U.: A general attribution concept for models in $${\\cal{M}}$$ M -adhesive transformation systems. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2012. LNCS, vol. 7562, pp. 187\u2013202. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33654-6_13"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Kastenberg, H.: Towards attributed graphs in GROOVE: Work in progress. In: Heckel, R., K\u00f6nig, B., Rensink, A. (eds.) Graph Transformation for Verification and Concurrency (GT-VC). Electr. Proc. Theor. Comput. Sci., vol. 154, pp. 47\u201354 (2006)","DOI":"10.1016\/j.entcs.2005.03.030"},{"key":"14_CR8","unstructured":"Kastenberg, H., Rensink, A.: Graph attribution through sub-graphs. CTIT Technical report TR-CTIT-12-27, Department of Computer Science, University of Twente (2012)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-319-61473-1_7","volume-title":"Theory and Practice of Model Transformation","author":"T Kehrer","year":"2017","unstructured":"Kehrer, T., Alshanqiti, A., Heckel, R.: Automatic inference of rule-based specifications of complex in-place model transformations. In: Guerra, E., van den Brand, M. (eds.) ICMT 2017. LNCS, vol. 10374, pp. 92\u2013107. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61473-1_7"},{"issue":"4\u20135","key":"14_CR10","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s00236-005-0180-4","volume":"42","author":"B K\u00f6nig","year":"2005","unstructured":"K\u00f6nig, B.: A general framework for types in graph rewriting. Acta Inf. 42(4\u20135), 349\u2013388 (2005)","journal-title":"Acta Inf."},{"key":"14_CR11","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":"3","key":"14_CR12","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/j.jsc.2010.09.009","volume":"46","author":"F Orejas","year":"2011","unstructured":"Orejas, F.: Symbolic graphs for attributed graph constraints. J. Symb. Comput. 46(3), 294\u2013315 (2011)","journal-title":"J. Symb. Comput."},{"key":"14_CR13","unstructured":"Orejas, F., Lambers, L.: Symbolic attributed graphs for attributed graph transformation. In: Graph and Model Transformation (GraMoT). Electr. Comm. of the EASST., vol. 30 (2010)"},{"key":"14_CR14","unstructured":"Peuser, C., Habel, A.: Composition of $$m, n$$ m , n -adhesive categories with application to attribution of graphs. In: Plump, D. (ed.) Graph Computation Models (GCM). Electr. Comm. of the EASST, vol. 73 (2015)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-540-30203-2_11","volume-title":"Graph Transformations","author":"D Plump","year":"2004","unstructured":"Plump, D., Steinert, S.: Towards graph programs for graph algorithms. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 128\u2013143. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30203-2_11"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-24725-8_28","volume-title":"Programming Languages and Systems","author":"A Rensink","year":"2004","unstructured":"Rensink, A.: Canonical graph shapes. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 401\u2013415. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24725-8_28"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-540-25959-6_40","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"A Rensink","year":"2004","unstructured":"Rensink, A.: The GROOVE simulator: a\u00a0tool for state space generation. In: Pfaltz, J.L., Nagl, M., B\u00f6hlen, B. (eds.) AGTIVE 2003. LNCS, vol. 3062, pp. 479\u2013485. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25959-6_40"},{"issue":"1","key":"14_CR18","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.entcs.2006.01.022","volume":"157","author":"A Rensink","year":"2006","unstructured":"Rensink, A., Distefano, D.: Abstract graph transformation. Electr. Notes Theor. Comput. Sci. 157(1), 39\u201359 (2006)","journal-title":"Electr. Notes Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph Transformation, Specifications, and Nets"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-75396-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T05:18:14Z","timestamp":1570684694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-75396-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319753959","9783319753966"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-75396-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}