@inproceedings{8d51a7a2fc3b424e848cad2874e6b1de,
title = "Dynamic linking for mobile programs",
abstract = "Dynamic linking provides functionality that is necessary for secure flexible use of mobile programs but it introduces a new class of runtime errors - unbound procedure names. In this chapter, we present a compiler-directed technique for safe dynamic linking for mobile programs. Our technique guarantees that linking failures can occur only when a program arrives at a new execution site and that this failure can be delivered to the program as an error code or an exception. We use interproeedural analysis to identify the set of names that must be linked at the different sites the program executes on. We use a combination of runtime and compile-time techniques to identify the calling context and to link only the names needed in that context. Our technique is able to handle recursive programs as well as separately compiled code that may itself be able to move. We discuss language constructs for controlling the behavior of dynamic linking and the implication of some of these constructs for application structure.",
author = "Anurag Acharya and Joel Saltz",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1997.; 2nd International Workshop on Mobile Object Systems, MOS 1996 ; Conference date: 08-07-1996 Through 09-07-1996",
year = "1997",
language = "English",
isbn = "9783540628521",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "245--262",
editor = "Jan Vitek and Christian Tschudin",
booktitle = "Mobile Object Systems",
}