Skip to main content
SpringerLink
Log in

Revealing the Trajectories of KLAIM Tuples, Statically

  • Chapter
  • First Online:
Models, Languages, and Tools for Concurrent and Distributed Programming

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11665))

Abstract

Klaim (Kernel Language for Agents Interaction and Mobility) has been devised to design distributed applications composed by many components deployed over the nodes of a distributed infrastructure and to offer programmers primitive constructs for communicating, distributing and retrieving data. Data could be sensitive and some nodes could not be secure. As a consequence it is important to track data in their traversal of the network. To this aim, we propose a Control Flow Analysis that over-approximates the behaviour of Klaim processes and tracks how tuple data can move in the network.

The first three authors have been partially supported by Università di Pisa PRA_2018_66 DECLWARE: Metodologie dichiarative per la progettazione e il deployment di applicazioni; the last author by IMT project PAI VeriOSS.

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

Access this chapter

Log in via an institution
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 EPUB and 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

Institutional subscriptions

References

  1. Bettini, L., De Nicola, R., Pugliese, R.: KLAVA: a Java package for distributed and mobile applications. Softw. Pract. Exper. 32(14), 1365–1394 (2002)

    Article  Google Scholar 

  2. Bettini, L., De Nicola, R., Pugliese, R., Ferrari, G.L.: Interactive mobile agents in X-Klaim. In: Proceedings of 7th Workshop on Enabling Technologies (WETICE 1998), Infrastructure for Collaborative Enterprises, pp. 110–117. IEEE Computer Society (1998)

    Google Scholar 

  3. Bodei, C., Degano, P., Ferrari, G.L., Galletta, L.: A step towards checking security in IoT. In: Proceedings of ICE 2016, EPTCS, vol. 223, pp. 128–142 (2016)

    Article  Google Scholar 

  4. Bodei, C., Degano, P., Ferrari, G.-L., Galletta, L.: Where do your IoT ingredients come from? In: Lluch Lafuente, A., Proença, J. (eds.) COORDINATION 2016. LNCS, vol. 9686, pp. 35–50. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-39519-7_3

    Chapter  Google Scholar 

  5. Bodei, C., Degano, P., Ferrari, G.L., Galletta, L.: Tracing where IoT data are collected and aggregated. Log. Methods Comput. Sci. 13(3), 1–38 (2017)

    Google Scholar 

  6. Bodei, C., Galletta, L.: Tracking data trajectories in IoT. In: Mori, P., Furnell, S., Camp, O. (eds.) Proceedings of the 5th International Conference on Information Systems Security and Privacy, ICISSP, vol. 1, pp. 572–579. SCITEPRESS (2019). https://doi.org/10.5220/0007578305720579, ISBN 978-989-758-359-9

  7. Castellani, S., Ciancarini, P., Rossi, D.: The ShaPE of ShaDE: a coordination system. Technical report UBLCS 96-5, Dip. di Scienze dell’Informazione, Univ. Bologna (1996)

    Google Scholar 

  8. Comon, H., et al.: Tree automata techniques and applications. http://www.grappa.univ-lille3.fr/tata (2007). Released 12 Oct 2007

  9. Davies, N., Wade, S., Friday, A., Blair, G.: L\(^2\)imbo: a tuple space based platform for adaptive mobile applications. In: Rolia, J., Slonim, J., Botsford, J. (eds.) ICODP/ICDP. IFIPAICT, pp. 291–302. Springer, Boston (1997). https://doi.org/10.1007/978-0-387-35188-9_22

    Chapter  Google Scholar 

  10. De Nicola, R., Loreti, M.: A modal logic for mobile agents. ACM Trans. Comput. Log. 5(1), 79–128 (2004)

    Article  MathSciNet  Google Scholar 

  11. De Nicola, R., Ferrari, G.L., Pugliese, R.: KLAIM: a kernel language for agents interaction and mobility. IEEE Trans. Softw. Eng. 24(5), 315–330 (1998)

    Article  Google Scholar 

  12. De Nicola, R., Ferrari, G.L., Pugliese, R., Venneri, B.: Types for access control. Theor. Comput. Sci. 240(1), 215–254 (2000)

    Article  MathSciNet  Google Scholar 

  13. De Nicola, R., et al.: From flow logic to static type systems for coordination languages. Sci. Comput. Program. 75(6), 376–397 (2010)

    Article  MathSciNet  Google Scholar 

  14. De Nicola, R., Gorla, D., Pugliese, R.: Confining data and processes in global computing applications. Sci. Comput. Program. 63(1), 57–87 (2006)

    Article  MathSciNet  Google Scholar 

  15. Deugo, D.: Choosing a mobile agent messaging model. In: ISADS, pp. 278–286. IEEE (2001)

    Google Scholar 

  16. Ferrari, G.L., Moggi, E., Pugliese, R.: MetaKlaim: a type safe multi-stage language for global computing. Math. Struct. Comput. Sci. 14(3), 367–395 (2004)

    Article  MathSciNet  Google Scholar 

  17. Gelernter, D.: Generative communication in Linda. ACM Trans. Program. Lang. Syst. 7(1), 80–112 (1985)

    Article  Google Scholar 

  18. Gelernter, D.: Multiple tuple spaces in Linda. In: Odijk, E., Rem, M., Syre, J.-C. (eds.) PARLE 1989. LNCS, vol. 366, pp. 20–27. Springer, Heidelberg (1989). https://doi.org/10.1007/3-540-51285-3_30

    Chapter  Google Scholar 

  19. Gorla, D., Pugliese, R.: Dynamic management of capabilities in a network aware coordination language. J. Log. Algebraic Program. 78(8), 665–689 (2009)

    Article  MathSciNet  Google Scholar 

  20. Nielson, F., Nielson, H.R., Seidl, H.: A succinct solver for ALFP. Nordic J. Comput. 9(4), 335–372 (2002)

    MathSciNet  MATH  Google Scholar 

  21. Nielson, H.R., Nielson, F., Vigo, R.: A calculus of quality for robustness against unreliable communication. J. Log. Algebraic Meth. Program. 84(5), 611–639 (2015)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Pisa, Italy

    Chiara Bodei, Pierpaolo Degano & Gian-Luigi Ferrari

  2. IMT Institute for Advanced Studies Lucca, Lucca, Italy

    Letterio Galletta

Authors
  1. Chiara Bodei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierpaolo Degano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gian-Luigi Ferrari
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Letterio Galletta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Letterio Galletta .

Editor information

Editors and Affiliations

  1. Department of Statistics, Computer Science, Applications, University of Florence, Florence, Italy

    Michele Boreale

  2. School of Science and Technology, University of Camerino, Camerino, Italy

    Flavio Corradini

  3. School of Science and Technology, University of Camerino, Camerino, Italy

    Michele Loreti

  4. Department of Statistics, Computer Science, Applications, University of Florence, Florence, Italy

    Rosario Pugliese

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Bodei, C., Degano, P., Ferrari, GL., Galletta, L. (2019). Revealing the Trajectories of KLAIM Tuples, Statically. In: Boreale, M., Corradini, F., Loreti, M., Pugliese, R. (eds) Models, Languages, and Tools for Concurrent and Distributed Programming. Lecture Notes in Computer Science(), vol 11665. Springer, Cham. https://doi.org/10.1007/978-3-030-21485-2_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-21485-2_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-21484-5

  • Online ISBN: 978-3-030-21485-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation