{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:51Z","timestamp":1761611271878},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540672036"},{"type":"electronic","value":"9783540464648"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/978-3-540-46464-8_27","type":"book-chapter","created":{"date-parts":[[2010,10,20]],"date-time":"2010-10-20T13:43:10Z","timestamp":1287582190000},"page":"383-395","source":"Crossref","is-referenced-by-count":7,"title":["Simple Modules for Grace"],"prefix":"10.1007","author":[{"given":"Reiko","family":"Heckel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berthold","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Knirsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabine","family":"Kuske","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"The Programming Language Ada. ISO standard 8652 (1995), See also at http:\/\/lglwww.epfl.ch\/Ada\/","key":"27_CR1"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6423(98)00023-9","volume":"34","author":"M. Andries","year":"1999","unstructured":"Andries, M., Engels, G., Habel, A., Hoffmann, B., Kreowski, H.-J., Kuske, S., Plump, D., Sch\u00fcrr, A., Taentzer, G.: Graph transformation for specification and programming. Science of Computer Programming\u00a034, 1\u201354 (1999)","journal-title":"Science of Computer Programming"},{"unstructured":"Arnold, K., Gosling, J.: The Java Programming Language, 2nd edn. Addison Wesley\u2019s Java Series (1998)","key":"27_CR3"},{"key":"27_CR4","volume-title":"Graph Theory: An Algorithmic Approach","author":"N.. Christofides","year":"1975","unstructured":"Christofides, N.: Graph Theory: An Algorithmic Approach. Academic Press, Inc., London (1975)"},{"issue":"3,4","key":"27_CR5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.3233\/FI-1996-263402","volume":"26","author":"A. Corradini","year":"1996","unstructured":"Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fundamenta Informaticae\u00a026(3,4), 241\u2013266 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-61228-9_84","volume-title":"Graph Grammars and Their Application to Computer Science","author":"H.. Ehrig","year":"1996","unstructured":"Ehrig, H., Engels, G.: Pragmatic and semantic aspects of a module concept for graph transformation systems. In: Cuny, J., Engels, G., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol.\u00a01073, pp. 137\u2013154. Springer, Heidelberg (1996)"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/BFb0055805","volume-title":"Mathematical Foundations of Computer Science 1998","author":"M. Gro\u00dfe-Rhode","year":"1998","unstructured":"Gro\u00dfe-Rhode, M., Parisi-Presicce, F., Simeoni, M.: Spatial and temporal refinement of typed graph transformation systems. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 553\u2013561. Springer, Heidelberg (1998)"},{"doi-asserted-by":"crossref","unstructured":"Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundamenta Informaticae\u00a0XXVII(1\/2) (1996)","key":"27_CR8","DOI":"10.3233\/FI-1996-263404"},{"doi-asserted-by":"crossref","unstructured":"Heckel, R., Ehrig, H., Engels, G., Taentzer, G.: Classification and comparison of module concepts for graph transformation systems. In: Engels, G., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation. Specification and Programming, vol.\u00a0II (1999) (to appear)","key":"27_CR9","DOI":"10.1142\/9789812815149_0017"},{"doi-asserted-by":"crossref","unstructured":"Hoffmann, B.: From graph transformation to rule-based programming with diagrams. In: Nagl, M., Sch\u00fcrr, A. (eds.) Proc. Int\u2019l Workshop and Symposium on Applications of Graph Transformation with Industrial Relevance (AGTIVE), to appear in Lecture Notes in Computer Science (1999)","key":"27_CR10","DOI":"10.1007\/3-540-45104-8_12"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-61228-9_81","volume-title":"Graph Grammars and Their Application to Computer Science","author":"H.-J. Kreowski","year":"1996","unstructured":"Kreowski, H.-J., Kuske, S.: On the interleaving semantics of transformation units \u2014 a step into GRACE. In: Cuny, J.E., Ehrig, H., Engels, G., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol.\u00a01073, pp. 89\u2013108. Springer, Heidelberg (1996)"},{"issue":"4","key":"27_CR12","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1142\/S0218194097000278","volume":"7","author":"H.-J. Kreowski","year":"1998","unstructured":"Kreowski, H.-J., Kuske, S., Sch\u00fcrr, A.: Nested graph transformation units. International Journal on Software Engineering and Knowledge Engineering\u00a07(4), 479\u2013502 (1998)","journal-title":"International Journal on Software Engineering and Knowledge Engineering"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","first-page":"150","volume-title":"Theory and Application of Graph Transformations","author":"S. Kuske","year":"1998","unstructured":"Kuske, S.: More about control conditions for transformation units. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol.\u00a01764, pp. 150\u2013157. Springer, Heidelberg (1998)"},{"unstructured":"Peterson, J., Hammond, K., Augustsson, L., Boutel, B., Burton, W., Fasel, J., Gordon, A.D., Hughes, J., Hudak, P., Johnsson, T., Jones, M., Meijer, E., Jones, S.P., Reid, A., Wadler, P.: Report on the Programming Language Haskell, Version 1.4. Yale University (April 1997), See http:\/\/www.haskell.org\/report\/index.html","key":"27_CR14"},{"volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation, Foundations","year":"1997","unstructured":"Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, Foundations, vol.\u00a0I. World Scientific, Singapore (1997)","key":"27_CR15"},{"doi-asserted-by":"crossref","unstructured":"Sch\u00fcrr, A.: PROGRES: A VHL-language based on graph grammars. In: Schneider, H.-J., Ehrig, H. (eds.) Proc. Graph Transformations in Computer Science. LNCS, vol.\u00a0776, pp. 641\u2013659 (1994)","key":"27_CR16","DOI":"10.1007\/BFb0017419"},{"key":"27_CR17","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1142\/9789812384720_0007","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"A. SCH\u00dcRR","year":"1997","unstructured":"Sch\u00fcrr, A.: Programmed graph replacement systems. In: Rozenberg [Roz97], pp. 479\u2013546"},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1007\/3-540-57787-4_24","volume-title":"Graph Transformations in Computer Science","author":"G. Taentzer","year":"1994","unstructured":"Taentzer, G., Beyer, M.: Amalgamated graph transformation systems and their use for specifying AGG \u2013 an algebraic graph grammar system. In: Schneider, H.-J., Ehrig, H. (eds.) Dagstuhl Seminar 1993. LNCS, vol.\u00a0776, pp. 380\u2013394. Springer, Heidelberg (1994)"},{"key":"27_CR19","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S1571-0661(05)80206-3","volume":"2","author":"Gabriele Taentzer","year":"1995","unstructured":"Taentzer, G., Sch\u00fcrr, A.: DIEGO, another step towards a module concept for graph transformation systems. In: Proc. of SEGRAGRA 1995. Graph Rewriting and Computation, Electronic Notes of TCS, vol.\u00a02 (1995), http:\/\/www.elsevier.nl\/locate\/entcs\/volume2.html","journal-title":"Electronic Notes in Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Theory and Application of Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-46464-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,12]],"date-time":"2021-11-12T04:17:31Z","timestamp":1636690651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-46464-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540672036","9783540464648"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-46464-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}