D. Duggan. Type-based hot swapping of running modules. In Proc. ICFP, 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....a more principled proposal for JoCaml has been made by Schmitt in a Join calculus setting [Sch02] 5.3 Dynamic Update There are a number of implemented systems for dynamic updating surveyed in [Hic01] notably including Erlang [AVWW96] There is very little rigorous semantics, however. Duggan [Dug01] has a formal framework for updating types, but updating code is considered only informally, based on arguments around reference types. Gilmore et al. GKW97, Wal01] have a formal description of updating, but it is centred on abstract types, and is tied to their particular abstract machine. ....

Dominic Duggan. Type-based hot swapping of running modules. In Proc. 5th ICFP, pages 62--73, 2001.

....and other desirable correctness properties of updates in Section 4) Any analysis must therefore consider only particular programs or program structures, suggesting that a language based formalism is needed. However, there are few formalized programming languages for modeling DSU or its aspects [20, 7], and these lack both simplicity and generality. Therefore, we believe that a simple formal system should be established with the goal of understanding the underlying foundations of update, for the purpose of understanding how to best build reliable updateable programs. In this paper, we present ....

....so makes it easier to write correct updates. Of equal importance is the need to control an update s e#ect. Which modules will notice the new version Can an old version and a new version coexist Di#erent systems answer these questions di#erently. Many systems allow multiple versions to coexist [2, 9, 13, 7, 1, 18], while others prefer one version at a time [10, 11] Our use of module versions allows multiple generations of a module to exist simultaneously, and provides explicit control over which version of a module we are referring to, allowing us to delimit the e#ect of an update. As such, we can model a ....

[Article contains additional citation context not shown here]

D. Duggan. Type-based hot swapping of running modules. In International Conference on Functional Programming, pages 62--73, 2001.

....a more principled proposal for JoCaml has been made by Schmitt in a Join calculus setting [Sch02] 5.3 Dynamic Update There are a number of implemented systems for dynamic updating surveyed in [Hic01] notably including Erlang [AVWW96] There is very little rigorous semantics, however. Duggan [Dug01] has a formal framework for updating types, but updating code is considered only informally, based on arguments around reference types. Gilmore et al. GKW97, Wal01] have a formal description of updating, but it is centred on abstract types, and is tied to their particular abstract machine. ....

Dominic Duggan. Type-based hot swapping of running modules. In Proc. 5th ICFP, pages 62--73, 2001.

....it is not possible to know if an active code path in the system relies upon a particular part of the interface. Several systems have looked into allowing interface changes using typesafety and programmer defined safe points for updates to provide the necessary information about component usage [16, 23, 30]. Generic state transfer: K42 s hot swapping mechanism provides a protocol for negotiating the best common format for state transfer between objects. But, it relies upon support from the components being swapped to complete state transfer. Because this becomes increasingly complex as the number ....

D. Duggan. Type-based hot swapping of running modules. Technical report SIT--CS--2001.

....The work on schema or class versioning (e.g. 26, 49, 22] considers multiple co existing versions of a schema or class. The work on object instance evolution (e.g. 8, 31] considers selective transformation of some but not all objects in a class. The work on hot swapping of modules (e.g. [36, 32, 37]) is concerned with updating a class while there is executing code that is using objects of the class; this work considers issues of type safe access to the same object via multiple potentially incompatible interfaces but does not enforce the upgrade modularity conditions that allow programmers to ....

D. Duggan. Type-based hot swapping of running modules. Technical Report SIT CS 2001-7, Stevens Institute of Technology, Hoboken, NJ 07030, October 2001.

.... lack an effective means of completing module replacement, because existing instances cannot be changed (replacement is delayed until they go out of scope) Several surveys on these and other approaches to module replacement discuss merits and drawbacks that extend beyond the scope of this paper [6, 18, 3]. Our present concern is to support module replacement with an effective, language neutral approach that can be readily adopted and deployed by practitioners engaged in distributed software development. These desiderata call for a general strategy that can target mainstream languages without ....

D. Duggan. Type-based hot swapping of running modules. In International Conference on Functional Programming, pages 62--73, 2001.

....the patch is applied, existing instances of the old type are left as they are, and the state transformer function, in conjunction with the stub function(s) is used to convert old instances at the time of update. This avoids the problems of version barriers and passive partitioning discussed in [THRM]. Implementation of such type renaming is simple, since cryptographic hashes of type definitions can be taken, in order for the type checking context to retain its definition of the old type and new type simultaneously. This solves the complex problem of having to find and replace all existing ....

D. Duggan. "Type-Based Hot Swapping of Running Modules"

No context found.

Dominic Duggan. Type-based hot swapping of running modules. In Proceedings of ACM International Conference on Functional Programming, Florence, Italy, September 2001. ACM Press.

No context found.

D. Duggan. Type-based hot swapping of running modules. In Proc. ICFP, 2001.

No context found.

Dominic Duggan. Type-based hot swapping of running modules. Technical Report SIT CS 2001-7, Stevens Institute of Technology, Hoboken, NJ 07030, October 2001.

No context found.

D. Duggan. Type-based hot swapping of running modules. In International Conference on Functional Programming, pages 62--73, 2001.

No context found.

D. Duggan. Type-based hot swapping of running modules. Technical Report SIT CS 2001-7, Stevens Institute of Technology, Hoboken, NJ 07030, October 2001.

No context found.

D. Duggan. Type-based hot swapping of running modules. In International Conference on Functional Programming, pages 62--73, 2001.

No context found.

Dominic Duggan. Type-based hot swapping of running modules. In Proc. 5th ICFP, pages 62--73, 2001.

No context found.

Dominic Duggan. Type-based hot swapping of running modules. In Intl. Conf. on Functional Programming, 2001.

No context found.

D. Duggan. Type-based hot swapping of running modules. Technical Report SIT CS 2001-7, Stevens Institute of Technology, Hoboken, NJ 07030, October 2001.

No context found.

Dominic Duggan. Type-based hot swapping of running modules. In Proc. 5th ICFP, pages 62--73, 2001.

No context found.

Dominic Duggan. Type-based hot swapping of running modules. Technical Report SIT CS 2001-7, Stevens Institute of Technology, Hoboken, NJ 07030, October 2001.

No context found.

Dominic Duggan. Type-based hot swapping of running modules. Technical Report SIT CS 2001-7, Stevens Institute of Technology, Hoboken, NJ 07030, October 2001.

No context found.

D. Duggan. Type-based hot swapping of running modules. In Proceedings of the ACM SIGPLAN International Conference on Functional Programming, pages 62--73. ACM, September 2001.

No context found.

D. Duggan. Type-based hot swapping of running modules. In Proc. 5th ICFP, pages 62--73, 2001.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC