Linear forwarders

Information and Computation

Volumn 205, Issue 10, 2007, Pages 1526-1550

  Gardner, Philippa ^a   Laneve, Cosimo ^b   Wischik, Lucian ^c  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF BOLOGNA   (Italy)

^c MICROSOFT   (United States)

Author keywords

Distributed implementation; Input capability; Linear forwarders; Pi calculus

Indexed keywords

COMPUTATIONAL METHODS; INFORMATION SYSTEMS;

CODE MIGRATION; CONSENSUS PROBLEMS; DISTRIBUTED IMPLEMENTATION; INPUT CAPABILITIES; LINEAR FORWARDERS; PI CALCULUS;

CALCULATIONS;

EID: 84855195321     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2007.01.006     Document Type: Article

References (40)

1. Roberto Amadio, An asynchronous model of locality, failure, and process mobility, in: D. Garlan, D. Le Métayer (Eds.), COORDINATION 1997, Lecture Notes in Computer Science, vol. 1282, SPRINGER, 1997, pp. 374-391. (Pubitemid 127114792)
2. Roberto Amadio, Gérard Boudol, Cédric Lhoussaine, The receptive distributed pi-calculus (extended abstract), in: C. Pandu Rangan, V. Raman, R. Ramanujam (Eds.), FSTTCS 1999, Lecture Notes in Computer Science, vol. 1738, SPRINGER, 1999, pp. 304-315.
3. Roberto Amadio, Sanjiva Prasad, Localities and failures (extended abstract), in: Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, vol. 880, Springer, 1994, pp. 205-216.
4. Roberto M. Amadio, Ilaria Castellani, Davide Sangiorgi, On bisimulations for the asynchronous π-calculus, Theoretical Computer Science 195(2) (1998) 291-324, An extended abstract appeared in Proceedings of CONCUR'96, LNCS, vol. 1119, pp. 147-162.
5. Martin Berger, Basic theory of reduction congruence for two timed asynchronous π-calculi, in: CONCUR'04: Proceedings of the 15th International Conference on Concurrency Theory, Lecture Notes in Computer Science, vol. 3170, SPRINGER, 2004, pp. 115-130.
6. Michele Boreale, On the expressiveness of internal mobility in name-passing calculi, Theoretical Computer Science 195(2) (1998) 205-226. (Pubitemid 128453446)
7. A. Brown, C. Laneve, L. G. Meredith, PiDuce: a process calculus with native xml datatypes, in: Proceedings of 2nd International Workshop on Web Services and Formal Methods, LNCS, vol. 3670, SPRINGER, 2005, pp. 18-34.
8. Luca Cardelli, Andrew D. Gordon, Mobile ambients, Theoretical Computer Science 240(1) (2000) 177-213.
9. Samuele Carpineti, Cosimo Laneve, Paolo Milazzo, The bopi machine: a distributed machine for experimenting web services technologies, in: Fifth International Conference on Application of Concurrency to System Design (ACSD 2005), IEEE Computer Society Press, 2005, pp. 202-211. (Pubitemid 44088272)
10. Silvain Conchon, Fabrice Le Fessant, Jocaml: mobile agents for objective-caml, in: First International Symposium on Agent Systems and Applications Third International Symposium on Mobile Agents, IEEE COMPUTER SOCIETY PRESS, 1999, pp. 22-29.
11. Rocco De Nicola, Gian Luigi Ferrari, Pugliese Pugliese, KLAIM: a kernel language for agents interaction and mobility, IEEE Transactions on Software Engineering 24(5) (1998) 315-330. (Pubitemid 128741958)
12. Cédric Fournet, The Join-Calculus: A Calculus for Distributed Mobile Programming. PhD thesis, École Polytechnique, Paris, France, 1998.
13. Cédric Fournet, Georges Gonthier, The reflexive chemical abstract machine and the join-calculus, in: POPL 1996, ACM, ACM Press, 1996, pp. 372-385.
14. Philippa Gardner, Cosimo Laneve, Lucian Wischik, The fusion machine, in: M. Kretinsky, A. Kucera, L. Brim, P. Jancar (Eds.), CONCUR 2002, Lecture Notes in Computer Science, vol. 2421, SPRINGER, 2002, pp. 418-433.
15. Philippa Gardner, Cosimo Laneve, Lucian Wischik, Linear forwarders, in: D. Lugiez, R. Amadio (Eds.), CONCUR 2002, Lecture Notes in Computer Science, vol. 2761, SPRINGER, 2003, pp. 415-430.
16. Philippa Gardner, Sergio Maffeis, Modelling dynamic Web data, in: Georg Lausen, Dan Suciu (Eds.), Proceedings of DBPL'03, LNCS, vol. 2921, September 2003, pp. 130-146.
17. Philippa Gardner, Lucian Wischik, Explicit fusions, in: Mogens Nielsen, Branislav Rovan (Eds.), MFCS 2000, Lecture Notes in Computer Science, vol. 1893, SPRINGER, 2000, pp. 373-382.
18. Alessandro Giacalone, Prateek Mishra, Sanjiva Prasad, Facile: a symmetric integration of concurrent and functional programming, International Journal of Parallel Programming 18(2) (1989) 121-160.
19. Kohei Honda, Nobuko Yoshida, On reduction-based process semantics, Theoretical Computer Science 152(2) (1995) 437-486.
20. Naoki Kobayashi, Benjamin C. Pierce, David N. Turner, Linearity and the pi-calculus, ACM Transactions on Programming Languages and Systems 21(5) (1999) 914-947. (Pubitemid 129551334)
21. Cosimo Laneve, Luca Padovani, Smooth orchestrators, in: Proceedings of Foundations of Software Science and Computation Structures (FOSSACS 2006), LNCS, vol. 3921, SPRINGER, 2006, pp. 32-46. (Pubitemid 44019330)
22. Cosimo Laneve, Gianluigi Zavattaro, Foundations of web transactions, in: FOSSACS 2005: Proceedings of Foundations of Software Science and Computation Structure, Lecture Notes in Computer Science, vol. 3441, SPRINGER, 2005, pp. 282-298. (Pubitemid 41273713)
23. Sergio Maffeis, Dynamic web data: a process-algebraic approach, PhD thesis, Imperial College, London, 2006.
24. Massimo Merro, On equators in asynchronous name-passing calculi without matching, in: EXPRESS 1999, Electronic Notes in Theoretical Computer Science, vol. 27, ELSEVIER SCIENCE PUBLISHERS, 1999, pp. 57-70. (Pubitemid 40702473)
25. Massimo Merro, Davide Sangiorgi, On asynchrony in name-passing calculi, in: Kim G. Larsen, Sven Skyum, Glynn Winskel (Eds.), ICALP 1998, Lecture Notes in Computer Science, vol. 1443, SPRINGER, 1998, pp. 856-867. (Pubitemid 128111170)
26. Robin Milner, Functions as processes, Journal of Mathematical Structures in Computer Science 2(2) (1992) 119-141.
27. Robin Milner, The polyadic pi calculus: a tutorial, in: Friedrich L. Bauer, Wilfried Brauer, Helmut Schwichtenberg (Eds.), Logic and Algebra of Specification, NATO 1991, Series F, vol. 94, SPRINGER, 1993.
28. Robin Milner, Davide Sangiorgi, Barbed bisimulation, in: W. Kuich (Ed.), ICALP 1992, Lecture Notes in Computer Science, vol. 623, SPRINGER, 1992, pp. 685-695.
29. Uwe Nestmann, Benjamin C. Pierce, Decoding choice encodings, Information and Computation 163(1) (2000) 1-59.
30. Joachim Parrow, Peter Sjödin, Multiway synchronization verified with coupled simulation, in: W. R. Cleaveland (Ed.), CONCUR 1992, Lecture Notes in Computer Science, vol. 630, SPRINGER, 1992, pp. 518-533.
31. A. Phillips, N. Yoshida, S. Eisenbach, A distributed abstract machine for boxed ambient calculi, in: Proceedings of the European Symposium on Programming (ESOP 2004), LNCS, SPRINGER, 2004.
32. Benjamin C. Pierce, Davide Sangiorgi, Typing and subtyping for mobile processes, Mathematical Structures in Computer Science 6(5) (1996) 409-454. (Pubitemid 126148812)
33. James Riely, Matthew Hennessy, Distributed processes and location failures, Theoretical Computer Science 226(2001) 693-735. (Pubitemid 32833029)
34. Arnaud Sahuguet, Val Tannen, Resource Sharing Through Query Process Migration, University of Pennsylvania, Technical Report MS-CIS-01-10, 2001.
35. Davide Sangiorgi, π-Calculus, internal mobility and agent-passing calculi, Theoretical Computer Science 167 (1-2) (1996) 235-274. (Pubitemid 126412422)
36. Davide Sangiorgi, On the bisimulation proof method, Mathematical Structures in Computer Science 8(5) (1998) 447-479.
37. Davide Sangiorgi, David Walker, The Pi-calculus: A Theory of Mobile Processes, CAMBRIDGE UNIVERSITY PRESS, 2001.
38. Peter Sewell, Pawel Wojciechowski, Benjamin Pierce, Location independence for mobile agents, in: H. E. Bal, B. Belkhouche, L. Cardelli (Eds.), ICCL 1998, Lecture Notes in Computer Science, vol. 1686, SPRINGER, 1999, pp. 1-31.
39. David N. Turner, The Polymorphic Pi-Calculus: Theory and Implementation, PhD thesis, LFCS, University of Edinburgh, June 1996. CST-126-96 (also published as ECS-LFCS-96-345).
40. URL. Microsoft biztalk server. www.microsoft.com/biztalk.