{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T11:43:09Z","timestamp":1749728589813},"publisher-location":"Berlin, Heidelberg","reference-count":18,"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_10","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T14:32:34Z","timestamp":1284993154000},"page":"139-154","source":"Crossref","is-referenced-by-count":11,"title":["A Hoare Calculus for 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":"10_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84882-745-5","volume-title":"Verification of Sequential and Concurrent Programs","author":"K.R. Apt","year":"2009","unstructured":"Apt, K.R., de Boer, F.S., Olderog, E.-R.: Verification of Sequential and Concurrent Programs, 3rd edn. Springer, Heidelberg (2009)","edition":"3"},{"issue":"7","key":"10_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":"10_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":"Proc. Architecting Dependable Systems VI (WADS 2008)","author":"D. Bisztray","year":"2009","unstructured":"Bisztray, D., Heckel, R., Ehrig, H.: Compositional verification of architectural refactorings. In: de Lemos, R. (ed.) Architecting Dependable Systems VI. LNCS, vol.\u00a05835, pp. 308\u2013333. Springer, Heidelberg (2009)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/11841883_27","volume-title":"Graph Transformations","author":"R. Gei\u00df","year":"2006","unstructured":"Gei\u00df, R., Batz, G.V., Grund, D., Hack, S., Szalkowski, A.M.: GrGen: A fast SPO-based graph rewriting tool. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol.\u00a04178, pp. 383\u2013397. Springer, Heidelberg (2006)"},{"issue":"2","key":"10_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":"10_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":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-45315-6_15","volume-title":"Foundations of Software Science and Computation Structures","author":"A. Habel","year":"2001","unstructured":"Habel, A., Plump, D.: Computational completeness of programming languages based on graph transformation. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol.\u00a02030, pp. 230\u2013245. Springer, Heidelberg (2001)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-45832-8_12","volume-title":"Graph Transformation","author":"A. Habel","year":"2002","unstructured":"Habel, A., Plump, D.: Relabelling in graph transformation. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol.\u00a02505, pp. 135\u2013147. Springer, Heidelberg (2002)"},{"issue":"10","key":"10_CR9","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C.A.R. Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Communications of the ACM\u00a012(10), 576\u2013580 (1969)","journal-title":"Communications of the ACM"},{"key":"10_CR10","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":"10_CR11","unstructured":"Manning, G., Plump, D.: The GP programming system. In: Proc. Graph Transformation and Visual Modelling Techniques (GT-VMT 2008). Electronic Communications of the EASST, vol.\u00a010 (2008)"},{"key":"10_CR12","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1145\/337180.337620","volume-title":"Proc. International Conference on Software Engineering (ICSE 2000)","author":"U. Nickel","year":"2000","unstructured":"Nickel, U., Niere, J., Z\u00fcndorf, A.: The FUJABA environment. In: Proc. International Conference on Software Engineering (ICSE 2000), pp. 742\u2013745. ACM Press, New York (2000)"},{"key":"10_CR13","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.) Algebraic Informatics. LNCS, vol.\u00a05725, pp. 99\u2013122. Springer, Heidelberg (2009)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Plump, D., Steinert, S.: The semantics of graph programs. In: Proc. Rule-Based Programming (RULE 2009). EPTCS, vol.\u00a021, pp. 27\u201338 (2010)","DOI":"10.4204\/EPTCS.21.3"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Poskitt, C.M., Plump, D.: A Hoare calculus for graph programs (long version) (2010), http:\/\/www.cs.york.ac.uk\/plasma\/publications\/pdf\/PoskittPlump.ICGT.10.Long.pdf","DOI":"10.1007\/978-3-642-15928-2_10"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"10_CR17","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1142\/9789812815149_0013","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation, ch. 13","author":"A. Sch\u00fcrr","year":"1999","unstructured":"Sch\u00fcrr, A., Winter, A., Z\u00fcndorf, A.: The PROGRES approach: Language and environment. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, ch. 13, vol.\u00a02, pp. 487\u2013550. World Scientific, Singapore (1999)"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/978-3-540-25959-6_35","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"G. Taentzer","year":"2004","unstructured":"Taentzer, G.: AGG: A graph transformation environment for modeling and validation of software. In: Pfaltz, J.L., Nagl, M., B\u00f6hlen, B. (eds.) AGTIVE 2003. LNCS, vol.\u00a03062, pp. 446\u2013453. 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-15928-2_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T11:52:08Z","timestamp":1685793128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15928-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642159275","9783642159282"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15928-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}