D. Ancona, S. Fagorzi, and E. Zucca
A
calculus for dynamic linking
In Proc. Italian Conference on Theoretical Computer Science
2003, number 2841 in Lecture Notes in Computer Science, pages 284-301
Springer, October 2003
We define a calculus for modeling dynamic linking
independently of the details of a particular programming environment.
The calculus distinguishes at the language level the notions of
software configuration and execution, by introducing
separate syntactic notions of linkset expression and command, respectively.
A reduction step can be either a simplification of a linkset
expression, or the execution of a command w.r.t. a specific underlying
software configuration denoted by a linkset expression;
because of dynamic linking, these two kinds of reductions are interleaved.
The type system of the calculus, which is proved to be sound,
relies on an accurate dependency analysis for ensuring type
safety without losing the advantages offered by dynamic linking.
[ bib |
.pdf ]
Back
This file has been generated by
bibtex2html 1.43