{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:55Z","timestamp":1761611275208},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221456"},{"type":"electronic","value":"9783540247715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24771-5_5","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T17:41:39Z","timestamp":1294508499000},"page":"48-61","source":"Crossref","is-referenced-by-count":10,"title":["Checking the Shape Safety of Pointer Manipulations"],"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":"5_CR1","doi-asserted-by":"crossref","unstructured":"Bakewell, A.: Algorithms for checking the shape safety of graph transformation rules. Technical report, Available from [SPG] (2003)","DOI":"10.1007\/978-3-540-24771-5_5"},{"key":"5_CR2","unstructured":"Bakewell, A., Plump, D., Runciman, C.: Checking the shape safety of pointer manipulations \u2014extended abstract. In: Participant\u2019s Proceedings of the 7th International Seminar on Relational Methods in Computer Science (RelMiCS 7), Malente, Germany, pp. 144\u2013151. University of Kiel (2003), Available from [SPG]"},{"key":"5_CR3","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 [SPG]","DOI":"10.1007\/978-3-540-25959-6_3"},{"key":"5_CR4","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)"},{"issue":"1","key":"5_CR5","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":"5_CR6","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. I. In: Proc. Principles of Programming Languages (POPL 1997), pp. 27\u201339. ACM Press, New York (1997)"},{"issue":"2-3","key":"5_CR7","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":"5_CR8","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1017\/S0960129501003425","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":"Math. Struct. Comp. Science"},{"key":"5_CR9","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":"5_CR10","first-page":"14","volume-title":"Proc. Principles of Programming Languages (POPL 2001)","author":"S. Ishtiaq","year":"2001","unstructured":"Ishtiaq, S., O\u2019Hearn, P.W.: BI as an assertion language for mutable data structures. In: Proc. Principles of Programming Languages (POPL 2001), pp. 14\u201326. ACM Press, New York (2001)"},{"key":"5_CR11","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":"5_CR12","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":"5_CR13","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":"5_CR14","unstructured":"Safe Pointers by Graph Transformation, project webpage, http:\/\/www-users.cs.york.ac.uk\/~ajb\/spgt\/"},{"issue":"3","key":"5_CR15","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. ACM Transactions on Programming Languages and Systems\u00a024(3), 217\u2013298 (2002)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-45332-6_7","volume-title":"Types in Compilation","author":"D. Walker","year":"2001","unstructured":"Walker, D., Morrisett, G.: Alias types for recursive data structures. In: Harper, R. (ed.) TIC 2000. LNCS, vol.\u00a02071, pp. 177\u2013206. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Relational and Kleene-Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24771-5_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T03:28:17Z","timestamp":1637119697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24771-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221456","9783540247715"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24771-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}