Flexible Bytecode for Linking in .NET

Buckley, Alex; Murray, Michelle; Eisenbach, Susan; Drossopoulou, Sophia

doi:10.1016/j.entcs.2005.02.036

Cited by 8 publications

(7 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some recent work [3,4] has introduced the notion of flexible dynamic linking in .NET, where type variables are contained in binaries exactly as it happens in polymorphic bytecode [1].…”

Section: Related and Further Workmentioning

confidence: 99%

“…However, as already noted [3,4], combining polymorphic bytecode with dynamic linking allows programmers to reuse code with more flexibility, because the same polymorphic binaries can be dynamically adapted to run on diverse environments.…”

Section: Introductionmentioning

confidence: 99%

“…The main contribution of this paper is presenting a model closer to what an implementation would look like: now our runtime expressions resemble more closely actual JVM instructions. This is not a mere notation change: we have replaced the instantiation phase, where polymorphic bytecode was translated into standard monomorphic code (containing symbolic annotations), with a JIT-compilation phase 4 .…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Modelling a JVM for polymorphic bytecode.

Lagorio¹

2007

JOT

View full text Add to dashboard Cite

In standard compilation of Java-like languages, the bytecode generated for a given source depends on both the source itself and the compilation environment. This latter dependency poses some unnecessary restrictions on which execution environments can be used to run the code. When using polymorphic bytecode, a binary depends only on its source and can be dynamically adapted to run on diverse environments. Dynamic linking is particularly suited to polymorphic bytecode, because it can be adapted to an execution environment as late as possible, maximizing the flexibility of the approach. We analyze how polymorphic bytecode can be dynamically linked presenting a deterministic model of a Java Virtual Machine which interleaves loading and linking steps with execution. In our model, loading and execution phases are basically standard, whereas verification handles also type constraints, which are part of polymorphic bytecode, and resolution blends in verification.

show abstract

“…Some recent work [3,4] has introduced the notion of flexible dynamic linking in .NET, where type variables are contained in binaries exactly as it happens in polymorphic bytecode [1].…”

Section: Related and Further Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Modelling a JVM for polymorphic bytecode.

Lagorio¹

2007

JOT

View full text Add to dashboard Cite

show abstract

“…In the meantime, linking-time behaviour, both for .NET and for the Java Virtual Machine has received some formal attention [2,12,7]. The current work is built on a number of earlier projects, focused initially on component evolution [14], which anticipated the .NET 2.0 introduction of type forwarders [19]; and then on component adaptation [9,1]. Execution environments that support the runtime interpretation of metadata, in conjunction with pertinent configuration files, are bound to receive increasing attention [25,27,4].…”

Section: Related and Future Workmentioning

confidence: 99%

Component Adaptation in Contemporary Execution Environments

Eisenbach

Sadler²,

Wong

2007

Distributed Applications and Interoperable Systems

Self Cite

View full text Add to dashboard Cite

Abstract. Because they are required to support component deployment and composition, modern execution environments embody a number of common features such as dynamic linking and support for multiple component versions. These features help to overcome some classical maintenance problems focused largely on component evolution, where successive generations of collaborating components need to be kept collaborating. What has been less studied has been component adaptation, whereby a component developed in an environment consisting of one set of service components is required to operate in one or several other environments containing qualitatively different components. In this paper we examine the needs developers and deployers have arising out of component adaptation and explore the concept of Flexible Dynamic Linking as a means of satisfying them. We describe a suite of tools developed to demonstrate this approach to component adaptation support within the .NET Common Language Runtime.

show abstract

“…Sharable assemblies must have strong names, which include a public key, file hashes, and a major.minor.build.revision version. Compile-time assembly references can be modified before use by XML policy files of the application, code publisher, and machine administrator; the semantics is complex [BMED05].…”

Section: Related Workmentioning

confidence: 99%

Acute: High-level programming language design for distributed computation

Sewell¹,

Leifer

Wansbrough³

et al. 2007

J. Funct. Prog.

View full text Add to dashboard Cite

Existing languages provide good support for typeful programming of standalone programs. In a distributed system, however, there may be interaction between multiple instances of many distinct programs, sharing some (but not necessarily all) of their module structure, and with some instances rebuilt with new versions of certain modules as time goes on. In this paper we discuss programminglanguage support for such systems, focussing on their typing and naming issues.We describe an experimental language, Acute, which extends an ML core to support distributed development, deployment, and execution, allowing type-safe interaction between separately-built programs. The main features are: (1) type-safe marshalling of arbitrary values; (2) type names that are generated (freshly and by hashing) to ensure that type equality tests suffice to protect the invariants of abstract types, across the entire distributed system; (3) expression-level names generated to ensure that name equality tests suffice for type-safety of associated values, e.g. values carried on named channels; (4) controlled dynamic rebinding of marshalled values to local resources; and (5) thunkification of threads and mutexes to support computation mobility.These features are a large part of what is needed for typeful distributed programming. They are a relatively lightweight extension of ML, should be efficiently implementable, and are expressive enough to enable a wide variety of distributed infrastructure layers to be written as simple library code above the byte-string network and persistent store APIs. This disentangles the language runtime from communication intricacies. This paper highlights the main design choices in Acute. It is supported by a full language definition (of typing, compilation, and operational semantics), by a prototype implementation, and by example distribution libraries.

show abstract

Flexible Bytecode for Linking in .NET

Cited by 8 publications

References 18 publications

Modelling a JVM for polymorphic bytecode.

Modelling a JVM for polymorphic bytecode.

Component Adaptation in Contemporary Execution Environments

Acute: High-level programming language design for distributed computation

Contact Info

Product

Resources

About