{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T19:59:08Z","timestamp":1648670348132},"reference-count":24,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4288,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s1571-0661(04)00294-4","type":"journal-article","created":{"date-parts":[[2004,2,5]],"date-time":"2004-02-05T10:34:35Z","timestamp":1075977275000},"page":"305-319","source":"Crossref","is-referenced-by-count":0,"title":["Transformation of Shaped Nested Graphs and Diagrams1 1This work has been partially supported by the ESPRIT Working Group Applications of Graph Transformation (Appligraph)."],"prefix":"10.1016","volume":"59","author":[{"given":"Berthold","family":"Hoffmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Minas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00294-4_NEWBIB1","doi-asserted-by":"crossref","unstructured":"R. Bardohl, M. Minas, A. Sch\u00fcrr, and G. Taentzer. Application of graph transformation to visual languages. In Engels et al. [6], chapter 3, pages 105\u2013180.","DOI":"10.1142\/9789812815149_0003"},{"key":"10.1016\/S1571-0661(04)00294-4_NEWBIB2","unstructured":"G. Busatto and B. Hoffmann. Comparing notions of hierarchical graph transformation. Electronic Notes in Theoretical Computer Science, 2001. to appear."},{"key":"10.1016\/S1571-0661(04)00294-4_NEWBIB3","unstructured":"G. Busatto, H.-J. Kreowski, and S. Kuske. An abstract hierarchical graph data model. Technical report, Fachbereich Mathematik-Informatik, Universit\u00e4t Bremen, to appear 2001."},{"key":"10.1016\/S1571-0661(04)00294-4_NEWBIB4","doi-asserted-by":"crossref","unstructured":"F. Drewes, A. Habel, and H.-J. Kreowski. Hyperedge replacement graph grammars. In Rozenberg [21], chapter 2, pages 95\u2013162.","DOI":"10.1142\/9789812384720_0002"},{"key":"10.1016\/S1571-0661(04)00294-4_NEWBIB5","doi-asserted-by":"crossref","unstructured":"F. Drewes, B. Hoffmann, and D. Plump. Hierarchical graph transformation. Journal of Computer and System Sciences, to appear 2001. (A short version appeared in number 1784 of Lecture Notes in Computer Science, pages 98\u2013113, 2000).","DOI":"10.1007\/3-540-46432-8_7"},{"key":"10.1016\/S1571-0661(04)00294-4_NEWBIB6","series-title":"Handbook of Graph Grammars and Computing by Graph Transformation, Vol. II: Specification and Programming","year":"1999"},{"key":"10.1016\/S1571-0661(04)00294-4_NEWBIB7","doi-asserted-by":"crossref","unstructured":"G. Engels and R. Heckel. Graph transformation as a conceptual and formal framework for system modelling and evolution. In U. Montanari, J. Rolim, and E. Welz, editors, Automata, Languages, and Programming (ICALP 2000 Proc.), number 1853 in Lecture Notes in Computer Science, pages 127\u2013150. Springer, 2000.","DOI":"10.1007\/3-540-45022-X_12"},{"key":"10.1016\/S1571-0661(04)00294-4_NEWBIB8","doi-asserted-by":"crossref","unstructured":"R. Farrow, K. Kennedy, and L. Zucconi. Graph grammars and global program data flow analysis. In Proc. 17th Annual IEEE Symposium on Foundations of Computer Science, pages 42\u201356, Houston, Texas, 1976.","DOI":"10.1109\/SFCS.1976.17"},{"issue":"2\/3","key":"10.1016\/S1571-0661(04)00294-4_NEWBIB9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0167-6423(97)00023-3","article-title":"Structured Gamma","volume":"31","author":"Fradet","year":"1998","journal-title":"Science of Computer Programming"},{"key":"10.1016\/S1571-0661(04)00294-4_NEWBIB10","doi-asserted-by":"crossref","unstructured":"B. Hoffmann. From graph transformation to rule-based programming with diagrams. In M. Nagl, A. Sch\u00fcrr and M. M\u00fcnch, editors, Int'l Workshop on Applications of Graph Transformations with Industrial Relevance (Agtive'99), Selected Papers, number 1779 in Lecture Notes in Computer Science, pages 165\u2013180. Springer, 2000.","DOI":"10.1007\/3-540-45104-8_12"},{"key":"10.1016\/S1571-0661(04)00294-4_NEWBIB11","doi-asserted-by":"crossref","unstructured":"B. Hoffmann. Shapely hierarchical graph transformation. In Int'l Symposium on Visual Languages and Formal Methods. IEEE Computer Press, to appear 2001.","DOI":"10.1109\/HCC.2001.995230"},{"key":"10.1016\/S1571-0661(04)00294-4_NEWBIB12","unstructured":"B. Hoffmann and M. Minas. A generic model for diagram syntax and semantics. In J. D. P. Polim et al., editors, ICALP Workshops 2000, number 8 in Proceedings in Informatics, pages 443\u2013450, Waterloo, Ontario, Canada, 2000. Carleton Scientific."},{"issue":"4","key":"10.1016\/S1571-0661(04)00294-4_NEWBIB13","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent reductions: Abstract properties and applications to term rewriting systems","volume":"27","author":"Huet","year":"1980","journal-title":"Journal of the ACM"},{"issue":"1","key":"10.1016\/S1571-0661(04)00294-4_NEWBIB14","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1006\/inco.1995.1075","article-title":"de Vries. Transfinite reductions in orthogonal term rewriting systems","volume":"119","author":"Kennaway","year":"1995","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)00294-4_NEWBIB15","series-title":"Handbook of Logic in Computer Science, volume 2","first-page":"1","article-title":"Term rewriting systems","author":"Klop","year":"1992"},{"key":"10.1016\/S1571-0661(04)00294-4_NEWBIB16","doi-asserted-by":"crossref","unstructured":"M. Minas. Concepts and realization of a diagram editor generator based on hypergraph transformation. Science of Computer Programming, to appear 2001.","DOI":"10.1016\/S0167-6423(02)00037-0"},{"key":"10.1016\/S1571-0661(04)00294-4_NEWBIB17","series-title":"\u201cAutomaten und Formale Sprachen\u201d","article-title":"Church-Rosser hypergraph languages. Talk at the Workshop","author":"Plump","year":"1999"},{"key":"10.1016\/S1571-0661(04)00294-4_NEWBIB18","doi-asserted-by":"crossref","unstructured":"D. Plump. Term graph rewriting. In Engels et al. [6], chapter 1, pages 3\u2013102.","DOI":"10.1142\/9789812815149_0001"},{"key":"10.1016\/S1571-0661(04)00294-4_NEWBIB19","doi-asserted-by":"crossref","unstructured":"D. Plump and A. Habel. Graph unification and matching. In J. E. Cuny, H. Ehrig, G. Engels, and G. Rozenberg, editors, Proc. Graph Grammars and Their Application to Computer Science, number 1073 in Lecture Notes in Computer Science, pages 75\u201389. Springer, 1996.","DOI":"10.1007\/3-540-61228-9_80"},{"key":"10.1016\/S1571-0661(04)00294-4_NEWBIB20","doi-asserted-by":"crossref","unstructured":"T. W. Pratt. Definition of programming language semantics using grammars for hierarchical graphs. In V. Claus, H. Ehrig, and G. Rozenberg, editors, Proc. Graph Grammars and Their Application to Computer Science and Biology, number 73 in Lecture Notes in Computer Science, pages 389\u2013400. Springer, 1979.","DOI":"10.1007\/BFb0025735"},{"key":"10.1016\/S1571-0661(04)00294-4_NEWBIB21","series-title":"Handbook of Graph Grammars and Computing by Graph Transformation Vol. I: Foundations","year":"1997"},{"key":"10.1016\/S1571-0661(04)00294-4_NEWBIB22","series-title":"Object Technology Series","article-title":"The Unified Modeling Language Reference Manual","author":"Rumbaugh","year":"1999"},{"issue":"1","key":"10.1016\/S1571-0661(04)00294-4_NEWBIB23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/271510.271517","article-title":"Solving shape-analysis problems in languages with destructive updating","volume":"20","author":"Sagiv","year":"1998","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(04)00294-4_NEWBIB24","doi-asserted-by":"crossref","unstructured":"A. Sch\u00fcrr, A. Winter, and A. Z\u00fcndorf. The Progres approach: Language and environment. In Rozenberg [21], chapter 13, pages 487\u2013550.","DOI":"10.1142\/9789812815149_0013"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104002944?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104002944?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T12:27:54Z","timestamp":1585571274000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104002944"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S1571066104002944"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00294-4","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}