D. Ancona, S. Fagorzi, and E. Zucca
A calculus for dynamic reconfiguration
with low priority linking
In Workshop on Object-Oriented Developments 2004, ENTCS
Elsevier, August 2004
To appear
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.
[ bib |
.pdf ]
Back
This file has been generated by
bibtex2html 1.43