Advertisement

Verification of Distributed Dataspace Architectures

  • Simona Orzan
  • Jaco van de Pol
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2890)

Abstract

The space calculus is introduced as a language to model distributed dataspace systems, i.e. distributed applications that use a shared (but possibly distributed) dataspace to coordinate. The publish-subscribe and the global dataspace are particular instances of our model. We give the syntax and operational semantics of this language and provide tool support for functional and performance analysis of its expressions. Functional behaviour can be checked by an automatic translation to μCRL and the use of a model checker. Performance analysis can be done using an automatically generated distributed C prototype.

Keywords

Model Checker Data Item Operational Semantic Local Space Atomic Action 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Banâtre, J.P., Le Métayer, D.: The GAMMA model and its discipline of programming. Science of Computer Programming 15, 55–77 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Blom, S.C.C., Fokkink, W.J., Groote, J.F., Langevelde, I.A., Lisser, B., van de Pol, J.C.: μCRL: a toolset for analysing algebraic specifications. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 250–254. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  3. 3.
    Boasson, M.: Control systems software. IEEE Transactions on Automatic Control 38(7), 1094–1106 (1993)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Bonsangue, M.M., Kok, J.N., Zavattaro, G.: Comparing coordination models based on shared distributed replicated data. In: Carroll, J., Haddad, H., Oppenheim, D., Bryant, B., Lamont, G.B. (eds.) Proceedings of the 1999 ACM Symposium on Applied Computing (SAC 1999), San Antonio, Texas, USA, February 1999, pp. 146–155. ACM press, New York (1999)Google Scholar
  5. 5.
    Busi, N., Gorrieri, R., Zavattaro, G.: Process calculi for coordination: From linda to javaSpaces. In: Rus, T. (ed.) AMAST 2000. LNCS, vol. 1816, p. 198. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  6. 6.
    Busi, N., Manfredini, C., Montresor, A., Zavattaro, G.: Towards a data-driven coordination infrastructure for peer-to-peer systems. In: Gregori, E., Cherkasova, L., Cugola, G., Panzieri, F., Picco, G.P. (eds.) NETWORKING 2002. LNCS, vol. 2376. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. 7.
    Busi, N., Zavattaro, G.: Publish/subscribe vs. shared dataspace coordination infrastructures. In: Proc. of WETICE 2001. IEEE Press, Los Alamitos (2001)Google Scholar
  8. 8.
    Carriero, N., Gelernter, D.: How to Write Parallel Programs: A First Course. MIT Press, Cambridge (1990)Google Scholar
  9. 9.
    Ciancarini, P., Mazza, M., Pazzaglia, L.: A logic for a coordination model with multiple spaces. Science of Computer Programming 31(2-3), 231–261 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Cunningham, H., Roman, G.-C.: A Unity-style programming logic for shared dataspace programs. IEEE Transactions on Parallel and Distributed Systems 1(3), 365–376 (1990)CrossRefGoogle Scholar
  11. 11.
    Dechering, P.F.G., de Jong, E.: Transparent object replication: A formal model. In: Fifth Workshop on Object-oriented Real-Time Dependable Systems (WORDS 1999F), Monterey, California, USA. IEEE Computer Society, Los Alamitos (2000)Google Scholar
  12. 12.
    Dechering, P.F.G., van Langevelde, I.A.: The verification of coordination. In: Porto, A., Roman, G.-C. (eds.) COORDINATION 2000. LNCS, vol. 1906, pp. 335–340. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  13. 13.
    Fernandez, J.-C., Garavel, H., Kerbrat, A., Mounier, L., Mateescu, R., Sighireanu, M.: CADP – a protocol validation and verification toolbox. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 437–440. Springer, Heidelberg (1996)Google Scholar
  14. 14.
    Message Passing Interface Forum. MPI: A Message-Passing Interface standard. Technical Report UT-CS-94-230 (1994)Google Scholar
  15. 15.
    Freeman, E., Hupfer, S., Arnold, K.: JavaSpaces principles, patterns, and practice. Addison-Wesley, Reading (1999)Google Scholar
  16. 16.
    Groote, J.F., Reniers, M.A.: Algebraic process verification. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra. ch. 17. Elsevier, Amsterdam (2001)Google Scholar
  17. 17.
    Hansel, D., Cleaveland, R., Smolka, S.: Distributed prototyping from validated specifications. In: 12th IEEE International Workshop on Rapid System Prototyping, June 2001, pp. 97–102. IEEE Computer Society Press, Los Alamitos (2001)Google Scholar
  18. 18.
    Hooman, J.M.M., van de Pol, J.C.: Equivalent semantic models for a distributed dataspace architecture. In: Proceedings of the First International Symposium on Formal Methods for Components and Objects. LNCS (2002) (to appear)Google Scholar
  19. 19.
    Hooman, J.M.M., van de Pol, J.C.: Formal verification of replication on a distributed data space architecture. In: Proceedings of SAC 2002 (Madrid), pp. 351–358. ACM, New York (2002)Google Scholar
  20. 20.
    Lichtner, K., Alencar, P., Cowan, D.: A framework for software architecture verification. In: Proc. of 12th Australian Software Engineering Conference, pp. 149–158. IEEE Computer Society, Los Alamitos (2000)CrossRefGoogle Scholar
  21. 21.
    Orzan, S., van de Pol, J.: Distribution of a simple shared dataspace architecture. In: Brogi, A., Jacquet, J.-M. (eds.) Electronic Notes in Theoretical Computer Science, vol. 68. Elsevier Science Publishers, Amsterdam (2002)Google Scholar
  22. 22.
    van de Pol, J.C., Valero Espada, M.: Formal specification of JavaSpacesTM architecture using μCRL. In: Arbab, F., Talcott, C. (eds.) COORDINATION 2002. LNCS, vol. 2315, pp. 274–290. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  23. 23.
    Rowstron, A.I.T., Wood, A.M.: Bonita: a set of tuple space primitives for distributed coordination. In: Proceedings of the 30th Annual Hawaii International Conference on System Sciences, pp. 379–388. IEEE Computer Society Press, Los Alamitos (1997)Google Scholar
  24. 24.
    Rowstron, A.I.T.: WCL:A co-ordination language for geographically distributed agents. World Wide Web 1(3), 167–179 (1998)CrossRefGoogle Scholar
  25. 25.
    Tolksdorf, R., Rojec-Goldmann, G.: The SPACETUB models and framework. In: Coordination Models and Languages, pp. 348–363 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Simona Orzan
    • 1
    • 2
  • Jaco van de Pol
    • 1
  1. 1.Centrum voor Wiskunde en InformaticaAmsterdamThe Netherlands
  2. 2.“A.I.Cuza” UniversityIasiRomania

Personalised recommendations