{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,18]],"date-time":"2022-09-18T17:27:00Z","timestamp":1663522020537},"publisher-location":"Berlin, Heidelberg","reference-count":50,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540440444","type":"print"},{"value":"9783540456995","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45699-6_6","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T21:00:01Z","timestamp":1179781201000},"page":"268-332","source":"Crossref","is-referenced-by-count":38,"title":["The Join Calculus: A Language for Distributed Mobile Programming"],"prefix":"10.1007","author":[{"given":"C\u00e9dric","family":"Fournet","sequence":"first","affiliation":[]},{"given":"Georges","family":"Gonthier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,20]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi, C. Fournet, and G. Gonthier. Secure implementation of channel abstractions. In Proceedings of LICS\u2019 98, pages 105\u2013116. IEEE, June 1998.","DOI":"10.1109\/LICS.1998.705647"},{"key":"6_CR2","unstructured":"M. Abadi, C. Fournet, and G. Gonthier. Secure communications processing for distributed languages. In Proceedings of the 1999 IEEE Symposium on Security and Privacy, pages 74\u201388, May 1999."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"M. Abadi, C. Fournet, and G. Gonthier. Authentication primitives and their compilation. In Proceedings of POPL\u201900, pages 302\u2013315. ACM, Jan. 2000.","DOI":"10.1145\/325694.325734"},{"key":"6_CR4","unstructured":"M. Abadi, C. Fournet, and G. Gonthier. Secure implementation of channel abstractions. Information and Computation, 2000. To appear. Manuscript available from http:\/\/research.microsoft.com\/ fournet. Subsumes [1] and [2]."},{"issue":"1","key":"6_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S095679689700261X","volume":"7","author":"G. Agha","year":"1997","unstructured":"G. Agha, I. Mason, S. Smith, and C. L. Talcott. A foundation for actor computation. Journal of Functional Programming, 7(1):1\u201372, Jan. 1997.","journal-title":"Journal of Functional Programming"},{"key":"6_CR6","series-title":"Lect Notes Comput Sci","volume-title":"COORDINATION\u201997","author":"R. M. Amadio","year":"1997","unstructured":"R. M. Amadio. An asynchronous model of locality, failure, and process mobility. In COORDINATION\u201997, volume 1282 of LNCS. Springer-Verlag, 1997."},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0304-3975(97)00223-5","volume":"195","author":"R. M. Amadio","year":"1998","unstructured":"R. M. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous \u03c0-calculus. Theoretical Computer Science, 195(2):291\u2013324, 1998.","journal-title":"Theoretical Computer Science"},{"key":"6_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/3-540-58715-2_126","volume-title":"Proceedings of the 14th Foundations of Software Technology and Theoretical Computer Science Conference (FST-TCS\u2019 94)","author":"R. M. Amadio","year":"1994","unstructured":"R. M. Amadio and S. Prasad. Localities and failures. In P. Thiagarajan, editor, Proceedings of the 14th Foundations of Software Technology and Theoretical Computer Science Conference (FST-TCS\u2019 94), volume 880 of LNCS, pages 205\u2013216. Springer-Verlag, 1994."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0167-6423(90)90044-E","volume":"15","author":"J.-P. Ban\u00e2tre","year":"1990","unstructured":"J.-P. Ban\u00e2tre and D. L. M\u00e9tayer. The Gamma model and its discipline of programming. Science of Computer Programming, 15:55\u201377, 1990.","journal-title":"Science of Computer Programming"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","volume":"96","author":"G. Berry","year":"1992","unstructured":"G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217\u2013248, 1992.","journal-title":"Theoretical Computer Science"},{"issue":"1\u20132","key":"6_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(97)00125-4","volume":"198","author":"M. Boreale","year":"1998","unstructured":"M. Boreale and D. Sangiorgi. Some congruence properties for \u03c0-calculus bisimilarities. Theoretical Computer Science, 198(1\u20132):159\u2013176, 1998.","journal-title":"Theoretical Computer Science"},{"key":"6_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3-540-60218-6_23","volume-title":"6th International Conference on Concurrency Theory (CONCUR\u201995)","author":"E. Brinksma","year":"1995","unstructured":"E. Brinksma, A. Rensink, and W. Vogler. Fair testing. In I. Lee and S. A. Smolka, editors, 6th International Conference on Concurrency Theory (CONCUR\u201995), volume 962 of LNCS, pages 313\u2013327. Springer-Verlag, 1995."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"E. Brinksma, A. Rensink, and W. Vogler. Applications of fair testing. In R. Gotzhein and J. Bredereke, editors, Formal Description Techniques IX: Theory, Applications and Tools, volume IX. Chapman and Hall, 1996.","DOI":"10.1007\/978-0-387-35079-0_9"},{"key":"6_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/BFb0053547","volume-title":"Proceedings of FoSSaCS\u201998","author":"L. Cardelli","year":"1998","unstructured":"L. Cardelli and A. Gordon. Mobile ambients. In Proceedings of FoSSaCS\u201998, volume 1378 of LNCS, pages 140\u2013155. Springer-Verlag, 1998."},{"key":"6_CR15","unstructured":"S. Conchon and F. Le Fessant. Jocaml: Mobile agents for objective-caml. In ASA\/MA\u201999, pages 22\u201329. IEEE Computer Society, Oct. 1999."},{"key":"6_CR16","series-title":"PhD thesis","volume-title":"The Join-Calculus: a Calculus for Distributed Mobile Programming","author":"C. Fournet","year":"1998","unstructured":"C. Fournet. The Join-Calculus: a Calculus for Distributed Mobile Programming. PhD thesis, Ecole Polytechnique, Palaiseau, Nov. 1998. INRIA TU-0556. Also available from http:\/\/research.microsoft.com\/fournet ."},{"key":"6_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1007\/BFb0055107","volume-title":"Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP\u2019 98)","author":"C. Fournet","year":"1998","unstructured":"C. Fournet and G. Gonthier. A hierarchy of equivalences for asynchronous calculi (extended abstract). In Larsen et al. S. Skyum, and G. Winskel, editors. Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP\u2019 98), volume 1443 of LNCS, Aalborg, Denmark, July 1998. Springer-Verlag [29], pages 844\u2013855. Full paper available from http:\/\/research.microsoft.com\/fournet ."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"C. Fournet and C. Laneve. Bisimulations in the join-calculus. To appear in TCS, available from http:\/\/research.microsoft.com\/fournet , Oct. 2000.","DOI":"10.1007\/3-540-44450-5_32"},{"key":"6_CR19","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of IFIP TCS 2000","author":"C. Fournet","year":"2000","unstructured":"C. Fournet, J.-J. L\u00e9vy, and A. Schmitt. An asynchronous, distributed implementation of mobile ambients. In J. van Leeuwen, O. Watanabe, M. Hagiya, P. Mosses, and T. Ito, editors, Proceedings of IFIP TCS 2000, volume 1872 of LNCS. IFIP TC1, Springer-Verlag, Aug. 2000. An extended report is available from http:\/\/research.microsoft.com\/fournet ."},{"key":"6_CR20","unstructured":"C. Fournet and L. Maranget. The join-calculus language (version 1.03 beta). Source distribution and documentation available from http:\/\/join.inria.fr\/ , June 1997."},{"key":"6_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","volume-title":"4th International Conference on Concurrency Theory (CONCUR\u201993)","author":"R. Glabbeek","year":"1993","unstructured":"R. Glabbeek. The linear time\u2014branching time spectrum II; the semantics of sequential systems with silent moves (extended abstract). In E. Best, editor, 4th International Conference on Concurrency Theory (CONCUR\u201993), volume 715 of LNCS, pages 66\u201381. Springer-Verlag, 1993."},{"key":"6_CR22","unstructured":"M. Hennessy and J. Riely. A typed language for distributed mobile processes. In Proceedings of POPL\u2019 98, pages 378\u2013390. ACM, Jan. 1998."},{"key":"6_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-55613-3_2","volume-title":"Proceedings of the ECOOP\u201991 Workshop on Object-Based Concurrent Computing","author":"K. Honda","year":"1992","unstructured":"K. Honda and M. Tokoro. On asynchronous communication semantics. In P. Wegner, M. Tokoro, and O. Nierstrasz, editors, Proceedings of the ECOOP\u201991 Workshop on Object-Based Concurrent Computing, volume 612 of LNCS, pages 21\u201351. Springer-Verlag, 1992."},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"K. Honda and N. Yoshida. Combinatory representation of mobile processes. In Proceedings of POPL\u2019 94, pages 348\u2013360, 1994.","DOI":"10.1145\/174675.177953"},{"issue":"2","key":"6_CR25","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","volume":"152","author":"K. Honda","year":"1995","unstructured":"K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Computer Science, 152(2):437\u2013486, 1995.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"6_CR26","first-page":"20","volume":"3","author":"E. Jul","year":"1989","unstructured":"E. Jul. Migration of light-weight processes in emerald. IEEE Operating Sys. Technical Committee Newsletter, Special Issue on Process Migration, 3(1):20, 1989.","journal-title":"IEEE Operating Sys. Technical Committee Newsletter, Special Issue on Process Migration"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"E. Jul, H. Levy, N. Hutchinson, and A. Black. Fine-grained mobility in the emerald system. In Proceedings of the 11th ACM Symposium on Operating Systems Principles, pages 62\u201374, November 1987.","DOI":"10.1145\/41457.37511"},{"key":"6_CR28","unstructured":"C. Laneve. May and must testing in the join-calculus. Technical Report UBLCS 96-04, University of Bologna, Mar. 1996. Revised: May 1996."},{"key":"6_CR29","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP\u2019 98)","year":"1998","unstructured":"K. Larsen, S. Skyum, and G. Winskel, editors. Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP\u2019 98), volume 1443 of LNCS, Aalborg, Denmark, July 1998. Springer-Verlag."},{"key":"6_CR30","unstructured":"F. Le Fessant. The JoCAML system prototype (beta). Software and documentation available from http:\/\/pauillac.inria.fr\/jocaml , 1998."},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"F. Le Fessant and L. Maranget. Compiling join-patterns. In U. Nestmann and B. C. Pierce, editors, HLCL\u2019 98: High-Level Concurrent Languages, volume 16(3) of Electronic Notes in Theoretical Computer Science, Nice, France, Sept. 1998. Elsevier Science Publishers. To appear.","DOI":"10.1016\/S1571-0661(04)00143-4"},{"key":"6_CR32","unstructured":"X. Leroy and al. The Objective CAML system 3.01. Software and documentation available from http:\/\/caml.inria.fr ."},{"key":"6_CR33","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1007\/BFb0055108","volume-title":"Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP\u2019 98)","author":"M. Merro","year":"1998","unstructured":"M. Merro and D. Sangiorgi. On asynchrony in name-passing calculi. In LarsenS. Skyum, and G. Winskel, editors. Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP\u2019 98), volume 1443 of LNCS, Aalborg, Denmark, July 1998. Springer-Verlag et al. [29], pages 856\u2013867."},{"key":"6_CR34","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R. Milner","year":"1980","unstructured":"R. Milner. A Calculus of Communicating Systems, volume 92 of LNCS. Springer-Verlag, 1980."},{"key":"6_CR35","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, New York, 1989."},{"key":"6_CR36","volume-title":"Communication and Mobile Systems: the \u03c0-Calculus","author":"R. Milner","year":"1999","unstructured":"R. Milner. Communication and Mobile Systems: the \u03c0-Calculus. Cambridge University Press, Cambridge, 1999."},{"key":"6_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, parts I and II. Information and Computation, 100:1\u201340 and 41-77, Sept. 1992.","journal-title":"Information and Computation"},{"key":"6_CR38","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/3-540-55719-9_114","volume-title":"Proceedings of ICALP\u201992","author":"R. Milner","year":"1992","unstructured":"R. Milner and D. Sangiorgi. Barbed bisimulation. In W. Kuich, editor, Proceedings of ICALP\u201992, volume 623 of LNCS, pages 685\u2013695. Springer-Verlag, 1992."},{"key":"6_CR39","unstructured":"J. H. Morris, Jr. Lambda-Calculus Models of Programming Languages. Ph. D. dissertation, MIT, Dec. 1968. Report No. MAC-TR-57."},{"key":"6_CR40","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of ICALP\u2019 95","author":"V. Natarajan","year":"1995","unstructured":"V. Natarajan and R. Cleaveland. Divergence and fair testing. In Proceedings of ICALP\u2019 95, volume 944 of LNCS. Springer-Verlag, 1995."},{"key":"6_CR41","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/3-540-61604-7_55","volume-title":"7th International Conference on Concurrency Theory (CONCUR\u201996)","author":"U. Nestmann","year":"1996","unstructured":"U. Nestmann and B. C. Pierce. Decoding choice encodings. In U. Montanari and V. Sassone, editors, 7th International Conference on Concurrency Theory (CONCUR\u201996), volume 1119 of LNCS, pages 179\u2013194. Springer-Verlag, Aug. 1996. Revised full version as report ERCIM-10\/97-R051, 1997."},{"key":"6_CR42","series-title":"Lect Notes Comput Sci","volume-title":"Concurrency and Automata on Infinite Sequences","author":"D. M. R. Park","year":"1980","unstructured":"D. M. R. Park. Concurrency and Automata on Infinite Sequences, volume 104 of LNCS. Springer-Verlag, 1980."},{"key":"6_CR43","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1007\/BFb0084813","volume-title":"Third International Conference on Concurrency Theory (CONCUR\u201992)","author":"J. Parrow","year":"1992","unstructured":"J. Parrow and P. Sj\u00f6din. Multiway synchronization verified with coupled simulation. In R. Cleaveland, editor, Third International Conference on Concurrency Theory (CONCUR\u201992), volume 630 of LNCS, pages 518\u2013533. Springer-Verlag, 1992."},{"key":"6_CR44","series-title":"Lect Notes Comput Sci","first-page":"557","volume-title":"Proceedings of STACS\u201994","author":"J. Parrow","year":"1994","unstructured":"J. Parrow and P. Sj\u00f6din. The complete axiomatization of cs-congruence. In P. Enjalbert, E. W. Mayr, and K. W. Wagner, editors, Proceedings of STACS\u201994, volume 775 of LNCS, pages 557\u2013568. Springer-Verlag, 1994."},{"key":"6_CR45","unstructured":"B. C. Pierce and D. N. Turner. Pict: A programming language based on the pi-calculus. In G. D. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, May 2000. ISBN 0262161885."},{"key":"6_CR46","unstructured":"D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. Ph.D. thesis, University of Edinburgh, May 1993."},{"key":"6_CR47","series-title":"Lect Notes Comput Sci","volume-title":"Technical Report ECS-LFCS-94-299","author":"D. Sangiorgi","year":"1994","unstructured":"D. Sangiorgi. On the bisimulation proof method. Revised version of Technical Report ECS-LFCS-94-299, University of Edinburgh, 1994. An extended abstract appears in Proc. of MFCS\u201995, LNCS 969, 1994."},{"key":"6_CR48","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0084781","volume-title":"Proceedings of CONCUR\u2019 92","author":"D. Sangiorgi","year":"1992","unstructured":"D. Sangiorgi and R. Milner. The problem of \u201cweak bisimulation up to\u201d. In W. R. Cleaveland, editor, Proceedings of CONCUR\u2019 92, volume 630 of LNCS, pages 32\u201346. Springer-Verlag, 1992."},{"key":"6_CR49","unstructured":"D. Sangiorgi and D. Walker. The Pi-calculus: a Theory of Mobile Processes. Cambridge University Press, July 2001. ISBN 0521781779."},{"key":"6_CR50","doi-asserted-by":"crossref","unstructured":"L. van Doorn, M. Abadi, M. Burrows, and E. Wobber. Secure network objects. In Proceedings of the 1996 IEEE Symposium on Security and Privacy, pages 211\u2013221, May 1996.","DOI":"10.1109\/SECPRI.1996.502683"}],"container-title":["Lecture Notes in Computer Science","Applied Semantics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45699-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T06:49:46Z","timestamp":1556434186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45699-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440444","9783540456995"],"references-count":50,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-45699-6_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[2002]]}}}