A Fragment Calculus Towards a Model of Separate Compilation, Linking and Binary Compatibility

Authors:
Sophia Drossopoulou;Susan Eisenbach;David Wragg
Affiliations:
-;-;-
Venue:
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Year:
1999

Citing 0
Cited 21

Formalizing the safety of Java, the Java virtual machine, and Java card

ACM Computing Surveys (CSUR)
A Calculus for Link-Time Compilation

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
A Calculus for Compiling and Linking Classes

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
A Formal Framework for Java Separate Compilation

ECOOP '02 Proceedings of the 16th 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
Evolution of Distributed Java Programs

CD '02 Proceedings of the IFIP/ACM Working Conference on Component Deployment
Equational Reasoning for Linking with First-Class Primitive Modules

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Changing Java Programs

ICSM '01 Proceedings of the IEEE International Conference on Software Maintenance (ICSM'01)
Jam---designing a Java extension with mixins

ACM Transactions on Programming Languages and Systems (TOPLAS)
A calculus of module systems

Journal of Functional Programming
Modular typechecking for hierarchically extensible datatypes and functions

ACM Transactions on Programming Languages and Systems (TOPLAS)
Practical predicate dispatch

OOPSLA '04 Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Acute: high-level programming language design for distributed computation

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
MultiJava: Design rationale, compiler implementation, and applications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Method overloading and overriding cause encapsulation flaw: an experiment on assembly of heterogeneous components

Proceedings of the 2006 ACM symposium on Applied computing
A flexible model for dynamic linking in Java and C#

Theoretical Computer Science
Acute: High-level programming language design for distributed computation

Journal of Functional Programming
UpgradeJ: Incremental Typechecking for Class Upgrades

ECOOP '08 Proceedings of the 22nd European conference on Object-Oriented Programming
Flexible models for dynamic linking

ESOP'03 Proceedings of the 12th European conference on Programming
MetaKlaim: meta-programming for global computing

SAIG'01 Proceedings of the 2nd international conference on Semantics, applications, and implementation of program generation
A framework for modular linking in OO languages

JMLC'06 Proceedings of the 7th joint conference on Modular Programming Languages

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose a calculus describing compilation and linking in terms of operations on fragments, i.e. compilation units, without reference to their specific contents. We believe this calculus faithfully reflects the situation within modern programming systems.Binary compatibility in Java prescribes conditions under which modification of fragments does not necessitate recompilation of importing fragments. We apply our calculus to formalize binary compatibility, and demonstrate that several interpretations of the language specification are possible, each with different ramifications. We choose a particular interpretation, justify our choice, formulate and prove properties important for language designers and code library developers.