{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:27:21Z","timestamp":1725550041939},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291060"},{"type":"electronic","value":"9783540320241"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560586_11","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:08:27Z","timestamp":1129817307000},"page":"128-142","source":"Crossref","is-referenced-by-count":0,"title":["Safe Object Composition in the Presence of Subtyping"],"prefix":"10.1007","author":[{"given":"Lorenzo","family":"Bettini","sequence":"first","affiliation":[]},{"given":"Viviana","family":"Bono","sequence":"additional","affiliation":[]},{"given":"Silvia","family":"Likavec","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Bettini, L., Bono, V., Likavec, S.: A core calculus of mixin-based incomplete objects. In: Proc . FOOL, vol.\u00a011, pp. 29\u201341 (2004)","DOI":"10.1145\/1028664.1028753"},{"key":"11_CR2","first-page":"1258","volume-title":"Proc . SAC 2005, OOPS track","author":"L. Bettini","year":"2005","unstructured":"Bettini, L., Bono, V., Likavec, S.: Safe and Flexible Objects. In: Proc . SAC 2005, OOPS track, pp. 1258\u20131263. ACM Press, New York (2005)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/3-540-48743-3_3","volume-title":"ECOOP 1999 - Object-Oriented Programming","author":"V. Bono","year":"1999","unstructured":"Bono, V., Patel, A., Shmatikov, V.: A core calculus of classes and mixins. In: Guerraoui, R. (ed.) ECOOP 1999. LNCS, vol.\u00a01628, pp. 43\u201366. Springer, Heidelberg (1999)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Bono, V., Patel, A., Shmatikov, V., Mitchell, J.C.: A core calculus of classes and objects. In: Proc . MFPS 1999, vol.\u00a0220 (1999)","DOI":"10.1016\/S1571-0661(04)80065-3"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Crank, E., Felleisen, M.: Parameter-passing and the lambda calculus. In: Proc . POPL 1991, pp. 233\u2013244 (1991)","DOI":"10.1145\/99583.99616"},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(92)90014-7","volume":"103","author":"M. Felleisen","year":"1992","unstructured":"Felleisen, M., Hieb, R.: The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science\u00a0103(2), 235\u2013271 (1992)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"11_CR7","first-page":"3","volume":"1","author":"K. Fisher","year":"1994","unstructured":"Fisher, K., Honsell, F., Mitchell, J.C.: A lambda-calculus of objects and method specialization. Nordic J. of Computing\u00a01(1), 3\u201337 (1994)","journal-title":"Nordic J. of Computing"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/3-540-60249-6_40","volume-title":"Fundamentals of Computation Theory","author":"K. Fisher","year":"1995","unstructured":"Fisher, K., Mitchell, J.C.: A delegation-based object calculus with subtyping. In: Reichel, H. (ed.) FCT 1995. LNCS, vol.\u00a0965, pp. 42\u201361. Springer, Heidelberg (1995)"},{"key":"11_CR9","volume-title":"Design Patterns: Elements of Reusable Object-Oriented Software","author":"E. Gamma","year":"1995","unstructured":"Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, Reading (1995)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/BFb0035784","volume-title":"Automata, Languages and Programming","author":"I. Mason","year":"1989","unstructured":"Mason, I., Talcott, C.: Programming, transforming, and proving with function abstractions and memories. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol.\u00a0372, pp. 574\u2013588. Springer, Heidelberg (1989)"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.2000.2925","volume":"172","author":"J.G. Riecke","year":"2002","unstructured":"Riecke, J.G., Stone, C.A.: Privacy via subsumption. Information and Computation\u00a0172(1), 2\u201328 (2002); A preliminary version appeared in FOOL5","journal-title":"Information and Computation"},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/inco.1994.1093","volume":"115","author":"A. Wright","year":"1994","unstructured":"Wright, A., Felleisen, M.: A syntactic approach to type soundness. Information and Computation\u00a0115(1), 38\u201394 (1994)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560586_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:50:31Z","timestamp":1605642631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560586_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291060","9783540320241"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11560586_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}