{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:52:40Z","timestamp":1725569560023},"publisher-location":"Berlin, Heidelberg","reference-count":80,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642173219"},{"type":"electronic","value":"9783642173226"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17322-6_2","type":"book-chapter","created":{"date-parts":[[2010,11,8]],"date-time":"2010-11-08T05:03:27Z","timestamp":1289192607000},"page":"6-32","source":"Crossref","is-referenced-by-count":8,"title":["The Edge of Graph Transformation \u2014 Graphs for Behavioural Specification"],"prefix":"10.1007","author":[{"given":"Arend","family":"Rensink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"APPLIGRAPH: Applications of graph transformation (1994), http:\/\/www.informatik.uni-bremen.de\/theorie\/appligraph\/"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/3-540-44685-0_26","volume-title":"CONCUR 2001 - Concurrency Theory","author":"P. Baldan","year":"2001","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B.: A static analysis technique for graph transformation systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 381\u2013395. Springer, Heidelberg (2001)"},{"issue":"7","key":"2_CR3","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1016\/j.ic.2008.04.002","volume":"206","author":"P. Baldan","year":"2008","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B.: A framework for the verification of infinite-state graph transformation systems. Inf. Comput.\u00a0206(7), 869\u2013907 (2008)","journal-title":"Inf. Comput."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Baldan, P., Ehrig, H., K\u00f6nig, B.: Composition and decomposition of dpo transformations with borrowed context. In: [13], pp. 153\u2013167","DOI":"10.1007\/11841883_12"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-24721-0_16","volume-title":"Fundamental Approaches to Software Engineering","author":"R. Bardohl","year":"2004","unstructured":"Bardohl, R., Ehrig, H., de Lara, J., Taentzer, G.: Integrating meta-modelling aspects with graph transformation for efficient visual language definition and model manipulation. In: Wermelinger, M., Margaria-Steffen, T. (eds.) FASE 2004. LNCS, vol.\u00a02984, pp. 214\u2013228. Springer, Heidelberg (2004)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Baresi, L., Heckel, R.: Tutorial introduction to graph transformation: A software engineering perspective. In: [24], pp. 431\u2013433","DOI":"10.1007\/978-3-540-30203-2_30"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Bauer, J., Boneva, I., Kurb\u00e1n, M.E., Rensink, A.: A modal-logic based graph abstraction. In: [25], pp. 321\u2013335","DOI":"10.1007\/978-3-540-87405-8_22"},{"key":"2_CR8","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: Riis Nielson, H., Fil\u00e9, G. (eds.) SAS 2007. LNCS, vol.\u00a04634, pp. 249\u2013264. Springer, Heidelberg (2007)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Bergmann, G., Horv\u00e1th, \u00c1., R\u00e1th, I., Varr\u00f3, D.: A benchmark evaluation of incremental pattern matching in graph transformation. In: [25], pp. 396\u2013410","DOI":"10.1007\/978-3-540-87405-8_27"},{"key":"2_CR10","first-page":"428","volume-title":"Logic in Computer Science (LICS)","author":"J.R. Burch","year":"1990","unstructured":"Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 1020 states and beyond. In: Logic in Computer Science (LICS), pp. 428\u2013439. IEEE Computer Society, Los Alamitos (1990)"},{"key":"2_CR11","unstructured":"Ciraci, S.: Graph Based Verification of Software Evolution Requirements. PhD thesis, University of Twente (2009)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Corradini, A., Dotti, F.L., Foss, L., Ribeiro, L.: Translating java code to graph transformation systems. In: [24], pp. 383\u2013398","DOI":"10.1007\/978-3-540-30203-2_27"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"International Conference on Graph Transformations (ICGT)","year":"2006","unstructured":"Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.): International Conference on Graph Transformations (ICGT). LNCS, vol.\u00a04178. Springer, Heidelberg (2006)"},{"key":"2_CR14","unstructured":"Corradini, A., Montanari, U. (eds.): Joint COMPUGRAPH\/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA). Electronic Notes in Theoretical Computer Science, vol.\u00a02 (1995)"},{"issue":"3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/1481506.1481510","volume":"36","author":"P. Crouzen","year":"2008","unstructured":"Crouzen, P., van de Pol, J.C., Rensink, A.: Applying formal methods to gossiping networks with mCRL and GROOVE. ACM SIGMETRICS Performance Evaluation Review\u00a036(3), 7\u201316 (2008)","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Dodds, M., Plump, D.: Graph transformation in constant time. In: [13], pp. 367\u2013382","DOI":"10.1007\/11841883_26"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0031909","volume-title":"Efficient Graph Rewriting and Its Implementation","author":"H. D\u00f6rr","year":"1995","unstructured":"D\u00f6rr, H.: Efficient Graph Rewriting and Its Implementation. LNCS, vol.\u00a0922. Springer, Heidelberg (1995)"},{"issue":"3","key":"2_CR18","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10270-006-0014-z","volume":"5","author":"F.L. Dotti","year":"2006","unstructured":"Dotti, F.L., Ribeiro, L., dos Santos, O.M., Pasini, F.: Verifying object-based graph grammars. Software and System Modeling\u00a05(3), 289\u2013311 (2006)","journal-title":"Software and System Modeling"},{"issue":"2","key":"2_CR19","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1006\/jcss.2001.1790","volume":"64","author":"F. Drewes","year":"2002","unstructured":"Drewes, F., Hoffmann, B., Plump, D.: Hierarchical graph transformation. J. Comput. Syst. Sci.\u00a064(2), 249\u2013283 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Ehrig, H.: Introduction to COMPUGRAPH. In: [14], pp. 89\u2013100","DOI":"10.1016\/S1571-0661(05)80185-9"},{"issue":"1","key":"2_CR21","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. Fundam. Inform.\u00a074(1), 31\u201361 (2006)","journal-title":"Fundam. Inform."},{"key":"2_CR22","series-title":"Monographs in Theoretical Computer Science","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. Monographs in Theoretical Computer Science. Springer, Heidelberg (2006)"},{"key":"2_CR23","series-title":"Applications, Languages and Tools","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","year":"1999","unstructured":"Ehrig, H., Engels, G., Kreowski, H.J., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformation. Applications, Languages and Tools, vol.\u00a0II. World Scientific, Singapore (1999)"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","volume-title":"Graph Transformations","year":"2004","unstructured":"Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.): International Conference on Graph Transformations (ICGT). LNCS, vol.\u00a03256. Springer, Heidelberg (2004)"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","volume-title":"Graph Transformations","year":"2008","unstructured":"Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.): International Conference on Graph Transformations (ICGT). LNCS, vol.\u00a05214. Springer, Heidelberg (2008)"},{"key":"2_CR26","series-title":"Concurrency, Parallelism, and Distribution","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","year":"1999","unstructured":"Ehrig, H., Kreowski, H.J., Montanari, U., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformation. Concurrency, Parallelism, and Distribution, vol.\u00a0III. World Scientific, Singapore (1999)"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/SWAT.1973.11","volume-title":"14th Annual Symposium on Switching and Automata Theory","author":"H. Ehrig","year":"1973","unstructured":"Ehrig, H., Pfender, M., Schneider, H.J.: Graph-grammars: An algebraic approach. In: 14th Annual Symposium on Switching and Automata Theory, pp. 167\u2013180. IEEE, Los Alamitos (1973)"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-540-72952-5_5","volume-title":"Formal Methods for Open Object-Based Distributed Systems","author":"G. Engels","year":"2007","unstructured":"Engels, G., Soltenborn, C., Wehrheim, H.: Analysis of UML activities using dynamic meta modeling. In: Bonsangue, M.M., Johnsen, E.B. (eds.) FMOODS 2007. LNCS, vol.\u00a04468, pp. 76\u201390. Springer, Heidelberg (2007)"},{"key":"2_CR29","unstructured":"Ermel, C., Rudolf, M., Taentzer, G.: The AGG approach: language and environment. In: [23], http:\/\/tfs.cs.tu-berlin.de\/agg\/"},{"key":"2_CR30","unstructured":"The FUJABA toolsuite (2006), http:\/\/www.fujaba.de"},{"key":"2_CR31","unstructured":"GBT \u2014 graph backwards tool, http:\/\/www.it.uu.se\/research\/group\/mobility\/adhoc\/gbt"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Gei\u00df, R., Batz, G.V., Grund, D., Hack, S., Szalkowski, A.: Grgen: A fast spo-based graph rewriting tool. In: [13], pp. 383\u2013397","DOI":"10.1007\/11841883_27"},{"key":"2_CR33","unstructured":"GETGRATS: General theory of graph transformation systems (1997), http:\/\/www.di.unipi.it\/~andrea\/GETGRATS\/"},{"key":"2_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-00434-6_14","volume-title":"Software Language Engineering","author":"P.V. Gorp","year":"2009","unstructured":"Gorp, P.V., Keller, A., Janssens, D.: Transformation language integration based on profiles and higher order transformations. In: Ga\u0161evi\u0107, D., L\u00e4mmel, R., Van Wyk, E. (eds.) SLE 2008. LNCS, vol.\u00a05452, pp. 208\u2013226. Springer, Heidelberg (2009)"},{"key":"2_CR35","unstructured":"Hausmann, J.H.: Dynamic Meta Modeling: A Semantics Description Technique for Visual Modeling Languages. PhD thesis, University of Paderborn (2005)"},{"key":"2_CR36","first-page":"80","volume-title":"Human-Centric Computing Languages and Environments (HCC)","author":"J.H. Hausmann","year":"2001","unstructured":"Hausmann, J.H., Heckel, R., Sauer, S.: Towards dynamic meta modeling of UML extensions: An extensible semantics for UML sequence diagrams. In: Human-Centric Computing Languages and Environments (HCC), pp. 80\u201387. IEEE Computer Society, Los Alamitos (2001)"},{"issue":"2","key":"2_CR37","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.scico.2005.10.003","volume":"60","author":"R.C. Holt","year":"2006","unstructured":"Holt, R.C., Sch\u00fcrr, A., Sim, S.E., Winter, A.: GXL: A graph-based standard exchange format for reengineering. Sci. Comput. Program.\u00a060(2), 149\u2013170 (2006)","journal-title":"Sci. Comput. Program."},{"key":"2_CR38","volume-title":"The SPIN Model Checker \u2014 Primer and Reference Manual","author":"G. Holzmann","year":"2004","unstructured":"Holzmann, G.: The SPIN Model Checker \u2014 Primer and Reference Manual. Addison-Wesley, Reading (2004)"},{"key":"2_CR39","unstructured":"Horv\u00e1th, \u00c1., Varr\u00f3, G., Varr\u00f3, D.: Generic search plans for matching advanced graph patterns. In: Karsten Ehrig, H.G. (ed.) Graph Transformation and Visual Modeling Techniques (GT-VMT). Electronic Communications of the EASST, vol.\u00a06 (2007)"},{"issue":"3","key":"2_CR40","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.tcs.2008.03.013","volume":"404","author":"F. Ivancic","year":"2008","unstructured":"Ivancic, F., Yang, Z., Ganai, M.K., Gupta, A., Ashar, P.: Efficient SAT-based bounded model checking for software verification. Theor. Comput. Sci.\u00a0404(3), 256\u2013274 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/11768869_15","volume-title":"Formal Methods for Open Object-Based Distributed Systems","author":"H. Kastenberg","year":"2006","unstructured":"Kastenberg, H., Kleppe, A., Rensink, A.: Defining object-oriented execution semantics using graph transformations. In: Gorrieri, R., Wehrheim, H. (eds.) FMOODS 2006. LNCS, vol.\u00a04037, pp. 186\u2013201. Springer, Heidelberg (2006)"},{"key":"2_CR42","unstructured":"Kleppe, A.G., Rensink, A.: On a graph-based semantics for UML class and object diagrams. In: Ermel, C., Lara, J.D., Heckel, R. (eds.) Graph Transformation and Visual Modelling Techniques (GT-VMT). Electronic Communications of the EASST, vol.\u00a010. EASST (2008)"},{"key":"2_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/11691372_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B. K\u00f6nig","year":"2006","unstructured":"K\u00f6nig, B., Kozioura, V.: Counterexample-guided abstraction refinement for the analysis of graph transformation systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.\u00a03920, pp. 197\u2013211. Springer, Heidelberg (2006)"},{"key":"2_CR44","doi-asserted-by":"crossref","unstructured":"K\u00f6nig, B., Kozioura, V.: Augur 2 \u2014 a new version of a tool for the analysis of graph transformation systems. In: Bruni, R., Varr\u00f3, D. (eds.) Graph Transformation and Visual Modeling Techniques (GT-VMT 2006). Electronic Notes in Theoretical Computer Science, vol.\u00a0211, pp. 201\u2013210 (2008)","DOI":"10.1016\/j.entcs.2008.04.042"},{"issue":"3","key":"2_CR45","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10270-008-0101-4","volume":"8","author":"S. Kuske","year":"2009","unstructured":"Kuske, S., Gogolla, M., Kreowski, H.J., Ziemann, P.: Towards an integrated graph-based semantics for UML. Software and System Modeling\u00a08(3), 403\u2013422 (2009)","journal-title":"Software and System Modeling"},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"Lambers, L.: A new version of GTXL: An exchange format for graph transformation systems. In: Proceedings of the International Workshop on Graph-Based Tools (GraBaTs). Electronic Notes in Theoretical Computer Science, vol.\u00a0127, pp. 51\u201363 (March 2005)","DOI":"10.1016\/j.entcs.2004.12.030"},{"key":"2_CR47","unstructured":"Lengyel, L., Levendovszky, T., Vajk, T., Charaf, H.: Realizing qvt with graph rewriting-based model transformation. In: Karsai, G., Taentzer, G. (eds.) Graph and Model Transformation (GraMoT). Electronic Communications of the EASST, vol.\u00a04 (2006)"},{"key":"2_CR48","unstructured":"Levendovszky, T., Rensink, A., Van Gorp, P.: 5th International Workshop on Graph-Based Tools: The contest (grabats) (2009), http:\/\/is.ieis.tue.nl\/staff\/pvgorp\/events\/grabats2009"},{"key":"2_CR49","first-page":"135","volume-title":"Formal Methods and Models for Co-Design (MEMOCODE)","author":"K.L. McMillan","year":"2003","unstructured":"McMillan, K.L.: Methods for exploiting sat solvers in unbounded model checking. In: Formal Methods and Models for Co-Design (MEMOCODE), p. 135. IEEE Computer Society, Los Alamitos (2003)"},{"key":"2_CR50","volume-title":"Communication and concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and concurrency. Prentice-Hall, Inc., Englewood Cliffs (1989)"},{"key":"2_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-44685-0_2","volume-title":"CONCUR 2001 - Concurrency Theory","author":"R. Milner","year":"2001","unstructured":"Milner, R.: Bigraphical reactive systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 16\u201335. Springer, Heidelberg (2001)"},{"issue":"1","key":"2_CR52","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.ic.2005.07.003","volume":"204","author":"R. Milner","year":"2006","unstructured":"Milner, R.: Pure bigraphs: Structure and dynamics. Inf. Comput.\u00a0204(1), 60\u2013122 (2006)","journal-title":"Inf. Comput."},{"key":"2_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-18771-5_43","volume-title":"Graph-Grammars and Their Application to Computer Science","author":"M. Nagl","year":"1987","unstructured":"Nagl, M.: Set theoretic approaches to graph grammars. In: Ehrig, H., Nagl, M., Rosenfeld, A., Rozenberg, G. (eds.) Graph Grammars 1986. LNCS, vol.\u00a0291, pp. 41\u201354. Springer, Heidelberg (1987)"},{"key":"2_CR54","unstructured":"OMG: Meta object facility (MOF) core specification, v2.0. Document formal\/06-01-01, Object Management Group (2006), http:\/\/www.omg.org\/cgi-bin\/doc?formal\/06-01-01"},{"key":"2_CR55","unstructured":"OMG: Unified modeling language, superstructure, v2.2. Document formal\/09-02-02, Object Management Group (2009), http:\/\/www.omg.org\/cgi-bin\/doc?formal\/09-02-02"},{"issue":"3","key":"2_CR56","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/S0022-0000(03)00064-3","volume":"68","author":"W. Palacz","year":"2004","unstructured":"Palacz, W.: Algebraic hierarchical graph transformation. J. Comput. Syst. Sci.\u00a068(3), 497\u2013520 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR57","unstructured":"Pennemann, K.H.: Development of Correct Graph Transformation Systems. PhD thesis, University of Oldenburg, Oldenburg (2009), http:\/\/oops.uni-oldenburg.de\/volltexte\/2009\/948\/"},{"key":"2_CR58","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 tool for state space generation. In: Pfaltz, J.L., Nagl, M., B\u00f6hlen, B. (eds.) AGTIVE 2003. LNCS, vol.\u00a03062, pp. 479\u2013485. Springer, Heidelberg (2004)"},{"key":"2_CR59","unstructured":"Rensink, A.: Isomorphism checking in GROOVE. In: Z\u00fcndorf, A., Varr\u00f3, D. (eds.) Graph-Based Tools (GraBaTs). Electronic Communications of the EASST, European Association of Software Science and Technology, vol.\u00a01 (September 2007)"},{"key":"2_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-14162-1_26","volume-title":"Automata, Languages and Programming (ICALP)","author":"A. Rensink","year":"2010","unstructured":"Rensink, A.: Compositionality in graph transformation. In: Abramsky, S., et al. (eds.) ICALP 2010, Part II. LNCS, vol.\u00a06199, pp. 309\u2013320. Springer, Heidelberg (2010)"},{"key":"2_CR61","doi-asserted-by":"crossref","unstructured":"Rensink, A., Distefano, D.S.: Abstract graph transformation. In: Mukhopadhyay, S., Roychoudhury, A., Yang, Z. (eds.) Software Verification and Validation, Manchester. Electronic Notes in Theoretical Computer Science, vol.\u00a0157, pp. 39\u201359 (May 2006)","DOI":"10.1016\/j.entcs.2006.01.022"},{"key":"2_CR62","doi-asserted-by":"crossref","unstructured":"Rensink, A., Taentzer, G.: Agtive 2007 graph transformation tool contest. In: [71], pp. 487\u2013492, http:\/\/www.informatik.uni-marburg.de\/~swt\/agtive-contest","DOI":"10.1007\/978-3-540-89020-1_33"},{"key":"2_CR63","doi-asserted-by":"crossref","unstructured":"Rensink, A., Van Gorp, P.: Graph transformation tool contest 2008. Software Tools for Technology Transfer (2009) Special section; in preparation, http:\/\/fots.ua.ac.be\/events\/grabats2008 .","DOI":"10.1007\/s10009-010-0157-7"},{"key":"2_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-642-02138-1_18","volume-title":"Formal Techniques for Distributed Systems","author":"A. Rensink","year":"2009","unstructured":"Rensink, A., Zambon, E.: A type graph model for java programs. In: Lee, D., Lopes, A., Poetzsch-Heffter, A. (eds.) FMOODS 2009. LNCS, vol.\u00a05522, pp. 237\u2013242. Springer, Heidelberg (2009)"},{"key":"2_CR65","series-title":"Foundations","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformations","year":"1997","unstructured":"Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformations. Foundations, vol.\u00a01. World Scientific, Singapore (1997)"},{"issue":"3","key":"2_CR66","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1145\/514188.514190","volume":"24","author":"S. Sagiv","year":"2002","unstructured":"Sagiv, S., Reps, T.W., Wilhelm, R.: Parametric shape analysis via 3-valued logic. ACM Trans. Program. Lang. Syst.\u00a024(3), 217\u2013298 (2002)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"2_CR67","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-78800-3_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Saksena","year":"2008","unstructured":"Saksena, M., Wibling, O., Jonsson, B.: Graph grammar modeling and verification of ad hoc routing protocols. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 18\u201332. Springer, Heidelberg (2008)"},{"key":"2_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-45221-8_8","volume-title":"\u00abUML\u00bb 2003 - The Unified Modeling Language. Modeling Languages and Applications","author":"\u00c1. Schmidt","year":"2003","unstructured":"Schmidt, \u00c1., Varr\u00f3, D.: Checkvml: A tool for model checking visual modeling languages. In: Stevens, P., Whittle, J., Booch, G. (eds.) UML 2003. LNCS, vol.\u00a02863, pp. 92\u201395. Springer, Heidelberg (2003)"},{"key":"2_CR69","doi-asserted-by":"crossref","unstructured":"Sch\u00fcrr, A.: Programmed graph replacement systems. In: [65], pp. 479\u2013546","DOI":"10.1142\/9789812384720_0007"},{"key":"2_CR70","doi-asserted-by":"crossref","unstructured":"Sch\u00fcrr, A., Klar, F.: 15 years of triple graph grammars. In: [25], pp. 411\u2013425","DOI":"10.1007\/978-3-540-87405-8_28"},{"key":"2_CR71","series-title":"Lecture Notes in Computer Science","volume-title":"Applications of Graph Transformations with Industrial Relevance (AGTIVE)","year":"2008","unstructured":"Sch\u00fcrr, A., Nagl, M., Z\u00fcndorf, A. (eds.): Applications of Graph Transformations with Industrial Relevance (AGTIVE). LNCS, vol.\u00a05088. Springer, Heidelberg (2008)"},{"key":"2_CR72","unstructured":"SEGRAVIS: Syntactic and semantics integration of visual modelling techniques (2002), http:\/\/www.segravis.org\/"},{"key":"2_CR73","unstructured":"SENSORIA: Software engineering for service-oriented overlay computers (2005), http:\/\/www.sensoria-ist.eu"},{"key":"2_CR74","doi-asserted-by":"crossref","unstructured":"Sleep, M.R.: SEMAGRAPH: The theory and practice of term graph rewriting. In: [14], pp. 268\u2013276","DOI":"10.1016\/S1571-0661(05)80205-1"},{"issue":"1-2","key":"2_CR75","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0304-3975(96)00215-0","volume":"186","author":"G. Taentzer","year":"1997","unstructured":"Taentzer, G.: Parallel high-level replacement systems. Theor. Comput. Sci.\u00a0186(1-2), 43\u201381 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR76","doi-asserted-by":"crossref","unstructured":"Taentzer, G.: Distributed graphs and graph transformation. Applied Categorical Structures\u00a07(4) (1999)","DOI":"10.1023\/A:1008683005045"},{"key":"2_CR77","doi-asserted-by":"crossref","unstructured":"Taentzer, G.: Towards common exchange formats for graphs and graph transformation systems. In: Uniform Approaches to Graphical Process Specification Techniques (UNIGRA). Electronic Notes in Theoretical Computer Science, vol.\u00a044, pp. 28\u201340 (2001)","DOI":"10.1016\/S1571-0661(04)80941-1"},{"key":"2_CR78","doi-asserted-by":"crossref","unstructured":"Taentzer, G., Biermann, E., Bisztray, D., Bohnet, B., Boneva, I., Boronat, A., Geiger, L., Gei\u00df, R., Horvath, \u00c1., Kniemeyer, O., Mens, T., Ness, B., Plump, D., Vajk, T.: Generation of Sierpinski triangles: A case study for graph transformation tools. In: [71], pp. 514\u2013539","DOI":"10.1007\/978-3-540-89020-1_35"},{"key":"2_CR79","doi-asserted-by":"crossref","unstructured":"Taentzer, G., Fischer, I., Koch, M., Volle, V.: Distributed graph transformation with application to visual design of distributed systems. In: [26], ch.\u00a06, pp. 269\u2013340","DOI":"10.1142\/9789812814951_0005"},{"key":"2_CR80","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-540-31984-9_6","volume-title":"Fundamental Approaches to Software Engineering","author":"G. Taentzer","year":"2005","unstructured":"Taentzer, G., Rensink, A.: Ensuring structural constraints in graph-based models with type inheritance. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol.\u00a03442, pp. 64\u201379. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations and Model-Driven Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17322-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T05:43:44Z","timestamp":1636782224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17322-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642173219","9783642173226"],"references-count":80,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17322-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}