{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:00:14Z","timestamp":1762459214151},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319091075"},{"type":"electronic","value":"9783319091082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09108-2_3","type":"book-chapter","created":{"date-parts":[[2014,7,4]],"date-time":"2014-07-04T09:07:01Z","timestamp":1404464821000},"page":"33-48","source":"Crossref","is-referenced-by-count":16,"title":["Verifying Monadic Second-Order Properties of Graph Programs"],"prefix":"10.1007","author":[{"given":"Christopher M.","family":"Poskitt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Detlef","family":"Plump","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11841883_31","volume-title":"Graph Transformations","author":"A. Habel","year":"2006","unstructured":"Habel, A., Pennemann, K.-H., Rensink, A.: Weakest preconditions for high-level programs. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol.\u00a04178, pp. 445\u2013460. Springer, Heidelberg (2006)"},{"key":"3_CR2","unstructured":"Pennemann, K.H.: Development of Correct Graph Transformation Systems. Doctoral dissertation, Universit\u00e4t Oldenburg (2009)"},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1017\/S0960129508007202","volume":"19","author":"A. Habel","year":"2009","unstructured":"Habel, A., Pennemann, K.H.: Correctness of high-level transformation systems relative to nested conditions. Mathematical Structures in Computer Science\u00a019(2), 245\u2013296 (2009)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"1-2","key":"3_CR4","doi-asserted-by":"crossref","first-page":"135","DOI":"10.3233\/FI-2012-708","volume":"118","author":"C.M. Poskitt","year":"2012","unstructured":"Poskitt, C.M., Plump, D.: Hoare-style verification of graph programs. Fundamenta Informaticae\u00a0118(1-2), 135\u2013175 (2012)","journal-title":"Fundamenta Informaticae"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Poskitt, C.M.: Verification of Graph Programs. PhD thesis, University of York (2013)","DOI":"10.1007\/978-3-642-33654-6_30"},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4204\/EPTCS.82.1","volume":"82","author":"Detlef Plump","year":"2012","unstructured":"Plump, D.: The design of GP 2. In: Escobar, S. (ed.) WRS 2011. EPTCS, vol.\u00a082, pp. 1\u201316 (2012)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Cambridge University Press (2012)","DOI":"10.1017\/CBO9780511977619"},{"key":"3_CR8","unstructured":"Poskitt, C.M., Plump, D.: Verifying monadic second-order properties of graph programs: Extended version (2014), http:\/\/arxiv.org\/abs\/1405.5927"},{"key":"3_CR9","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)"},{"issue":"1","key":"3_CR10","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. Information and Computation\u00a085(1), 12\u201375 (1990)","journal-title":"Information and Computation"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: Handbook of Theoretical Computer Science, vol.\u00a0B. Elsevier (1990)","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"key":"3_CR12","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Springer (2006)"},{"key":"3_CR13","unstructured":"Poskitt, C.M., Plump, D.: Verifying total correctness of graph programs. In: Echahed, R., Habel, A., Mosbah, M. (eds.) GCM 2012. Electronic Communications of the EASST, vol.\u00a061 (2013)"},{"key":"3_CR14","unstructured":"Habel, A., Radke, H.: Expressiveness of graph conditions with variables. In: Ermel, C., Ehrig, H., Orejas, F., Taentzer, G. (eds.) GraMoT 2010. Electronic Communications of the EASST, vol.\u00a030 (2010)"},{"key":"3_CR15","unstructured":"Radke, H.: HR* graph conditions between counting monadic second-order and second-order graph formulas. In: Echahed, R., Habel, A., Mosbah, M. (eds.) GCM 2012. Electronic Communications of the EASST, vol.\u00a061 (2013)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-642-40561-7_8","volume-title":"Software Engineering and Formal Methods","author":"C. Percebois","year":"2013","unstructured":"Percebois, C., Strecker, M., Tran, H.N.: Rule-level verification of graph transformations for invariants based on edges\u2019 transitive closure. In: Hierons, R.M., Merayo, M.G., Bravetti, M. (eds.) SEFM 2013. LNCS, vol.\u00a08137, pp. 106\u2013121. Springer, Heidelberg (2013)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Inaba, K., Hidaka, S., Hu, Z., Kato, H., Nakano, K.: Graph-transformation verification using monadic second-order logic. In: Schneider-Kamp, P., Hanus, M. (eds.) PPDP 2011, pp. 17\u201328. ACM (2011)","DOI":"10.1145\/2003476.2003482"},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10009-011-0186-x","volume":"14","author":"A.H. Ghamarian","year":"2012","unstructured":"Ghamarian, A.H., de Mol, M., Rensink, A., Zambon, E., Zimakova, M.: Modelling and analysis using GROOVE. Software Tools for Technology Transfer\u00a014(1), 15\u201340 (2012)","journal-title":"Software Tools for Technology Transfer"},{"key":"3_CR19","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.entcs.2008.04.042","volume":"211","author":"Barbara K\u00f6nig","year":"2008","unstructured":"K\u00f6nig, B., Kozioura, V.: Augur 2 - a new version of a tool for the analysis of graph transformation systems. In: Bruni, R., Varr\u00f3, D. (eds.) GT-VMT 2006. ENTCS, vol.\u00a0211, pp. 201\u2013210 (2008)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-540-87405-8_20","volume-title":"Graph Transformations","author":"K.H. Pennemann","year":"2008","unstructured":"Pennemann, K.H.: Resolution-like theorem proving for high-level conditions. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol.\u00a05214, pp. 289\u2013304. Springer, Heidelberg (2008)"},{"key":"3_CR21","series-title":"LNCS","first-page":"17","volume-title":"ICGT 2014","author":"L. Lambers","year":"2014","unstructured":"Lambers, L., Orejas, F.: Tableau-based reasoning for graph properties. In: Giese, H., K\u00f6nig, B. (eds.) ICGT 2014. LNCS, vol.\u00a08571, pp. 17\u201332. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09108-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,21]],"date-time":"2020-08-21T20:10:58Z","timestamp":1598040658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09108-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091075","9783319091082"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09108-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}