Skip to main content

Abstractions for Mobile Computation

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1603))

Abstract

We discuss the difficulties caused by mobile computing and mobile computation over wide-area networks. We propose a unified framework for overcoming such difficulties.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abadi, M., Fournet, C, Gonthier, G.: Secure Implementation of Channel Abstractions. Proc. of the Thirteenth Annual IEEE Symposium on Logic in Computer Science (1998) 105–116.

    Google Scholar 

  2. Abadi, M., Gordon, A.D.: A Calculus for Cryptographic Protocols: the Spi Calculus. Proc. of the Fourth ACM Conference on Computer and Communications Security (1997) 36–47.

    Google Scholar 

  3. Agha, G.A.: Actors: A Model of Concurrent Computing in Distributed Systems. MIT Press (1986).

    Google Scholar 

  4. Amadio, R.M.: An Asynchronous Model of Locality, Failure, and Process Mobility. Proc. COORDINATION 97, Lecture Notes in Computer Science 1282, Springer Verlag (1997).

    Google Scholar 

  5. Bharat, K., Cardelli, L.: Migratory Applications. Proc. of the ACM Symposium on User Interface Software and Technology’ 95 (1995) 133–142.

    Google Scholar 

  6. Berry, G.: The Foundations of Esterel. In: Plotkin, G., Stirling C, Tofte, M. (eds.): Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press (1998).

    Google Scholar 

  7. Berry, G., Boudol, G.: The Chemical Abstract Machine. Theoretical Computer Science 96(1) (1992) 217–248.

    Article  MATH  MathSciNet  Google Scholar 

  8. Boudol, G.: Asynchrony and the π-calculus. Technical Report 1702, INRIA, Sophia-Antipolis (1992).

    Google Scholar 

  9. Bracha, G., Toueg, S.: Asynchronous Consensus and Broadcast Protocols. J.ACM 32(4) (1985) 824–840.

    Article  MathSciNet  Google Scholar 

  10. Brauer, W. (ed.): Net Theory and Applications. Proc. of the Advanced Course on General Net Theory of Processes and Systems, Hamburg, 1979. Lecture Notes in Computer Science 84. Springer-Verlag (1980).

    Google Scholar 

  11. Cardelli, L.: A Language with Distributed Scope. Computing Systems, 8(1), MIT Press (1995) 27–59.

    Google Scholar 

  12. Cardelli, L., Davies, R.: Service Combinators for Web Computing. Proc. of the First Usenix Conference on Domain Specific Languages, Santa Barbara (1997).

    Google Scholar 

  13. Cardelli, L., Gordon, A.D.: Mobile Ambients. In: Nivat, M. (ed.): Foundations of Software Science and Computational Structures, Lecture Notes in Computer Science 1378, Springer (1998) 140–155.

    Chapter  Google Scholar 

  14. Cardelli, L., Gordon, A.D.: Types for Mobile Ambients. Proc. of the 26th ACM Symposium on Principles of Programming Languages (1999) 79–92.

    Google Scholar 

  15. Carriero, N., Gelernter, D.: Linda in Context. Communications of the ACM, 32(4) (1989) 444–458.

    Article  Google Scholar 

  16. Carriero, N., Gelernter, D., Zuck, L.: Bauhaus Linda. In: Ciancarini, P., Nierstrasz., O., Yonezawa, A. (eds.): Object-Based Models and Languages for Concurrent Systems. Lecture Notes in Computer Science 924, Springer Verlag (1995) 66–76.

    Google Scholar 

  17. Chandra, T.D., Toueg, S.: Unreliable Failure Detectors for Asynchronous Systems. ACM Symposium on Principles of Distributed Computing (1991) 325–340.

    Google Scholar 

  18. De Nicola, R., Ferrari, G.-L., Pugliese, R.: Locality Based Linda: Programming with Explicit Localities. Proc. TAPSOFT’97. Lecture Notes in Computer Science 1214, Springer Verlag (1997) 712–726.

    Google Scholar 

  19. Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of Distributed Consensus with One Faulty Process. J.ACM 32(2) (1985) 374–382.

    Article  MATH  MathSciNet  Google Scholar 

  20. Fournet, C, Gonthier, G.: The Reflexive CHAM and the Join-Calculus. Proc. 23rd Annual ACM Symposium on Principles of Programming Languages (1996) 372–385.

    Google Scholar 

  21. Fournet, C, Gonthier, G., Lévy, J.-J., Maranget, L., Rémy, D.: A Calculus of Mobile Agents. Proc. 7th International Conference on Concurrency Theory (CONCUR’96) (1996) 406–421.

    Google Scholar 

  22. Fournet, C, Maranget, L.: The Join-Calculus Language-Documentation and User’s Guide. <http://pauillac.inria.fr/join/> (1997).

  23. Gosling, J., Joy, B., Steele, G.: The Java Language Specification. Addison-Wesley (1996).

    Google Scholar 

  24. Hoare, C.A.R., Communicating Sequential Processes. Communications of the ACM 21(8) (1978)666–678.

    Article  MATH  MathSciNet  Google Scholar 

  25. Honda., K., Tokoro, M.: An Object Calculus for Asynchronous Communication. Proc. ECOOP’91, Lecture Notes in Computer Science 521, Springer Verlag (1991) 133–147.

    Google Scholar 

  26. INMOS Ltd.: occam programming manual. Prentice Hall (1984).

    Google Scholar 

  27. Kistler, T., Marais, J.: WebL-A Programming Language for the Web. In Computer Networks and ISDN Systems, 30. Elsevier (1998) 259–270.

    Article  Google Scholar 

  28. Milner, R.: A Calculus of Communicating Systems. Lecture Notes in Computer Science 92. Springer Verlag (1980).

    MATH  Google Scholar 

  29. Milner, R.: Functions as Processes. Mathematical Structures in Computer Science 2 (1992) 119–141.

    Google Scholar 

  30. Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, Parts 1–2. Information and Computation, 100(1) (1992) 1–77.

    Article  MATH  MathSciNet  Google Scholar 

  31. Morris, J.H.: Lambda-Calculus Models of Programming Languages. Ph.D. Thesis, MIT (Dec 1968).

    Google Scholar 

  32. Palamidessi, C: Comparing the Expressive Power of the Synchronous and the Asynchronous Pi-calculus. Proc. 24th ACM Symposium on Principles of Programming Languages (1997)256–265.

    Google Scholar 

  33. Sander, A., Tschudin, C.F.: Towards Mobile Cryptography. ICSI technical report 97-049, November 1997. Proc. IEEE Symposium on Security and Privacy (1998).

    Google Scholar 

  34. Sangiorgi, D.: From π-calculus to Higher-Order π-calculus-and Back. Proc. TAPSOFT’ 93., Lecture Notes in Computer Science 668, Springer Verlag (1992).

    Google Scholar 

  35. Stamos, J.W., Gifford, D.K.: Remote Evaluation. ACM Transactions on Programming Languages and Systems 12(4) (1990) 537–565.

    Article  Google Scholar 

  36. Stein, L.A., Lieberman, H., Ungar, D.: A Shared View of Sharing: The treaty of Orlando. In: Kim, W., Lochowsky, F. (eds.): Object-Oriented Concepts, Applications, and Databases. Addison-Wesley (1988) 31–48.

    Google Scholar 

  37. White, J.E.: Mobile Agents. In: Bradshaw, J. (ed.): Software Agents. AAAI Press / The MIT Press (1996).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Cardelli, L. (1999). Abstractions for Mobile Computation. In: Vitek, J., Jensen, C.D. (eds) Secure Internet Programming. Lecture Notes in Computer Science, vol 1603. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48749-2_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-48749-2_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66130-6

  • Online ISBN: 978-3-540-48749-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics