{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:56:56Z","timestamp":1762459016242},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642336539"},{"type":"electronic","value":"9783642336546"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33654-6_30","type":"book-chapter","created":{"date-parts":[[2012,9,18]],"date-time":"2012-09-18T03:47:41Z","timestamp":1347940061000},"page":"420-422","source":"Crossref","is-referenced-by-count":8,"title":["Verification of Graph Programs"],"prefix":"10.1007","author":[{"given":"Christopher M.","family":"Poskitt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Apt, K.R., de Boer, F.S., Olderog, E.-R.: Verification of Sequential and Concurrent Programs, 3rd edn. Springer (2009)","DOI":"10.1007\/978-1-84882-745-5"},{"issue":"7","key":"30_CR2","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. Information and Computation\u00a0206(7), 869\u2013907 (2008)","journal-title":"Information and Computation"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-642-10248-6_13","volume-title":"Architecting Dependable Systems VI","author":"D. Bisztray","year":"2009","unstructured":"Bisztray, D., Heckel, R., Ehrig, H.: Compositional Verification of Architectural Refactorings. In: de Lemos, R., Fabre, J.-C., Gacek, C., Gadducci, F., ter Beek, M. (eds.) Architecting Dependable Systems VI. LNCS, vol.\u00a05835, pp. 308\u2013333. Springer, Heidelberg (2009)"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, ch.\u00a05. Elsevier (1990)","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"issue":"2","key":"30_CR5","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"},{"key":"30_CR6","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":"30_CR7","unstructured":"Habel, A., Radke, H.: Expressiveness of graph conditions with variables. In: Proc. Colloquium on Graph and Model Transformation on the Occasion of the 65th Birthday of Hartmut Ehrig. Electronic Communications of the EASST, vol.\u00a030 (2010)"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-15928-2_8","volume-title":"Graph Transformations","author":"B. K\u00f6nig","year":"2010","unstructured":"K\u00f6nig, B., Esparza, J.: Verification of Graph Transformation Systems with Context-Free Specifications. In: Ehrig, H., Rensink, A., Rozenberg, G., Sch\u00fcrr, A. (eds.) ICGT 2010. LNCS, vol.\u00a06372, pp. 107\u2013122. Springer, Heidelberg (2010)"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-87405-8_21","volume-title":"Graph Transformations","author":"B. K\u00f6nig","year":"2008","unstructured":"K\u00f6nig, B., Kozioura, V.: Towards the Verification of Attributed Graph Transformation Systems. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol.\u00a05214, pp. 305\u2013320. Springer, Heidelberg (2008)"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-540-87405-8_19","volume-title":"Graph Transformations","author":"F. Orejas","year":"2008","unstructured":"Orejas, F.: Attributed Graph Constraints. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol.\u00a05214, pp. 274\u2013288. Springer, Heidelberg (2008)"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-03564-7_6","volume-title":"Algebraic Informatics","author":"D. Plump","year":"2009","unstructured":"Plump, D.: The Graph Programming Language GP. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2009. LNCS, vol.\u00a05725, pp. 99\u2013122. Springer, Heidelberg (2009)"},{"key":"30_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-15928-2_10","volume-title":"Graph Transformations","author":"C.M. Poskitt","year":"2010","unstructured":"Poskitt, C.M., Plump, D.: A Hoare Calculus for Graph Programs. In: Ehrig, H., Rensink, A., Rozenberg, G., Sch\u00fcrr, A. (eds.) ICGT 2010. LNCS, vol.\u00a06372, pp. 139\u2013154. Springer, Heidelberg (2010)"},{"issue":"1-2","key":"30_CR13","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":"30_CR14","unstructured":"Poskitt, C.M., Plump, D., Habel, A.: A many-sorted logic for graph programs (2012) (submitted for publication)"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-30203-2_17","volume-title":"Graph Transformations","author":"A. Rensink","year":"2004","unstructured":"Rensink, A., Schmidt, \u00c1., Varr\u00f3, D.: Model Checking Graph Transformations: A Comparison of Two Approaches. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol.\u00a03256, pp. 226\u2013241. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33654-6_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:17:54Z","timestamp":1620130674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33654-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642336539","9783642336546"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33654-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}