Modular type-based reverse engineering of parameterized types in Java code

Duggan, Dominic

doi:10.1145/320384.320393

Cited by 22 publications

(18 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While our system aims to reuse contours across different call sites and only produces a few contours on average for each type scheme, his system is fully context-sensitive and always instantiates a type scheme differently in every different context. Duggan has also proposed a system to automatically detect polymorphic Java classes [Dug99]. His proposal does not appear to be as precise as ours.…”

Section: Related Workmentioning

confidence: 81%

Precise Constraint-Based Type Inference for Java

Wang

Smith

2001

ECOOP 2001 — Object-Oriented Programming

View full text Add to dashboard Cite

Abstract. Precise type information is invaluable for analysis and optimization of object-oriented programs. Some forms of polymorphism found in object-oriented languages pose significant difficulty for type inference, in particular data polymorphism. Agesen's Cartesian Product Algorithm (CPA) can analyze programs with parametric polymorphism in a reasonably precise and efficient manner, but CPA loses precision for programs with data polymorphism. This paper presents a precise constraintbased type inference system for Java. It uses Data-Polymorphic CPA (DCPA), a novel constraint-based type inference algorithm which extends CPA with the ability to accurately and efficiently analyze data polymorphic programs. The system is implemented for the full Java language, and is used to statically verify the correctness of Java downcasts. Benchmark results are given which show that DCPA is significantly more accurate than CPA and the efficiency of DCPA is close to CPA.

show abstract

Section: Related Workmentioning

confidence: 81%

Precise Constraint-Based Type Inference for Java

Wang

Smith

2001

ECOOP 2001 — Object-Oriented Programming

View full text Add to dashboard Cite

show abstract

“…Recently, Duggan [1999] has proposed a technique to translate monomorphic classes to parametric classes by inferring type argument information. He has also defined a polymorphic extension of Java, slightly less expressive than GJ (for example, polymorphic methods are not allowed, and a subclass must have the same number of type arguments as its superclass).…”

Section: Generic Extensions Of Javamentioning

confidence: 99%

Featherweight Java

Igarashi

Pierce

Wadler

2001

ACM Trans. Program. Lang. Syst.

785

700

View full text Add to dashboard Cite

Several recent studies have introduced lightweight versions of Java: reduced languages in which complex features like threads and reflection are dropped to enable rigorous arguments about key properties such as type safety. We carry this process a step further, omitting almost all features of the full language (including interfaces and even assignment) to obtain a small calculus, Featherweight Java, for which rigorous proofs are not only possible but easy. Featherweight Java bears a similar relation to Java as the lambda-calculus does to languages such as ML and Haskell. It offers a similar computational "feel," providing classes, methods, fields, inheritance, and dynamic typecasts with a semantics closely following Java's. A proof of type safety for Featherweight Java thus illustrates many of the interesting features of a safety proof for the full language, while remaining pleasingly compact. The minimal syntax, typing rules, and operational semantics of Featherweight Java make it a handy tool for studying the consequences of extensions and variations. As an illustration of its utility in this regard, we extend Featherweight Java with generic classes in the style of GJ (Bracha, Odersky, Stoutamire, and Wadler) and give a detailed proof of type safety. The extended system formalizes for the first time some of the key features of GJ.

show abstract

“…Recently, generic type has become a main thrust in supporting software reuse. In reusing Java code, several works have proposed for refactoring legacy Java programs into those that use generic versions of popular container classes [10,11,14,40].…”

Section: Resultsmentioning

confidence: 99%

A flow-based approach for variant parametric types

Chin

Craciun

Khoo

et al. 2006

Proceedings of the 21st Annual ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications

View full text Add to dashboard Cite

A promising approach for type-safe generic codes in the objectoriented paradigm is variant parametric type, which allows covariant and contravariant subtyping on fields where appropriate. Previous approaches formalise variant type as a special case of the existential type system. In this paper, we present a new framework based on flow analysis and modular type checking to provide a simple but accurate model for capturing generic types. Our scheme stands to benefit from past (and future) advances in flow analysis and subtyping constraints. Furthermore, it fully supports casting for variant types with a special reflection mechanism, called cast capture, to handle objects with unknown types. We have built a constraint-based type checker and have proven its soundness. We have also successfully annotated a suite of Java libraries and client code with our flow-based variant type system.

show abstract

Modular type-based reverse engineering of parameterized types in Java code

Cited by 22 publications

References 10 publications

Precise Constraint-Based Type Inference for Java

Precise Constraint-Based Type Inference for Java

Featherweight Java

A flow-based approach for variant parametric types

Contact Info

Product

Resources

About