{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:53Z","timestamp":1761611273098},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221203"},{"type":"electronic","value":"9783540259596"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25959-6_3","type":"book-chapter","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T15:09:47Z","timestamp":1287846587000},"page":"30-44","source":"Crossref","is-referenced-by-count":12,"title":["Specifying Pointer Structures by Graph Reduction"],"prefix":"10.1007","author":[{"given":"Adam","family":"Bakewell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Detlef","family":"Plump","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin","family":"Runciman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Safe Pointers by Graph Transformation, project webpage, http:\/\/www-users.cs.york.ac.uk\/~ajb\/spgt\/"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Bakewell, A., Plump, D., Runciman, C.: Specifying pointer structures by graph reduction. Technical Report YCS-2003-367, Department of Computer Science, University of York (2003), Available from [1]","DOI":"10.1007\/978-3-540-25959-6_3"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24771-5_5","volume-title":"Relational and Kleene-Algebraic Methods in Computer Science","author":"A. Bakewell","year":"2004","unstructured":"Bakewell, A., Plump, D., Runciman, C.: Checking the shape safety of pointer manipulations. In: Berghammer, R., M\u00f6ller, B., Struth, G. (eds.) RelMiCS 2003. LNCS, vol.\u00a03051, Springer, Heidelberg (2004)"},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1142\/9789812815149_0003","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"R. Bardohl","year":"1999","unstructured":"Bardohl, R., Minas, M., Sch\u00fcrr, A., Taentzer, G.: Application of Graph Transformation to Visual Languages. In: Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a02, pp. 105\u2013180. World Scientific, Singapore (1999)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-49099-X_2","volume-title":"Programming Languages and Systems","author":"M. Benedikt","year":"1999","unstructured":"Benedikt, M., Reps, T., Sagiv, M.: A decidable logic for describing linked data structures. In: Swierstra, S.D. (ed.) ESOP 1999. LNCS, vol.\u00a01576, pp. 2\u201319. Springer, Heidelberg (1999)"},{"key":"3_CR6","volume-title":"Introduction to algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. MIT Press, Cambridge (1990)"},{"issue":"1","key":"3_CR7","first-page":"117","volume":"12","author":"F. Drewes","year":"2003","unstructured":"Drewes, F., Hoffmann, B., Minas, M.: Context-exploiting shapes for diagram transformation. Machine Graphics and Vision\u00a012(1), 117\u2013132 (2003)","journal-title":"Machine Graphics and Vision"},{"key":"3_CR8","first-page":"27","volume-title":"Proc. Principles of Programming Languages (POPL 1997)","author":"P. Fradet","year":"1997","unstructured":"Fradet, P., Le M\u00e9tayer, D.: Shape types. In: Proc. Principles of Programming Languages (POPL 1997), pp. 27\u201339. ACM Press, New York (1997)"},{"issue":"2-3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0167-6423(97)00023-3","volume":"31","author":"P. Fradet","year":"1998","unstructured":"Fradet, P., Le M\u00e9tayer, D.: Structured Gamma. Science of Computer Programming\u00a031(2-3), 263\u2013289 (1998)","journal-title":"Science of Computer Programming"},{"key":"3_CR10","first-page":"637","volume":"11","author":"A. Habel","year":"2001","unstructured":"Habel, A., M\u00fcller, J., Plump, D.: Double-pushout graph transformation revisited. Math. Struct. Comp. Science\u00a011, 637\u2013688 (2001)","journal-title":"Comp. Science"},{"key":"3_CR11","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)"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1145\/143095.143138","volume-title":"Proc. ACM SIGPLAN 1992 Conference on Programming Langauge Design and Implementation (PLDI 1992)","author":"L.J. Hendren","year":"1992","unstructured":"Hendren, L.J., Hummel, J., Nicolau, A.: Abstractions for recursive pointer data structures: Improving the analysis and transformation of imperative programs. In: Proc. ACM SIGPLAN 1992 Conference on Programming Langauge Design and Implementation (PLDI 1992), pp. 249\u2013260. ACM Press, New York (1992)"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1017\/S0956796800003701","volume":"10","author":"R. Hinze","year":"2000","unstructured":"Hinze, R.: Functional Pearl: Perfect trees and bit-reversal permutations. Journal of Functional Programming\u00a010(3), 305\u2013317 (2000)","journal-title":"Journal of Functional Programming"},{"key":"3_CR14","first-page":"196","volume-title":"Proc. Principles of Programming Languages (POPL 1993)","author":"N. Klarlund","year":"1993","unstructured":"Klarlund, N., Schwartzbach, M.I.: Graph types. In: Proc. Principles of Programming Languages (POPL 1993), pp. 196\u2013205. ACM Press, New York (1993)"},{"key":"3_CR15","first-page":"17","volume-title":"Proc. Principles of Programming Languages (POPL 2002)","author":"V. Kuncak","year":"2002","unstructured":"Kuncak, V., Lam, P., Rinard, M.: Role analysis. In: Proc. Principles of Programming Languages (POPL 2002), pp. 17\u201332. ACM Press, New York (2002)"},{"key":"3_CR16","volume-title":"Proc. ACM SIGPLAN 2001 Conference on Programming Langauge Design and Implementation (PLDI 2001)","author":"A. M\u00f8ller","year":"2001","unstructured":"M\u00f8ller, A., Schwartzbach, M.I.: The pointer assertion logic engine. In: Proc. ACM SIGPLAN 2001 Conference on Programming Langauge Design and Implementation (PLDI 2001), ACM Press, New York (2001)"},{"key":"3_CR17","first-page":"201","volume-title":"Term Graph Rewriting: Theory and Practice","author":"D. Plump","year":"1993","unstructured":"Plump, D.: Hypergraph rewriting: Critical pairs and undecidability of confluence. In: Sleep, M.R., Plasmeijer, M.J., van Eekelen, M.C. (eds.) Term Graph Rewriting: Theory and Practice, ch. 15, pp. 201\u2013213. John Wiley & Sons Ltd., Chichester (1993)"},{"key":"3_CR18","doi-asserted-by":"crossref","first-page":"11","DOI":"10.21099\/tkbjm\/1496158502","volume":"2","author":"T. Uesu","year":"1978","unstructured":"Uesu, T.: A system of graph grammars which generates all recursively enumerable sets of labelled graphs. Tsukuba J. Math.\u00a02, 11\u201326 (1978)","journal-title":"Tsukuba J. Math."}],"container-title":["Lecture Notes in Computer Science","Applications of Graph Transformations with Industrial Relevance"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25959-6_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,12]],"date-time":"2021-11-12T15:18:30Z","timestamp":1636730310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25959-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221203","9783540259596"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25959-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}