A Calculus for Dynamic Reconfiguration with Low Priority Linking

Authors:
Davide Ancona;Sonia Fagorzi;Elena Zucca
Affiliations:
DISI, University of Genova, Genova, Italy;DISI, University of Genova, Genova, Italy;DISI, University of Genova, Genova, Italy
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 6
Cited 2

Program fragments, linking, and modularization

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Mixin Modules in a Call-by-Value Setting

ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
An Abstract Model of Java Dynamic Linking and Loading

TIC '00 Selected papers from the Third International Workshop on Types in Compilation
A calculus of module systems

Journal of Functional Programming
Flexible models for dynamic linking

ESOP'03 Proceedings of the 12th European conference on Programming
Mixin modules for dynamic rebinding

TGC'05 Proceedings of the 1st international conference on Trustworthy global computing

Development of a formalism for modelling and analysis of dynamic reconfiguration of dependable real-time systems: a technical diary

Proceedings of the 2008 RISE/EFTS Joint International Workshop on Software Engineering for Resilient Systems
A Calculus for Reconfiguration

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Building on our previous work, we present a simple module calculus where execution steps of a module component can be interleaved with reconfiguration steps (that is, reductions at the module level), and where execution can partly control precedence between these reconfiguration steps. This is achieved by means of a low priority link operator which is only performed when a certain component, which has not been linked yet, is both available and really needed for execution to proceed, otherwise precedence is given to the outer operators. We illustrate the expressive power of this mechanism by a number of examples. We ensure soundness by combining a static type system, which prevents errors in applying module operators, and a dynamic check which raises a linkage error if the running program needs a component which cannot be provided by reconfiguration steps. In particular no linkage errors can be raised if all components are potentially available.