Advertisement

Types for Dynamic Reconfiguration

  • João Costa Seco
  • Luís Caires
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3924)

Abstract

We define a core language combining computational and architectural primitives, and study how static typing may be used to ensure safety properties of component composition and dynamic reconfiguration in object-based systems. We show how our language can model typed entities analogous of configuration scripts, makefiles, components, and component instances, where static typing combined with a dynamic type-directed test on the structure of objects can enforce consistency of compositions and atomicity of reconfiguration.

Keywords

Operational Semantic Type Information Method Block Object Instance Runtime Error 
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.

References

  1. 1.
    Abadi, M., Cardelli, L., Pierce, B., Plotkin, G.: Dynamic typing in a statically typed language. ACM Trans. on Progr. Languages and Systems 13(2) (April 1991)Google Scholar
  2. 2.
    Aldrich, J., Chambers, C., Notkin, D.: Architectural reasoning in archjava. In: Proc. of the European Conf. on Object-Oriented Programming. Springer-Verlag, Heidelberg (2002)Google Scholar
  3. 3.
    Ancona, D., Zucca, E.: A calculus of module systems. Journal of Functional Programming 12(2), 91–132 (2002)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Bierman, G., Hicks, M., Sewell, P., Stoyle, G.: Formalizing dynamic software updating. In: Proc. of the Int. Workshop on Unanticipated Software Evolution (2003)Google Scholar
  5. 5.
    Bono, V., Patel, A., Shmatikov, V.: A core calculus of classes and mixins. In: Proc. of the European Conf. on Object-Oriented Programming. Springer-Verlag, Heidelberg (1999)Google Scholar
  6. 6.
    Cardelli, L.: Program fragments, linking, and modularization. In: ACM Symp. on Principles of Programming Languages. ACM Press, New York (1997)Google Scholar
  7. 7.
    Drossopoulou, S., Damiani, F., Dezani-Ciancaglini, M., Giannini, P.: Fickle: Dynamic object re-classification. In: Proc. of the European Conf. on Object-Oriented Programming (2001)Google Scholar
  8. 8.
    Duggan, D.: Type-based hot swapping of running modules. In: Proc. of the Int. Conf. on Functional Programming (2001)Google Scholar
  9. 9.
    Fagorzi, S., Zucca, E.: A calculus for reconfiguration. In: On-line Proc. of the Int.Workshop Developments in Computational Models at ICALP (2005)Google Scholar
  10. 10.
    Flatt, M., Felleisen, M.: Units: Cool modules for HOT languages. In: Proc. Of the ACM SIGPLAN Conf. on Programming Language Design and Implementation (1998)Google Scholar
  11. 11.
    Hirschowitz, T., Leroy, X.: Mixin modules in a call-by-value setting. In: Proc. Of the Euro. Symp. on Programming (2002)Google Scholar
  12. 12.
    Hirschowitz, T., Leroy, X., Wells, J.B.: Call-by-value mixin modules: Reduction semantics, side effects, types. In: Proc. of the Euro. Symp. on Programming (2004)Google Scholar
  13. 13.
    Seco, J.C., Caires, L.: A basic model of typed components. In: Proc. of the European Conf. on Object-Oriented Programming, Cannes, France. Springer-Verlag, Heidelberg (2000)Google Scholar
  14. 14.
    Seco, J.C., Caires, L.: Subtyping First-Class Polymorphic Components. In: Proc. of the Euro. Symp. on Programming, Edinburgh. Springer-Verlag, Heidelberg (2005)Google Scholar
  15. 15.
    Seco, J.C., Caires, L.: Types for dynamic reconfiguration. Technical Report UNL-DI-1-2006, FCT-UNL (2006)Google Scholar
  16. 16.
    Sewell, P.: Modules, abstract types, and distributed versioning. In: ACM Symp. on Principles of Programming Languages, pp. 236–247. ACM Press, New York (2001)Google Scholar
  17. 17.
    Sreedhar, V.C.: Mixin’up components. In: Proceedings of the International Conference on Software Engineering. ACM Press, New York (2002)Google Scholar
  18. 18.
    Taha, W., Sheard, T.: Metaml and multi-stage programming with explicit annotations. Theoretical Computer Science 248(1-2), 211–242 (2000)CrossRefMATHGoogle Scholar
  19. 19.
    Wells, J., Vestergaard, R.: Confluent equational reasoning for linking with first-class primitive modules. In: Proc. of the Euro. Symp. on Programming (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • João Costa Seco
    • 1
  • Luís Caires
    • 1
  1. 1.Departamento de InformáticaUniversidade Nova de LisboaPortugal

Personalised recommendations