{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:05:07Z","timestamp":1762459507726,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319614694"},{"type":"electronic","value":"9783319614700"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-61470-0_5","type":"book-chapter","created":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T09:54:59Z","timestamp":1497952499000},"page":"73-89","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Specifying Graph Languages with Type Graphs"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Corradini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis","family":"Nolte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,21]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-319-02444-8_17","volume-title":"Automated Technology for Verification and Analysis","author":"PA Abdulla","year":"2013","unstructured":"Abdulla, P.A., Hol\u00edk, L., Jonsson, B., Leng\u00e1l, O., Trinh, C.Q., Vojnar, T.: Verification of heap manipulating programs with ordered data by extended forest automata. In: Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 224\u2013239. Springer, Cham (2013). doi:10.1007\/978-3-319-02444-8_17"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-642-33654-6_18","volume-title":"Graph Transformations","author":"C Blume","year":"2012","unstructured":"Blume, C., Bruggink, H.J.S., Engelke, D., K\u00f6nig, B.: Efficient symbolic implementation of graph automata with applications to invariant checking. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2012. LNCS, vol. 7562, pp. 264\u2013278. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-33654-6_18"},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.jvlc.2012.10.002","volume":"24","author":"C Blume","year":"2013","unstructured":"Blume, C., Sander Bruggink, H.J., Friedrich, M., K\u00f6nig, B.: Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata. J. Vis. Lang. Comput. 24(3), 192\u2013206 (2013)","journal-title":"J. Vis. Lang. Comput."},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-540-87405-8_23","volume-title":"Graph Transformations","author":"HJS Bruggink","year":"2008","unstructured":"Bruggink, H.J.S., K\u00f6nig, B.: On the recognizability of arrow and graph languages. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 336\u2013350. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-87405-8_23"},{"issue":"5","key":"5_CR5","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1145\/876638.876643","volume":"50","author":"EM Clarke","year":"2003","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Yuan, L., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5), 752\u2013794 (2003)","journal-title":"J. ACM"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Corradini, A., K\u00f6nig, B., Nolte, D.: Specifying graph languages with type graphs, arXiv:1704.05263 (2017)","DOI":"10.1007\/978-3-319-61470-0_5"},{"issue":"3\/4","key":"5_CR7","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 26(3\/4), 241\u2013265 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs I. Recognizable sets of finite graphs. Inf. Comput. 85, 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"5_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977619","volume-title":"Graph Structure and Monadic Second-Order Logic, A Language-Theoretic Approach","author":"B Courcelle","year":"2012","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic, A Language-Theoretic Approach. Cambridge University Press, New York (2012)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/11691372_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Distefano","year":"2006","unstructured":"Distefano, D., O\u2019Hearn, P.W., Yang, H.: A local shape analysis based on separation logic. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 287\u2013302. Springer, Heidelberg (2006). doi:10.1007\/11691372_19"},{"key":"5_CR11","unstructured":"Endrullis, J., Zantema, H.: Proving non-termination by finite automata. In: RTA 2015, vol. 36. LIPIcs, pp. 160\u2013176. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2015)"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Habel, A.: Hyperedge Replacement: Grammars and Languages. LNCS, vol. 643. Springer, Heidelberg (1992). doi:10.1007\/BFb0013875","DOI":"10.1007\/BFb0013875"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-31847-7_17","volume-title":"Formal Methods in Software and Systems Modeling","author":"A Habel","year":"2005","unstructured":"Habel, A., Pennemann, K.-H.: Nested constraints and application conditions for high-level structures. In: Kreowski, H.-J., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds.) Formal Methods in Software and Systems Modeling. LNCS, vol. 3393, pp. 293\u2013308. Springer, Heidelberg (2005). doi:10.1007\/978-3-540-31847-7_17"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Heckel, R., Wagner, A.: Ensuring consistency of conditional graph rewriting - a constructive approach. In: Proceedings of the Joint COMPUGRAPH\/SEMAGRAPH Workshop on Graph Rewriting and Computation, vol. 2, ENTCS (1995)","DOI":"10.1016\/S1571-0661(05)80188-4"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1006\/jctb.2000.1970","volume":"80","author":"J Ne\u0161et\u0159il","year":"2000","unstructured":"Ne\u0161et\u0159il, J., Tardif, C.: Duality theorems for finite structures (characterising gaps and good characterisations). J. Comb. Theory Ser. B 80, 80\u201397 (2000)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1\u20133","key":"5_CR16","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.tcs.2006.12.035","volume":"375","author":"PW O\u2019Hearn","year":"2007","unstructured":"O\u2019Hearn, P.W.: Resources, concurrency and local reasoning. Theor. Comput. Sci. 375(1\u20133), 271\u2013307 (2007). Reynolds Festschrift","journal-title":"Theor. Comput. Sci."},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-78743-3_14","volume-title":"Fundamental Approaches to Software Engineering","author":"F Orejas","year":"2008","unstructured":"Orejas, F., Ehrig, H., Prange, U.: A logic of graph constraints. In: Fiadeiro, J.L., Inverardi, P. (eds.) FASE 2008. LNCS, vol. 4961, pp. 179\u2013198. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-78743-3_14"},{"key":"5_CR18","unstructured":"Pennemann, K.-H.: Development of Correct Graph Transformation Systems. Ph.D. thesis, Universit\u00e4t Oldenburg, May 2009"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-24725-8_28","volume-title":"Programming Languages and Systems","author":"A Rensink","year":"2004","unstructured":"Rensink, A.: Canonical graph shapes. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 401\u2013415. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-24725-8_28"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-30203-2_23","volume-title":"Graph Transformations","author":"A Rensink","year":"2004","unstructured":"Rensink, A.: Representing first-order logic using graphs. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 319\u2013335. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-30203-2_23"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Rozenberg, G., (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1: Foundations. World Scientific (1997)","DOI":"10.1142\/9789812384720"},{"key":"5_CR22","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-02571-6_4","volume-title":"Objects, Components, Models and Patterns","author":"A Rutle","year":"2009","unstructured":"Rutle, A., Rossini, A., Lamo, Y., Wolter, U.: A diagrammatic formalisation of MOF-based modelling languages. In: Oriol, M., Meyer, B. (eds.) TOOLS EUROPE 2009. LNBIP, vol. 33, pp. 37\u201356. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-02571-6_4"},{"issue":"3","key":"5_CR23","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1145\/514188.514190","volume":"24","author":"M Sagiv","year":"2002","unstructured":"Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. TOPLAS (ACM Trans. Program. Lang. Syst.) 24(3), 217\u2013298 (2002)","journal-title":"TOPLAS (ACM Trans. Program. Lang. Syst.)"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-25032-3_7","volume-title":"Formal Methods, Foundations and Applications","author":"D Steenken","year":"2011","unstructured":"Steenken, D., Wehrheim, H., Wonisch, D.: Sound and complete abstract graph transformation. In: Simao, A., Morgan, C. (eds.) SBMF 2011. LNCS, vol. 7021, pp. 92\u2013107. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-25032-3_7"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61470-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:51:30Z","timestamp":1710327090000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-61470-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319614694","9783319614700"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61470-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"21 June 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}