{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T13:45:46Z","timestamp":1764251146837},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540330950"},{"type":"electronic","value":"9783540330967"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11693024_11","type":"book-chapter","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T13:30:35Z","timestamp":1143552635000},"page":"146-161","source":"Crossref","is-referenced-by-count":20,"title":["Bisimulations for Untyped Imperative Objects"],"prefix":"10.1007","author":[{"given":"Vasileios","family":"Koutavas","sequence":"first","affiliation":[]},{"given":"Mitchell","family":"Wand","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8598-9","volume-title":"A Theory of Objects","author":"M. Abadi","year":"1996","unstructured":"Abadi, M., Cardelli, L.: A Theory of Objects. Springer-Verlag, Berlin (1996)"},{"key":"11_CR2","first-page":"65","volume-title":"Research Topics in Functional Programming","author":"S. Abramsky","year":"1990","unstructured":"Abramsky, S.: The lazy lambda calculus. In: Turner, D.A. (ed.) Research Topics in Functional Programming, pp. 65\u2013116. Addison-Wesley, Reading (1990)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/11417170_8","volume-title":"Typed Lambda Calculi and Applications","author":"N. Benton","year":"2005","unstructured":"Benton, N., Leperchey, B.: Relational reasoning in a nominal semantics for storage. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol.\u00a03461, pp. 86\u2013101. Springer, Heidelberg (2005)"},{"key":"11_CR4","unstructured":"Bierman, G., Parkinson, M., Pitts, A.: MJ: An imperative core calculus for Java and Java with effects. Technical Report 563, Cambridge University Computer Laboratory (April 2003)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-540-27836-8_39","volume-title":"Automata, Languages and Programming","author":"Y. Deng","year":"2004","unstructured":"Deng, Y., Sangiorgi, D.: Towards an algebraic theory of typed mobile processes. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 445\u2013456. Springer, Heidelberg (2004)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/3-540-48737-9_7","volume-title":"Formal Syntax and Semantics of Java","author":"M. Flatt","year":"1999","unstructured":"Flatt, M., Krishnamurthi, S., Felleisen, M.: A programmer\u2019s reduction semantics for classes and mixins. In: Formal Syntax and Semantics of Java, London, UK, pp. 241\u2013269. Springer-Verlag, Heidelberg (1999)"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/BFb0058024","volume-title":"Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science","author":"A.D. Gordon","year":"1997","unstructured":"Gordon, A.D., Hankin, P.D., Lassen, S.B.: Compilation and equivalence of imperative objects. In: Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science, London, UK, pp. 74\u201387. Springer-Verlag, Heidelberg (1997)"},{"key":"11_CR8","first-page":"386","volume-title":"Proceedings 23rd Annual ACM Symposium on Principles of Programming Languages","author":"A.D. Gordon","year":"1996","unstructured":"Gordon, A.D., Rees, G.D.: Bisimilarity for a first-order calculus of objects with subtyping. In: Proceedings 23rd Annual ACM Symposium on Principles of Programming Languages, pp. 386\u2013395. ACM Press, New York (1996)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Hennessy, M., Milner, R.: On observing nondeterminism and concurrency. In: ICALP, pp. 299\u2013309 (1980)","DOI":"10.1007\/3-540-10003-2_79"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of the ACM\u00a032, 137\u2013161 (1985)","journal-title":"Journal of the ACM"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Howe, D.J.: Equality in lazy computation systems. In: Proc. 4th IEEE Symposium on Logic in Computer Science, pp. 198\u2013203 (1989)","DOI":"10.1109\/LICS.1989.39174"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/3-540-57208-2_12","volume-title":"CONCUR\u201993","author":"C.B. Jones","year":"1993","unstructured":"Jones, C.B.: A pi-calculus semantics for an object-based design notation. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 158\u2013172. Springer, Heidelberg (1993)"},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0167-6423(02)00034-5","volume":"44","author":"J. Kleist","year":"2002","unstructured":"Kleist, J., Sangiorgi, D.: Imperative objects as mobile processes. Sci. Comput. Program.\u00a044(3), 293\u2013342 (2002)","journal-title":"Sci. Comput. Program."},{"key":"11_CR14","volume-title":"Proceedings 33rd Annual ACM Symposium on Principles of Programming Languages","author":"V. Koutavas","year":"2006","unstructured":"Koutavas, V., Wand, M.: Smaller bisimulations for reasoning about higher-order imperative programs. In: Proceedings 33rd Annual ACM Symposium on Principles of Programming Languages. ACM Press, New York (2006)"},{"issue":"1-2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0304-3975(97)00111-4","volume":"206","author":"X. Liu","year":"1998","unstructured":"Liu, X., Walker, D.: Partial confluence of processes and systems of objects. Theor. Comput. Sci.\u00a0206(1-2), 127\u2013162 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S0956796800000125","volume":"1","author":"I.A. Mason","year":"1991","unstructured":"Mason, I.A., Talcott, C.L.: Equivalence in functional languages with effects. Journal of Functional Programming\u00a01, 287\u2013327 (1991)","journal-title":"Journal of Functional Programming"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Sieber, K.: Towards fully abstract semantics for local variables: Preliminary report. In: Proceedings 15th Annual ACM Symposium on Principles of Programming Languages, pp. 191\u2013203 (1988)","DOI":"10.1145\/73560.73577"},{"key":"11_CR18","volume-title":"A Theory of Programming Language Semantics","author":"R. Milne","year":"1976","unstructured":"Milne, R., Strachey, C.: A Theory of Programming Language Semantics. Chapman and Hall, London (1976)"},{"key":"11_CR19","unstructured":"Morris Jr., J.H.: Lambda Calculus Models of Programming Languages. PhD thesis. MIT, Cambridge, MA (1968)"},{"key":"11_CR20","first-page":"227","volume-title":"Higher Order Operational Techniques in Semantics","author":"A. Pitts","year":"1998","unstructured":"Pitts, A., Stark, I.: Operational reasoning for functions with local state. In: Gordon, A., Pitts, A. (eds.) Higher Order Operational Techniques in Semantics, pp. 227\u2013273. Publications of the Newton Institute. Cambridge University Press, Cambridge (1998)"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0304-3975(95)00020-8","volume":"155","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: Locality and non-interleaving semantics in calculi for mobile processes. Theoretical Computer Science\u00a0155, 39\u201383 (1996)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"11_CR22","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0960129598002527","volume":"8","author":"D. Sangiorgi","year":"1998","unstructured":"Sangiorgi, D.: On the bisimulation proof method. Mathematical. Structures in Comp. Sci.\u00a08(5), 447\u2013479 (1998)","journal-title":"Mathematical. Structures in Comp. Sci."},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0084781","volume-title":"CONCUR \u201992","author":"D. Sangiorgi","year":"1992","unstructured":"Sangiorgi, D., Milner, R.: The problem of \u201cWeak Bisimulation up to\u201d. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 32\u201346. Springer, Heidelberg (1992)"},{"issue":"1","key":"11_CR24","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1006\/inco.1998.2711","volume":"143","author":"D. Sangiorgi","year":"1998","unstructured":"Sangiorgi, D.: An interpretation of typed objects into typed \u03c0-calculus. Inf. Comput.\u00a0143(1), 34\u201373 (1998)","journal-title":"Inf. Comput."},{"key":"11_CR25","first-page":"161","volume-title":"Proceedings 31st Annual ACM Symposium on Principles of Programming Languages","author":"E. Sumii","year":"2004","unstructured":"Sumii, E., Pierce, B.C.: A bisimulation for dynamic sealing. In: Proceedings 31st Annual ACM Symposium on Principles of Programming Languages, pp. 161\u2013172. ACM Press, New York (2004)"},{"key":"11_CR26","first-page":"63","volume-title":"Proceedings 32nd Annual ACM Symposium on Principles of Programming Languages","author":"E. Sumii","year":"2005","unstructured":"Sumii, E., Pierce, B.C.: A bisimulation for type abstraction and recursion. In: Proceedings 32nd Annual ACM Symposium on Principles of Programming Languages, pp. 63\u201374. ACM Press, New York (2005)"},{"issue":"2","key":"11_CR27","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1006\/inco.1995.1018","volume":"116","author":"D. Walker","year":"1995","unstructured":"Walker, D.: Objects in the \u03c0 -calculus. Inf. Comput.\u00a0116(2), 253\u2013271 (1995)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11693024_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T17:16:20Z","timestamp":1555521380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11693024_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540330950","9783540330967"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11693024_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}