A Calculus for Dynamic Linking

Ancona, Davide; Fagorzi, Sonia; Zucca, Elena

doi:10.1007/978-3-540-45208-9_23

Cited by 11 publications

(13 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This work is part of a stream of research [3,4,5,11] whose aim is the development of foundational calculi providing an abstract framework for dynamic software reconfiguration. In particular, the possibility of extending module calculi with selection on open modules, interleaving of component evaluation with reconfiguration steps and a lazy strategy has been firstly explored in [4].…”

Section: Resultsmentioning

confidence: 99%

A Calculus for Dynamic Reconfiguration with Low Priority Linking

Ancona

Fagorzi

Zucca

2005

Electronic Notes in Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Resultsmentioning

confidence: 99%

A Calculus for Dynamic Reconfiguration with Low Priority Linking

Ancona

Fagorzi

Zucca

2005

Electronic Notes in Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Theoretical research on component assembly mainly focusses on static aspects of linking [9,2,1] even when it deal with dynamic linking; it is in the sense of "compiler linkers" not in the sense of "object-oriented late-binding". It looks for typing theories that ensure error-free compilations, ignoring the expected behavior.…”

Section: Resultsmentioning

confidence: 99%

Method overloading and overriding cause distribution transparency and encapsulation flaws.

Beugnard

Sadou

2007

JOT

View full text Add to dashboard Cite

Based on an experiment using three languages under .NET, this paper argues that the semantic dierences between these languages regarding method overloading and overriding give rise to signicant complexity and break encapsulation. We rst recall the various interpretations of overriding and overloading in object oriented languages through what we call language signatures. Then, we perform an experiment with .NET components coded in dierent programming languages in order to observe the global behavior. From this, we show that overriding and overloading are not compatible with a key property of components: encapsulation. We conclude that, in the current state of the art, in order to build predictable assemblies, components must expose their internal structure! We propose a solution to this problem.

show abstract

“…Following the formal treatment of static linking [4], formal approaches to dynamic linking have been undertaken [14,1,25]. In addition, there have been proposals for modelling software evolution, utilising Requirements/Assurances Contacts [9], Reuse Contracts [28] and 'smart' composition [20].…”

Section: Related Workmentioning

confidence: 99%

Keeping Control of Reusable Components

Eisenbach

Kayhan

Sadler³

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Development and deployment via components offers the possibility of prolific software reuse. However, to achieve this potential in a component-rich environment, it is necessary to recognize that component deployment (and subsequent composition) is closer to a continual process than a one-off operation. This is due to the requirement that newly-evolved components need to replace their ancestors in a timely and efficient manner at the client deployment sites. Modern runtime systems which employ dynamic link-loading mechanisms can permit such dynamic evolution. We review the capabilities of several alternative runtime environments to establish some requirements for dynamic evolution. Then we describe a tool designed to support developers and administrators in the migration of component updates within the Microsoft .NET framework.

show abstract

A Calculus for Dynamic Linking

Cited by 11 publications

References 12 publications

A Calculus for Dynamic Reconfiguration with Low Priority Linking

A Calculus for Dynamic Reconfiguration with Low Priority Linking

Method overloading and overriding cause distribution transparency and encapsulation flaws.

Keeping Control of Reusable Components

Contact Info

Product

Resources

About