A fragment calculus-towards a model of separate compilation, linking and binary compatibility

Drossopoulou, Sophia; Eisenbach, Susan; Wragg, David

doi:10.1109/lics.1999.782606

Cited by 27 publications

(26 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Every individual modification that led to the existence of the new version must have been such as to maintain binary compatibility and so is a binary compatible modification. Binary compatible modifications have been the subject of some study [10,11,7,8]. The way binary compatibility works is that at compile-time the compiler embeds symbolic references (not binary code!)…”

Section: Binary Compatibilitymentioning

confidence: 99%

See 1 more Smart Citation

Evolution of Distributed Java Programs

Eisenbach

Sadler

Shaikh

2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.A major challenge of maintaining object-oriented programs is to find a means of evolving software that already has a distributed client base. This should be easier for Java developers than for most, because dynamic linking has been designed into the runtime system. It turns out however that things are not so straightforward as they seem, since a given modification can leave a remote client in one of a number of states, not all of which are tolerable, let alone desirable. In this paper we attempt to delineate these states, and to consider ways of avoiding the worst of them. We describe our utility, which offers library developers a transparent version control system, to protect their remote clients.

show abstract

Section: Binary Compatibilitymentioning

confidence: 99%

“…The work described here arose directly out of theoretical work on binary compatibility done in collaboration with Drossopoulou and Wragg [7,8]. As binary compatibility was conceived to assist with the development of distributed libraries [10,11], we examined its effect on evolving libraries.…”

Section: Related Workmentioning

confidence: 99%

Evolution of Distributed Java Programs

Eisenbach

Sadler

Shaikh

2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…In Section 4 we define, for a small subset of Java, a type safe compilation schema. Note that this implies that we not only define the syntax for the source level, but also for the binary level, for which we also provide, in order to express and prove type safety, a simple execution model, partly inspired by those defined in [11,9], but much simpler, since our aim here is not to provide a realistic model of Java dynamic loading and linking, but to focus on type safety. Hence a contribution of the paper is also to define a kernel calculus for the Java Virtual Machine, in the spirit of other calculi that have been defined for modeling in isolation relevant aspects of the Java language [15,3].…”

Section: Introductionmentioning

confidence: 99%

A Formal Framework for Java Separate Compilation

Ancona

Lagorio

Zucca

2002

ECOOP 2002 — Object-Oriented Programming

View full text Add to dashboard Cite

Abstract. We define a formal notion, called compilation schema, suitable for specifying different possibilities for performing the overall process of Java compilation, which includes typechecking of source fragments with generation of corresponding binary code, typechecking of binary fragments, extraction of type information from fragments and definition of dependencies among them. We consider three compilation schemata of interest for Java, that is, minimal, SDK and safe, which correspond to a minimal set of checks, the checks performed by the SDK implementation, and all the checks needed to prevent run-time linkage errors, respectively. In order to demonstrate our approach, we define a kernel model for Java separate compilation and execution, consisting in a small Java subset, and a simple corresponding binary language for which we provide an operational semantics including run-time verification. We define a safe compilation schema for this language and formally prove type safety.

show abstract

“…Dynamic linking also allows late updates to code to occur. Drossopoulou et al have studied dynamic linking in detail [14,12,15]. They provide details of when linking errors will occur under changes of class definitions, paying close attention to when different phases of the compilation occur, such as field layout.…”

Section: Related Workmentioning

confidence: 99%

UpgradeJ: Incremental Typechecking for Class Upgrades

Bierman

Parkinson

Noble

ECOOP 2008 – Object-Oriented Programming

View full text Add to dashboard Cite

One of the problems facing developers is the constant evolution of components that are used to build applications. This evolution is typical of any multi-person or multi-site software project. How can we program in this environment? More precisely, how can language design address such evolution? In this paper we attack two significant issues that arise from constant component evolution: we propose language-level extensions that permit multiple, co-existing versions of classes and the ability to dynamically upgrade from one version of a class to another, whilst still maintaining type safety guarantees and requiring only lightweight extensions to the runtime infrastructure. We show how our extensions, whilst intuitive, provide a great deal of power by giving a number of examples. Given the subtlety of the problem, we formalize a core fragment of our language and prove a number of important safety properties.

show abstract

A fragment calculus-towards a model of separate compilation, linking and binary compatibility

Cited by 27 publications

References 12 publications

Evolution of Distributed Java Programs

Evolution of Distributed Java Programs

A Formal Framework for Java Separate Compilation

UpgradeJ: Incremental Typechecking for Class Upgrades

Contact Info

Product

Resources

About