Flexible Bytecode for Linking in .NET

Authors:
Alex Buckley;Michelle Murray;Susan Eisenbach;Sophia Drossopoulou
Affiliations:
Department of Computing, Imperial College London;Department of Computing, Imperial College London;Department of Computing, Imperial College London;Department of Computing, Imperial College London
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 14
Cited 2

Smartest recompilation

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The security of static typing with dynamic linking

Proceedings of the 4th ACM conference on Computer and communications security
Making the future safe for the past: adding genericity to the Java programming language

Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Design and implementation of generics for the .NET Common language runtime

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Java Virtual Machine Specification

Java Virtual Machine Specification
Dynamic Linking of Software Components

Computer
Altering Java Semantics via Bytecode Manipulation

GPCE '02 Proceedings of the 1st ACM SIGPLAN/SIGSOFT conference on Generative Programming and Component Engineering
An Overview of AspectJ

ECOOP '01 Proceedings of the 15th European Conference on Object-Oriented Programming
An Abstract Model of Java Dynamic Linking and Loading

TIC '00 Selected papers from the Third International Workshop on Types in Compilation
CodeBricks: code fragments as building blocks

Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Security and Dynamic Class Loading in Java: A Formalization

ICCL '98 Proceedings of the 1998 International Conference on Computer Languages
Refactoring for generalization using type constraints

OOPSLA '03 Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications
Polymorphic bytecode: compositional compilation for Java-like languages

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Flexible models for dynamic linking

ESOP'03 Proceedings of the 12th European conference on Programming

A calculus of open modules: call-by-need strategy and confluence

Mathematical Structures in Computer Science
Acute: High-level programming language design for distributed computation

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dynamic linking in modern execution environments like .NET is considerably more sophisticated than in the days of C shared libraries on UNIX. One aspect of this sophistication is that .NET assemblies embed type information about dynamically linked resources. This type information implicitly represents compile-time assumptions about the resources available at run-time. However, the resources available at run-time may differ from those available at compile-time. For example, the execution environment on a mobile phone might provide fewer, simpler classes than on a desktop PC. As bytecode cannot adapt to its execution environment, component reuse is restricted and development costs are increased. We have designed and implemented a ''flexible'' dynamic linking scheme that binds bytecode as late as possible to the assemblies and classes available in a .NET execution environment. We describe the scheme's integration with the .NET linking infrastructure, review important design decisions and report on experiences with the ''Rotor'' shared source version of .NET.