{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T11:54:34Z","timestamp":1769514874484,"version":"3.49.0"},"reference-count":116,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5221,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1999,4]]},"DOI":"10.1016\/s0167-6423(98)00023-9","type":"journal-article","created":{"date-parts":[[2002,10,31]],"date-time":"2002-10-31T21:12:04Z","timestamp":1036098724000},"page":"1-54","source":"Crossref","is-referenced-by-count":96,"title":["Graph transformation for specification and programming"],"prefix":"10.1016","volume":"34","author":[{"given":"Marc","family":"Andries","sequence":"first","affiliation":[]},{"given":"Gregor","family":"Engels","sequence":"additional","affiliation":[]},{"given":"Annegret","family":"Habel","sequence":"additional","affiliation":[]},{"given":"Berthold","family":"Hoffmann","sequence":"additional","affiliation":[]},{"given":"Hans-J\u00f6rg","family":"Kreowski","sequence":"additional","affiliation":[]},{"given":"Sabine","family":"Kuske","sequence":"additional","affiliation":[]},{"given":"Detlef","family":"Plump","sequence":"additional","affiliation":[]},{"given":"Andy","family":"Sch\u00fcrr","sequence":"additional","affiliation":[]},{"given":"Gabriele","family":"Taentzer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6423(98)00023-9_BIB1","article-title":"Graph rewrite systems and visual database languages","author":"Andries","year":"1996"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB2","series-title":"Proc. Graph Transformations in Computer Science","first-page":"19","article-title":"Syntax and semantics of hybrid database languages","volume":"Vol. 776","author":"Andries","year":"1994"},{"issue":"3","key":"10.1016\/S0167-6423(98)00023-9_BIB3","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1006\/jvlc.1996.0017","article-title":"A hybrid query language for the extended entity relationship model","volume":"7","author":"Andries","year":"1996","journal-title":"J. Visual Languages Comput."},{"issue":"10","key":"10.1016\/S0167-6423(98)00023-9_BIB4","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1109\/32.60295","article-title":"QBD\u2217: A graphical query language with recursion","volume":"16","author":"Angelaccio","year":"1990","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.3233\/FI-1996-263401","article-title":"Equational term graph rewriting","volume":"26","author":"Ariola","year":"1996","journal-title":"Fund. Inform."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB6","article-title":"Bisimilarity in term graph rewriting","author":"Ariola","year":"1998","journal-title":"Inform. Comput."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB7","series-title":"Proc. Typed Lambda Calculi and Applications","first-page":"1","article-title":"Comparing \u03bb-calculus translations in sharing graphs","volume":"Vol. 902","author":"Asperti","year":"1995"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB8","series-title":"Term Rewriting and All That","author":"Baader","year":"1998"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB9","series-title":"Proc. Parallel Architectures and Languages Europe","first-page":"141","article-title":"Term graph rewriting","volume":"Vol. 259","author":"Barendregt","year":"1987"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB10","series-title":"Proc. Graph Grammars and Their Application to Computer Science and Biology","first-page":"155","article-title":"Programmed graph grammars","volume":"Vol. 73","author":"Bunke","year":"1979"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB11","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF02249935","article-title":"On the generative power of sequential and parallel programmed graph grammars","volume":"29","author":"Bunke","year":"1982","journal-title":"Computing"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB12","series-title":"Proc. Graph Grammars and Their Application to Computer Science","first-page":"174","article-title":"An efficient implementation of graph grammars based on the RETE matching algorithm","volume":"Vol. 532","author":"Bunke","year":"1991"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB13","series-title":"Proc. Graph Grammars and Their Application to Computer Science and Biology","volume":"Vol. 73","year":"1979"},{"issue":"2","key":"10.1016\/S0167-6423(98)00023-9_BIB14","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1145\/170036.171537","article-title":"Hy+: a hygraph-based query and visualization system","volume":"22","author":"Consens","year":"1993","journal-title":"SIGMOD RECORD"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB15","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB16","series-title":"Electronic Notes in Theoretical Computer Science","article-title":"A compositional approach to structuring and refinement of typed graph grammars","volume":"Vol. 2","author":"Corradini","year":"1995"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB17","series-title":"Proc. Joint COMPUGRAPH\/SEMAGRAPH Workshop on Graph Rewriting and Computation","volume":"2","year":"1995"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB18","doi-asserted-by":"crossref","first-page":"241","DOI":"10.3233\/FI-1996-263402","article-title":"Graph processes","volume":"26","author":"Corradini","year":"1996","journal-title":"Fund. Inform."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB19","series-title":"Proc. Graph Grammars and Their Application to Computer Science","first-page":"221","article-title":"Graph grammars and logic programming","volume":"Vol. 532","author":"Corradini","year":"1991"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB20","series-title":"Handbook of Graph Grammars and Computing by Graph Transformations","first-page":"163","article-title":"Algebraic approaches to graph transformation \u2014 Part I: Basic concepts and double pushout approach","volume":"Vol. I","author":"Corradini","year":"1997"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB21","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0304-3975(93)90063-Y","article-title":"Hyperedge replacement jungle rewriting for term rewriting systems and logic programming","volume":"109","author":"Corradini","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB22","series-title":"Proc. Graph Transformations in Computer Science","first-page":"119","article-title":"Jungle rewriting: an abstract description of a lazy narrowing machine","volume":"Vol. 776","author":"Corradini","year":"1994"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB23","first-page":"193","article-title":"Graph rewriting: An algebraic and logical approach","volume":"Vol. B","author":"Courcelle","year":"1990"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB24","series-title":"Proc. Graph Grammars and Their Application to Computer Science","volume":"Vol. 1073","year":"1996"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB25","article-title":"Regulated Rewriting in Formal Language Theory","volume":"Vol. 18","author":"Dassow","year":"1989"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB26","series-title":"4. Jahrestagung der Gesellschaft f\u00fcr Informatik","first-page":"202","article-title":"PLAN2D \u2014 towards a two-dimensional programming language","volume":"Vol. 26","author":"Denert","year":"1975"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB27","first-page":"243","article-title":"Rewrite systems","volume":"Vol. B","author":"Dershowitz","year":"1990"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB28","series-title":"Proc. Graph Grammars and Their Application to Computer Science and Biology","first-page":"1","article-title":"Introduction to the algebraic theory of graph grammars","volume":"Vol. 73","author":"Ehrig","year":"1979"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB29","series-title":"Proc. Graph Grammars and Their Application to Computer Science","first-page":"137","article-title":"Pragmatic and semantic aspects of a module concept for graph transformation systems","volume":"Vol. 1073","author":"Ehrig","year":"1996"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB30","first-page":"87","article-title":"Graph grammars with application conditions","author":"Ehrig","year":"1986"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB31","series-title":"Handbook of Graph Grammars and Computing by Graph Transformations","first-page":"247","article-title":"Algebraic approaches to graph transformation \u2014 Part II: Single pushout approach and comparison with double pushout approach","volume":"Vol. I","author":"Ehrig","year":"1997"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB32","series-title":"Proc. Mathematical Foundations of Computer Science","first-page":"284","article-title":"Parallelism of manipulations in multidimensional information structures","volume":"Vol. 45","author":"Ehrig","year":"1976"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB33","series-title":"Proc. Graph Grammars and Their Application to Computer Science","volume":"Vol. 532","year":"1991"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB34","series-title":"Proc. Graph Grammars and Their Application to Computer Science","volume":"Vol. 153","year":"1983"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB35","series-title":"Proc. Graph Grammars and Their Application to Computer Science","volume":"Vol. 291","year":"1987"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB36","series-title":"IEEE Conf. on Automata and Switching Theory","first-page":"167","article-title":"Graph grammars: An algebraic approach","author":"Ehrig","year":"1973"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB37","series-title":"Handbook of Graph Grammars and Computing by Graph Transformations","first-page":"1","article-title":"Node replacement graph grammars","volume":"Vol. I","author":"Engelfriet","year":"1997"},{"issue":"2","key":"10.1016\/S0167-6423(98)00023-9_BIB38","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0169-023X(92)90008-Y","article-title":"Conceptual modelling of database applications using an extended ER model","volume":"9","author":"Engels","year":"1992","journal-title":"Data Knowledge Eng."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB39","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1145\/128894.128895","article-title":"Building integrated software developments, part I: Tool specification","volume":"1","author":"Engels","year":"1992","journal-title":"ACM Trans. Software Eng. Methodol."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB40","series-title":"Proc. Joint COMPUGRAPH\/SEMAGRAPH Workshop on Graph Rewriting and Computation","article-title":"Hierarchical graphs, graph types and meta types","volume":"Vol. 2","author":"Engels","year":"1995"},{"issue":"4","key":"10.1016\/S0167-6423(98)00023-9_BIB41","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1142\/S0129054190000266","article-title":"Redex capturing in term graph rewriting","volume":"1","author":"Farmer","year":"1990","journal-title":"Internat. J. Foundations Comput. Sci."},{"issue":"2","key":"10.1016\/S0167-6423(98)00023-9_BIB42","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/170036.171533","article-title":"GOOD: A graph-oriented object database system","volume":"22","author":"Gemis","year":"1993","journal-title":"SIGMOD RECORD"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/BFb0017401","article-title":"Dactl: An experimental graph rewriting language","volume":"Vol. 532","author":"Glauert","year":"1991"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB44","series-title":"Proc. Graph Reduction","first-page":"53","article-title":"Concurrent term rewriting as a model of computation","volume":"Vol. 279","author":"Goguen","year":"1987"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB45","article-title":"Graphgrammatiken in der Softwaretechnik","volume":"Vol. 178","author":"G\u00f6ttler","year":"1988"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB46","article-title":"Hyperedge Replacement: Grammars and Languages","volume":"Vol. 643","author":"Habel","year":"1992"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB47","doi-asserted-by":"crossref","first-page":"287","DOI":"10.3233\/FI-1996-263404","article-title":"Graph grammars with negative application conditions","volume":"26","author":"Habel","year":"1996","journal-title":"Fund. Inform."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB48","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0304-3975(87)90050-8","article-title":"Characteristics of graph languages generated by edge replacement","volume":"51","author":"Habel","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB49","first-page":"37","article-title":"Jungle evaluation","volume":"15","author":"Habel","year":"1991","journal-title":"Fund. Inform."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB50","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1017\/S0960129500070122","article-title":"Term graph narrowing","volume":"6","author":"Habel","year":"1996","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB51","series-title":"Proc. Joint COMPUGRAPH\/SEMAGRAPH Workshop on Graph Rewriting and Computation","article-title":"Ensuring consistency of conditional graph grammars \u2014 a constructive approach","volume":"Vol. 2","author":"Heckel","year":"1995"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB52","series-title":"Proc. Graph Grammars and Their Application to Computer Science","first-page":"61","article-title":"Graphed: An interactive tool for developing graph grammars","volume":"Vol. 532","author":"Himsolt","year":"1991"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB53","series-title":"Proc. 3rd Internat. Conf. on Algebraic and Logic Programming (ALP'92)","first-page":"128","article-title":"Term rewriting with sharing and memo\u00efzation","volume":"Vol. 632","author":"Hoffmann","year":"1992"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB54_1","series-title":"Proc. Algebraic and Logic Programming","first-page":"191","article-title":"Jungle evaluation for efficient term rewriting","volume":"Vol. 49","author":"Hoffmann","year":"1988"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB54_2","first-page":"191","volume":"Vol. 343","author":"Hoffmann","year":"1989"},{"issue":"5","key":"10.1016\/S0167-6423(98)00023-9_BIB55","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1051\/ita\/1991250504451","article-title":"Implementing term rewriting by jungle evaluation","volume":"25","author":"Hoffmann","year":"1991","journal-title":"RAIRO Theoret. Inform. Appl."},{"issue":"3","key":"10.1016\/S0167-6423(98)00023-9_BIB56","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0306-4379(92)90014-E","article-title":"SQL\/EER \u2014 syntax and semantics of an entity-relationship-based query language","volume":"17","author":"Hohenstein","year":"1992","journal-title":"Inform. Systems"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB57","series-title":"IFIP Conf. on Funct. Lang. and Comp. Arch.","first-page":"129","article-title":"Lazy memo functions","volume":"Vol. 201","author":"Hughes","year":"1985"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB58","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0255(80)90038-9","article-title":"On the structure of node-label-controlled graph languages","volume":"20","author":"Janssens","year":"1980","journal-title":"Inform. Sci."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB59","series-title":"Proc. Programming Language Implementation and Logic Programming","first-page":"115","article-title":"Unlimp: Uniqueness as a leitmotiv for implementation","volume":"Vol. 631","author":"Kahrs","year":"1992"},{"issue":"3","key":"10.1016\/S0167-6423(98)00023-9_BIB60","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1145\/177492.177577","article-title":"On the adequacy of graph rewriting for simulating term rewriting","volume":"16","author":"Kennaway","year":"1994","journal-title":"ACM Trans. Programm. Languages Systems"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB61","first-page":"21","article-title":"GRAS, a graph-oriented (software) engineering database system","volume":"20","author":"Kiesel","year":"1995","journal-title":"Inform. Sci."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB62","first-page":"1","article-title":"Term rewriting systems","volume":"Vol. 2","author":"Klop","year":"1992"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB63","series-title":"Proc. Graph Grammars and Their Application to Computer Science","first-page":"343","article-title":"Is parallelism already concurrency? Part 1: Derivations in graph grammars","volume":"Vol. 291","author":"Kreowski","year":"1987"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB64","series-title":"Proc. Fundamentals of Computation Theory","first-page":"69","article-title":"Five facets of hyperedge replacement beyond context-freeness","volume":"Vol. 710","author":"Kreowski","year":"1993"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB65","series-title":"Proc. Graph Grammars and Their Application to Computer Science","first-page":"89","article-title":"On the interleaving semantics of transformation units \u2014 a step into GRACE","volume":"Vol. 1073","author":"Kreowski","year":"1996"},{"issue":"4","key":"10.1016\/S0167-6423(98)00023-9_BIB66","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1142\/S0218194097000278","article-title":"Nested graph transformation units","volume":"7","author":"Kreowski","year":"1998","journal-title":"Internat. J. Software Eng. Knowledge Eng."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB67_1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0255(90)90042-9","article-title":"On structured graph grammars, I and II","volume":"52","author":"Kreowski","year":"1990","journal-title":"Inform. Sci."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB67_2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0020-0255(90)90044-B","article-title":"On structured graph grammars, I and II","volume":"52","author":"Kreowski","year":"1990","journal-title":"Inform. Sci."},{"issue":"1","key":"10.1016\/S0167-6423(98)00023-9_BIB68","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0304-3975(94)00248-3","article-title":"Modularity in noncopying term rewriting","volume":"152","author":"Kurihara","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB69","series-title":"Proc. 17th Symp. on Principles of Programming Languages","first-page":"16","article-title":"An algorithm for optimal lambda calculus reduction","author":"Lamping","year":"1990"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB70","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0304-3975(93)90116-B","article-title":"Computing with graph rewriting systems with priorities","volume":"115","author":"Litovsky","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB71","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(93)90068-5","article-title":"Algebraic approach to single-pushout graph transformation","volume":"109","author":"L\u00f6we","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB72","series-title":"Proc. Rewriting Techniques and Applications","first-page":"451","article-title":"AGG \u2014 an implementation of algebraic graph rewriting","volume":"Vol. 690","author":"L\u00f6we","year":"1993"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB73","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s002360050056","article-title":"A kernel language for programmed rewriting of (hyper)graphs","volume":"33","author":"Maggiolo-Schettini","year":"1996","journal-title":"Acta Inform"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB74","series-title":"Proc. Graph Grammars and Their Application to Computer Science","first-page":"41","article-title":"Set theoretic approaches to graph grammars","volume":"Vol. 291","author":"Nagl","year":"1987"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB75","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0304-3975(82)90056-1","article-title":"Graph grammars and operational semantics","volume":"19","author":"Padawitz","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB76","series-title":"The Implementation of Functional Programming Languages","author":"Jones","year":"1987"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB77","series-title":"Proc. Internat. Joint Conf. on Artificial Intelligence","first-page":"609","article-title":"Web grammars","author":"Pfaltz","year":"1969"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB78","series-title":"Functional Programming and Parallel Graph Rewriting","author":"Plasmeijer","year":"1993"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB79","series-title":"Proc. Graph Grammars and Their Application to Computer Science","first-page":"622","article-title":"Graph-reducible term rewriting systems","volume":"Vol. 532","author":"Plump","year":"1991"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB80","series-title":"Proc. Conditional and Typed Rewriting Systems","first-page":"307","article-title":"Implementing term rewriting by graph reduction: Termination of combined systems","volume":"Vol. 516","author":"Plump","year":"1991"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB81","series-title":"Term Graph Rewriting, Theory and Practice","first-page":"201","article-title":"Hypergraph rewriting: Critical pairs and undecidability of confluence","author":"Plump","year":"1993"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB82","series-title":"Proc. Conditional Term Rewriting Systems","first-page":"97","article-title":"Collapsed tree rewriting: Completeness, confluence, and modularity","volume":"Vol. 656","author":"Plump","year":"1993"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB83","article-title":"Evaluation of functional expressions by hypergraph rewriting","author":"Plump","year":"1993"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB84","series-title":"Proc. Mathematical Foundations of Computer Science 1994","first-page":"556","article-title":"Critical pairs in term graph rewriting","volume":"Vol. 841","author":"Plump","year":"1994"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB85","series-title":"Proc. Graph-Theoretic Concepts in Computer Science","first-page":"88","article-title":"On termination of graph rewriting","volume":"Vol. 1017","author":"Plump","year":"1995"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB86","series-title":"Proc. Mathematical Foundations of Computer Science 1997","first-page":"458","article-title":"Simplification orders for term graph rewriting","volume":"Vol. 1295","author":"Plump","year":"1997"},{"issue":"2","key":"10.1016\/S0167-6423(98)00023-9_BIB87","doi-asserted-by":"crossref","first-page":"201","DOI":"10.3233\/FI-1998-33204","article-title":"Termination of graph rewriting is undecidable","volume":"33","author":"Plump","year":"1998","journal-title":"Fund. Inform."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB88","series-title":"Proc. Graph Grammars and Their Application to Computer Science","first-page":"75","article-title":"Graph unification and matching","volume":"Vol. 1073","author":"Plump","year":"1996"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB89","series-title":"ACM SIGPLAN Symp. on Prog. Lang. Def.","article-title":"Semantic modeling by hierarchical graphs","author":"Pratt","year":"1969"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB90","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1016\/S0022-0000(71)80016-8","article-title":"Pair grammars, graph languages and string-to-graph translations","volume":"5","author":"Pratt","year":"1971","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB91","series-title":"Proc. Mathematical Foundations of Computer Science","first-page":"371","article-title":"Graph reducibility of term rewriting systems","volume":"Vol. 969","author":"Rao","year":"1995"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB92","series-title":"Proc. Rewriting Techniques and Applications","first-page":"230","article-title":"Modularity of termination in term graph rewriting","volume":"Vol. 1103","author":"Rao","year":"1996"},{"issue":"1","key":"10.1016\/S0167-6423(98)00023-9_BIB93","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1006\/jvlc.1996.0027","article-title":"Defining and parsing visual languages with layered graph grammars","volume":"8","author":"Rekers","year":"1997","journal-title":"J. Visual Languages Comput."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB94","first-page":"307","article-title":"Web automata and web grammars","volume":"7","author":"Rosenfeld","year":"1972","journal-title":"Mach. Intell."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB95","series-title":"Proc. Graph Grammars and Their Application to Computer Science","first-page":"55","article-title":"An introduction to the NLC way of rewriting graphs","volume":"Vol. 291","author":"Rozenberg","year":"1987"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB96","series-title":"Handbook of Graph Grammars and Computing by Graph Transformations","volume":"Vol. I","year":"1997"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB97","article-title":"Chomsky-Systeme f\u00fcr partielle Ordnungen","author":"Schneider","year":"1970"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB98","article-title":"Formal systems for structure manipulations","author":"Schneider","year":"1971"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB99","series-title":"Proc. Graph Transformations in Computer Science","volume":"Vol. 776","year":"1994"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB100","series-title":"Proc. Graph-Theoretic Concepts in Computer Science","first-page":"151","article-title":"Introduction to PROGRES, an attribute graph grammar based specification language","volume":"Vol. 411","author":"Sch\u00fcrr","year":"1990"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB101","series-title":"Anwendungsbeispiele und Werkzeugunterst\u00fctzung","article-title":"Operationales Spezifizieren mit programmierten Graphersetzungssystemen: formale Definitionen","author":"Sch\u00fcrr","year":"1991"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB102","series-title":"Proc. Graph Grammars and Their Application to Computer Science","first-page":"641","article-title":"PROGRES: A VHL-language based on graph grammars","volume":"Vol. 532","author":"Sch\u00fcrr","year":"1991"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB103","series-title":"Proc. USENIX Symp. Very High Level Languages (VHLL)","first-page":"83","article-title":"Rapid programming with graph rewrite rules","author":"Sch\u00fcrr","year":"1994"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB104","series-title":"Handbook of Graph Grammars and Computing by Graph Transformations","first-page":"479","article-title":"Programmed graph replacement systems","volume":"Vol. I","author":"Sch\u00fcrr","year":"1997"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB105","series-title":"Proc. 5th European Software Engineering Conf. (ESEC'95)","first-page":"219","article-title":"Graph grammar engineering with PROGRES","volume":"Vol. 989","author":"Sch\u00fcrr","year":"1995"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB106","doi-asserted-by":"crossref","unstructured":"A. Sch\u00fcrr, A. Z\u00fcndorf, Nondeterministic control structures for graph rewriting systems, in: G. Schmidt, R. Berghammer (Eds.), Proc. Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 570, Springer, Berlin, pp. 48\u201362.","DOI":"10.1007\/3-540-55121-2_5"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB107","series-title":"Term Graph Rewriting, Theory and Practice","year":"1993"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB108","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(80)90013-4","article-title":"Computation on graph-like expressions","volume":"10","author":"Staples","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0167-6423(98)00023-9_BIB109","article-title":"Parallel and distributed graph transformation: formal description and application to communication-based systems","author":"Taentzer","year":"1996"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB110","series-title":"Proc. Graph Transformations in Computer Science","first-page":"380","article-title":"Amalgamated graph transformation systems and their use for specifying AGG \u2014 an algebraic graph grammar system","volume":"Vol. 776","author":"Taentzer","year":"1994"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB111","series-title":"Proc. Joint COMPUGRAPH\/SEMAGRAPH Workshop on Graph Rewriting and Computation","article-title":"DIEGO, another step towards a module concept for graph transformation systems","volume":"Vol. 2","author":"Taentzer","year":"1995"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB112","article-title":"Semantics and pragmatics of the lambda calculus","author":"Wadsworth","year":"1971"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB113","series-title":"Proc. Graph Grammars and Their Application to Computer Science","first-page":"68","article-title":"PLEXUS: Tools for analyzing graph grammars","volume":"Vol. 532","author":"Wanke","year":"1991"},{"key":"10.1016\/S0167-6423(98)00023-9_BIB114","article-title":"Eine Entwicklungsumgebung f\u00fcr PROgrammierte GRaphErsetzungsSysteme","author":"Z\u00fcndorf","year":"1995"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642398000239?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642398000239?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T16:31:41Z","timestamp":1578501101000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642398000239"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":116,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["S0167642398000239"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6423(98)00023-9","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}