Customization of Java Library Classes Using Type Constraints and Profile Information

Sutter, Bjorn De; Tip, Frank; Dolby, Julian

doi:10.1007/978-3-540-24851-4_27

Cited by 17 publications

(23 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This section extends a model of type constraints used and modified by several authors [22,4,25,26]; which was initially presented by Palsberg and Schwartzbach [27]. This extension proposes a set of constraint generation rules for the polymorphic version of AspectJ.…”

Section: Aspect-aware Type Constraintsmentioning

confidence: 98%

Inference rules for generic code migration of aspect-oriented programs

Rubbo

Piveta

Nunes

2013

Science of Computer Programming

View full text Add to dashboard Cite

a b s t r a c tSeveral changes occurred in the AspectJ language to provide support for parametric polymorphism. Such changes aim to improve the source code type safety and to prepare the language to support generic code migration. Current approaches for this kind of migration focus only on object-oriented code. Therefore, they do not consider the use of aspects to encapsulate crosscutting concerns. We propose a collection of type constraint rules for the polymorphic version of AspectJ. These rules are used together with an existing constraint based algorithm to enable the conversion of non-generic code to add actual type parameters in both Java and AspectJ languages.

show abstract

Section: Aspect-aware Type Constraintsmentioning

confidence: 98%

Inference rules for generic code migration of aspect-oriented programs

Rubbo

Piveta

Nunes

2013

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…Type constraints are a formalism for expressing relationships between the types of declarations and expressions that has traditionally been used for type-checking, type inference, and more recently for refactoring [31,30,14]. We extend the type constraints framework of [31] to determine where declarations and allocation sites can be transformed, as per migrations in M, without affecting program behavior.…”

Section: Type Constraintsmentioning

confidence: 99%

Refactoring support for class library migration

2005

Self Cite

View full text Add to dashboard Cite

As object-oriented class libraries evolve, classes are occasionally deprecated in favor of others with roughly the same functionality. In Java's standard libraries, for example, class Hashtable has been superseded by HashMap, and Iterator is now preferred over Enumeration. Migrating client applications to use the new idioms is often desirable, but making the required changes to declarations and allocation sites can be quite labor-intensive. Moreover, migration becomes complicated-and sometimes impossible-if an application interacts with external components, if a legacy class is not completely equivalent to its replacement, or if multiple interdependent classes must be migrated simultaneously. We present an approach in which mappings between legacy classes and their replacements are specified by the programmer. Then, an analysis based on type constraints determines where declarations and allocation sites can be updated. The method was implemented in Eclipse, and evaluated on a number of Java applications. On average, our tool could migrate more than 90% of the references to legacy classes.

show abstract

“…Such systems also share a strong relationship with constraint-based program analyses (e.g. [55,69,58,70]), such as alias or points-to analysis (e.g. [71,72,73,74]).…”

Section: Related Workmentioning

confidence: 99%

A calculus for constraint-based flow typing

Pearce

2013

Proceedings of the 15th Workshop on Formal Techniques for Java-Like Programs

View full text Add to dashboard Cite

Flow typing offers an alternative to traditional Hindley-Milner type inference. A key distinction is that variables may have different types at different program points. Flow typing systems are typically formalised in the style of a dataflow analysis. In the presence of loops, this requires a fix-point computation over typing environments. Unfortunately, for some flow typing problems, the standard iterative fix-point computation may not terminate. We formalise such a problem we encountered in developing the Whiley programming language, and present a novel constraint-based solution which is guaranteed to terminate. This provides a foundation for others when developing such flow typing systems.

show abstract

Customization of Java Library Classes Using Type Constraints and Profile Information

Cited by 17 publications

References 29 publications

Inference rules for generic code migration of aspect-oriented programs

Inference rules for generic code migration of aspect-oriented programs

Refactoring support for class library migration

A calculus for constraint-based flow typing

Contact Info

Product

Resources

About