Binary component adaptation

  • Ralph Keller
  • Urs Hölzle
Conference paper

DOI: 10.1007/BFb0054097

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1445)
Cite this paper as:
Keller R., Hölzle U. (1998) Binary component adaptation. In: Jul E. (eds) ECOOP’98 — Object-Oriented Programming. ECOOP 1998. Lecture Notes in Computer Science, vol 1445. Springer, Berlin, Heidelberg

Abstract

Binary component adaptation (BCA) allows components to be adapted and evolved in binary form and on-the-fly (during program loading). BCA rewrites component binaries before (or while) they are loaded, requires no source code access and guarantees release-to-release compatibility. That is, an adaptation is guaranteed to be compatible with a new binary release of the component as long as the new release itself is compatible with clients compiled using the earlier release. We describe our implementation of BCA for Java and demonstrate its usefulness by showing how it can solve a number of important integration and evolution problems. Even though our current implementation was designed for easy integration with Sun's JDK 1.1 VM rather than for ultimate speed, the load-time overhead introduced by BCA is small, in the range of one or two seconds. With its flexibility, relatively simple implementation, and low overhead, binary component adaptation could significantly improve the reusability of Java components.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Ralph Keller
    • 1
  • Urs Hölzle
    • 1
  1. 1.Dept. of Computer ScienceUniv. of CaliforniaSanta Barbara

Personalised recommendations