{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:55:38Z","timestamp":1725566138596},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642159275"},{"type":"electronic","value":"9783642159282"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15928-2_14","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T14:32:34Z","timestamp":1284993154000},"page":"203-217","source":"Crossref","is-referenced-by-count":2,"title":["Combining Termination Criteria by Isolating Deletion"],"prefix":"10.1007","author":[{"given":"D\u00e9nes","family":"Bisztray","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reiko","family":"Heckel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"AGG - Attributed Graph Grammar System Environment (2007), http:\/\/tfs.cs.tu-berlin.de\/agg"},{"issue":"4","key":"14_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.entcs.2004.08.048","volume":"127","author":"P. Bottoni","year":"2005","unstructured":"Bottoni, P., Koch, M., Parisi-Presicce, F., Taentzer, G.: Termination of high-level replacement units with application to model transformation. Electronic Notes Theoretical Computer Science\u00a0127(4), 71\u201386 (2005)","journal-title":"Electronic Notes Theoretical Computer Science"},{"key":"14_CR3","unstructured":"Bognar, M.: A survey of abstract rewriting. Master\u2019s thesis, VU University Amsterdam (1995)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., L\u00f6we, M.: Algebraic approaches to graph transformation - part i: Basic concepts and double pushout approach. In: Handbook of Graph Grammars, pp. 163\u2013246 (1997)","DOI":"10.1142\/9789812384720_0003"},{"key":"14_CR5","unstructured":"Ehrig, H., Bisztray, D., Heckel, R.: Verification of architectural refactoring rules. Technical report, Department of Computer Science, University of Leicester (2008), http:\/\/www.cs.le.ac.uk\/people\/dab24\/refactoring-techrep.pdf"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-540-31984-9_5","volume-title":"Fundamental Approaches to Software Engineering","author":"H. Ehrig","year":"2005","unstructured":"Ehrig, H., Ehrig, K., de Lara, J., Taentzer, G., Varr\u00f3, D., Varr\u00f3-Gyapay, S.: Termination criteria for model transformation. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol.\u00a03442, pp. 49\u201363. Springer, Heidelberg (2005)"},{"key":"14_CR7","series-title":"An EATCS Series","volume-title":"Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science)","author":"H. Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science). An EATCS Series. Springer, New York (2006)"},{"key":"14_CR8","series-title":"Prentice Hall International Series in Computer Science","volume-title":"Communicating Sequential Processes","author":"C. Antony","year":"1985","unstructured":"Antony, C., Hoare, R.: Communicating Sequential Processes. Prentice Hall International Series in Computer Science. Prentice Hall, Englewood Cliffs (April 1985)"},{"issue":"4","key":"14_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.entcs.2007.04.019","volume":"175","author":"T. Levendovszky","year":"2007","unstructured":"Levendovszky, T., Prange, U., Ehrig, H.: Termination criteria for dpo transformations with injective matches. Electron. Notes Theor. Comput. Sci.\u00a0175(4), 87\u2013100 (2007)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"14_CR10","unstructured":"OMG. Unified Modeling Language, version 2.1.1 (2006), http:\/\/www.omg.org\/technology\/documents\/formal\/uml.htm"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Plump, D.: On termination of graph rewriting. In: Graph-Theoretic Concepts in Computer Science, pp. 88\u2013100 (1995)","DOI":"10.1007\/3-540-60618-1_68"},{"key":"14_CR12","first-page":"151","volume-title":"Proc. WG 1994 Int. Workshop on Graph-Theoretic Concepts in Computer Science","author":"A. Sch\u00fcrr","year":"1994","unstructured":"Sch\u00fcrr, A.: Specification of graph translators with triple graph grammars. In: Tinhofer (ed.) WG 1994, vol.\u00a0903, pp. 151\u2013163. Springer, Heidelberg (1994)"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Varr\u00f3, D., Asztalos, M., Bisztray, D., Boronat, A., Dang, D.-H., Gei\u00df, R., Greenyer, J., Gorp, P., Kniemeyer, O., Narayanan, A., Rencis, E., Weinell, E.: Transformation of uml models to csp: A case study for graph transformation tools, pp. 540\u2013565 (2008)","DOI":"10.1007\/978-3-540-89020-1_36"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15928-2_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:42:42Z","timestamp":1606185762000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15928-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642159275","9783642159282"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15928-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}