{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:20:08Z","timestamp":1750306808696,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,10,27]],"date-time":"2013-10-27T00:00:00Z","timestamp":1382832000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,10,27]]},"DOI":"10.1145\/2541329.2541340","type":"proceedings-article","created":{"date-parts":[[2014,1,6]],"date-time":"2014-01-06T20:44:07Z","timestamp":1389041047000},"page":"49-60","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient and fully abstract routing of futures in object network overlays"],"prefix":"10.1145","author":[{"given":"Mads","family":"Dam","sequence":"first","affiliation":[{"name":"KTH Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karl","family":"Palmskog","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,10,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159955"},{"key":"e_1_3_2_1_2_1","volume-title":"A theory of distributed objects - asynchrony, mobility, groups, components","author":"Caromel D.","year":"2005","unstructured":"D. Caromel and L. Henrio . A theory of distributed objects - asynchrony, mobility, groups, components . Springer , 2005 . D. Caromel and L. Henrio. A theory of distributed objects - asynchrony, mobility, groups, components. Springer, 2005."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00359-0"},{"key":"e_1_3_2_1_4_1","volume-title":"Efficient and fully abstract routing of futures in object network overlays. Technical report","author":"Dam M.","year":"2013","unstructured":"M. Dam and K. Palmskog . Efficient and fully abstract routing of futures in object network overlays. Technical report , KTH Royal Institute of Technology , 2013 . URL http:\/\/urn.kb.se\/resolve?urn=urn:nbn:se:kth:diva-132193. M. Dam and K. Palmskog. Efficient and fully abstract routing of futures in object network overlays. Technical report, KTH Royal Institute of Technology, 2013. URL http:\/\/urn.kb.se\/resolve?urn=urn:nbn:se:kth:diva-132193."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2014.30"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2010.07.004"},{"key":"e_1_3_2_1_7_1","volume-title":"Post-Proceedings Selected Papers From The Coregrid Workshop On Grids, Clouds and P2P Computing","author":"Henrio L.","year":"2010","unstructured":"L. Henrio , M. U. Khan , N. Ranaldo , and E. Zimeo . First class futures: Specification and implementation of update strategies . In Post-Proceedings Selected Papers From The Coregrid Workshop On Grids, Clouds and P2P Computing , Aug 2010 . L. Henrio, M. U. Khan, N. Ranaldo, and E. Zimeo. First class futures: Specification and implementation of update strategies. In Post-Proceedings Selected Papers From The Coregrid Workshop On Grids, Clouds and P2P Computing, Aug 2010."},{"key":"e_1_3_2_1_8_1","series-title":"Lecture Notes in Computer Science","volume-title":"C. Julien and R. De Nicola","author":"Henrio L.","year":"2013","unstructured":"L. Henrio , F. Huet , and Z. Istv\u00e1n . Multi-threaded active objects . In C. Julien and R. De Nicola , editors, COORDINATION 2013 , volume 7890 of Lecture Notes in Computer Science . IFIP International Federation for Information Processing, Springer , June 2013. L. Henrio, F. Huet, and Z. Istv\u00e1n. Multi-threaded active objects. In C. Julien and R. De Nicola, editors, COORDINATION 2013, volume 7890 of Lecture Notes in Computer Science. IFIP International Federation for Information Processing, Springer, June 2013."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658941"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25271-6_8"},{"key":"e_1_3_2_1_11_1","series-title":"Electronic Proceedings in Theoretical Computer Science","first-page":"85","volume-title":"Proceedings 6th Interaction and Concurrency Experience, Florence, Italy, 6th","author":"Palmskog K.","year":"2013","unstructured":"K. Palmskog , M. Dam , A. Lundblad , and A. Jafari . ABS-NET: Fully decentralized runtime adaptation for distributed objects . In M. Carbone, I. Lanese, A. Lluch Lafuente, and A. Sokolova, editors, Proceedings 6th Interaction and Concurrency Experience, Florence, Italy, 6th June 2013 , volume 131 of Electronic Proceedings in Theoretical Computer Science , pages 85 -- 100 . Open Publishing Association , 2013. K. Palmskog, M. Dam, A. Lundblad, and A. Jafari. ABS-NET: Fully decentralized runtime adaptation for distributed objects. In M. Carbone, I. Lanese, A. Lluch Lafuente, and A. Sokolova, editors, Proceedings 6th Interaction and Concurrency Experience, Florence, Italy, 6th June 2013, volume 131 of Electronic Proceedings in Theoretical Computer Science, pages 85--100. Open Publishing Association, 2013."},{"key":"e_1_3_2_1_12_1","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1017\/CBO9780511792588.006","volume-title":"Advanced Topics in Bisimulation and Coinduction","author":"Pitts A. M.","year":"2011","unstructured":"A. M. Pitts . Howe's method for higher-order languages . In D. Sangiorgi and J. J. M. M. Rutten, editors, Advanced Topics in Bisimulation and Coinduction , volume 52 of Cambridge Tracts in Theoretical Computer Science , chapter 5, pages 197 -- 232 . Cambridge University Press , Cambridge, United Kingdom, Oct. 2011 . A. M. Pitts. Howe's method for higher-order languages. In D. Sangiorgi and J. J. M. M. Rutten, editors, Advanced Topics in Bisimulation and Coinduction, volume 52 of Cambridge Tracts in Theoretical Computer Science, chapter 5, pages 197--232. Cambridge University Press, Cambridge, United Kingdom, Oct. 2011."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1734206.1734209"},{"key":"e_1_3_2_1_15_1","volume-title":"Computer Networks","author":"Tanenbaum A.","year":"2002","unstructured":"A. Tanenbaum . Computer Networks . Prentice Hall Professional Technical Reference , 4 th edition, 2002 . A. Tanenbaum. Computer Networks. Prentice Hall Professional Technical Reference, 4th edition, 2002.","edition":"4"}],"event":{"name":"SPLASH '13: Conference on Systems, Programming, and Applications: Software for Humanity","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Indianapolis Indiana USA","acronym":"SPLASH '13"},"container-title":["Proceedings of the 2013 workshop on Programming based on actors, agents, and decentralized control"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2541329.2541340","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2541329.2541340","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:35:01Z","timestamp":1750232101000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2541329.2541340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,27]]},"references-count":14,"alternative-id":["10.1145\/2541329.2541340","10.1145\/2541329"],"URL":"https:\/\/doi.org\/10.1145\/2541329.2541340","relation":{},"subject":[],"published":{"date-parts":[[2013,10,27]]},"assertion":[{"value":"2013-10-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}