{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:59:54Z","timestamp":1725569994237},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642171635"},{"type":"electronic","value":"9783642171642"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17164-2_15","type":"book-chapter","created":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T05:54:39Z","timestamp":1290146079000},"page":"204-221","source":"Crossref","is-referenced-by-count":5,"title":["Data Structure Fusion"],"prefix":"10.1007","author":[{"given":"Peter","family":"Hawkins","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Aiken","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kathleen","family":"Fisher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Rinard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mooly","family":"Sagiv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","first-page":"47","volume-title":"SIGMOD","author":"C. Beeri","year":"1977","unstructured":"Beeri, C., Fagin, R., Howard, J.H.: A complete axiomatization for functional and multivalued dependencies in database relations. In: SIGMOD, pp. 47\u201361. ACM, New York (1977)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-540-73368-3_22","volume-title":"Computer Aided Verification","author":"J. Berdine","year":"2007","unstructured":"Berdine, J., Calcagno, C., Cook, B., Distefano, D., O\u2019Hearn, P., Wies, T., Yang, H.: Shape analysis for composite data structures. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 178\u2013192. Springer, Heidelberg (2007)"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/11531142_12","volume-title":"ECOOP 2005 - Object-Oriented Programming","author":"G. Bierman","year":"2005","unstructured":"Bierman, G., Wren, A.: First-class relationships in an object-oriented language. In: Black, A.P. (ed.) ECOOP 2005. LNCS, vol.\u00a03586, pp. 262\u2013286. Springer, Heidelberg (2005)"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Cai, J., Paige, R.: Look ma, no hashing, and no arrays neither. In: POPL, pp. 143\u2013154 (1991)","DOI":"10.1145\/99583.99605"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Chlipala, A.J., Malecha, J.G., Morrisett, G., Shinnar, A., Wisnesky, R.: Effective interactive proofs for higher-order imperative programs. In: ICFP, pp. 79\u201390 (2009)","DOI":"10.1145\/1596550.1596565"},{"issue":"6","key":"15_CR6","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1145\/362384.362685","volume":"13","author":"E.F. Codd","year":"1970","unstructured":"Codd, E.F.: A relational model of data for large shared data banks. Commun. ACM\u00a013(6), 377\u2013387 (1970)","journal-title":"Commun. ACM"},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/357062.357064","volume":"1","author":"R.B.K. Dewar","year":"1979","unstructured":"Dewar, R.B.K., Grand, A., Liu, S.-C., Schwartz, J.T., Schonberg, E.: Programming by refinement, as exemplified by the SETL representation sublanguage. ACM Trans. Program. Lang. Syst.\u00a01(1), 27\u201349 (1979)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Distefano, D., Parkinson, M.J.: jStar: towards practical verification for Java. In: OOPSLA, pp. 213\u2013226 (2008)","DOI":"10.1145\/1449955.1449782"},{"key":"15_CR9","unstructured":"Fahndrich, M., Leino, R.: Heap monotonic typestates. In: Int. Work. on Alias Confinement and Ownership (July 2003)"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Hawkins, P., Aiken, A., Fisher, K., Rinard, M., Sagiv, M.: Data structure fusion, full (2010), http:\/\/theory.stanford.edu\/~hawkinsp\/papers\/rel-full.pdf","DOI":"10.1007\/978-3-642-17164-2_15"},{"key":"15_CR11","first-page":"196","volume-title":"POPL","author":"N. Klarlund","year":"1993","unstructured":"Klarlund, N., Schwartzbach, M.I.: Graph types. In: POPL, Charleston, South Carolina, pp. 196\u2013205. ACM, New York (1993)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-11319-2_17","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"J. Kreiker","year":"2010","unstructured":"Kreiker, J., Seidl, H., Vojdani, V.: Shape analysis of low-level C with overlapping structures. In: Barthe, G., Hermenegildo, M. (eds.) VMCAI 2010. LNCS, vol.\u00a05944, pp. 214\u2013230. Springer, Heidelberg (2010)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Kuncak, V., Lam, P., Rinard, M.: Role analysis. In: POPL, pp. 17\u201332 (2002)","DOI":"10.1145\/503272.503276"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-540-30579-8_28","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P. Lam","year":"2005","unstructured":"Lam, P., Kuncak, V., Rinard, M.C.: Generalized typestate checking for data structure consistency. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol.\u00a03385, pp. 430\u2013447. Springer, Heidelberg (2005)"},{"key":"15_CR15","first-page":"706","volume-title":"SIGMOD","author":"E. Meijer","year":"2006","unstructured":"Meijer, E., Beckman, B., Bierman, G.: LINQ: Reconciling objects, relations and XML in the .NET framework. In: SIGMOD, p. 706. ACM, New York (2006)"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Olston, C., et al.: Pig Latin: A not-so-foreign language for data processing. In: SIGMOD (June 2008)","DOI":"10.1145\/1376616.1376726"},{"issue":"2","key":"15_CR17","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0747-7171(87)80066-4","volume":"4","author":"R. Paige","year":"1987","unstructured":"Paige, R., Henglein, F.: Mechanical translation of set theoretic problem specifications into efficient RAM code. J. Sym. Com.\u00a04(2), 207\u2013232 (1987)","journal-title":"J. Sym. Com."},{"key":"15_CR18","unstructured":"J.\u00a0C. Reynolds. Separation logic: A logic for shared mutable data structures. In LICS (2002) (invited paper)"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/1244381.1244394","volume-title":"PEPM","author":"T. Rothamel","year":"2007","unstructured":"Rothamel, T., Liu, Y.A.: Efficient implementation of tuple pattern based retrieval. In: PEPM, pp. 81\u201390. ACM, New York (2007)"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Schonberg, E., Schwartz, J.T., Sharir, M.: Automatic data structure selection in SETL. In: POPL, pp. 197\u2013210 (1979)","DOI":"10.1145\/567752.567771"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Shacham, O., Vechev, M., Yahav, E.: Chameleon: adaptive selection of collections. In: PLDI, pp. 408\u2013418 (2009)","DOI":"10.1145\/1542476.1542522"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Zee, K., Kuncak, V., Rinard, M.C.: Full functional verification of linked data structures. In: PLDI, pp. 349\u2013361 (2008)","DOI":"10.1145\/1375581.1375624"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17164-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T07:18:11Z","timestamp":1559805491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17164-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642171635","9783642171642"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17164-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}