One of the main obstacles to program comprehension and software maintenance is the lack of information about the types of variables in a source code. In this paper, we explore the effectiveness of type inference using textual hints. We formulate the type inference problem as a classification task where we train classification models to use textual features in the source code to predict the type of new variables in a program. To evaluate the effectiveness of this approach, we train and test several classifiers on types of variables in five open-source Java projects from two open-source organizations under different scenarios. The choice of Java provides us with a large number of instances with accurate labeling to assess our classification a...
Typeless programming in Java 5.0 with wildcards With the introduction of Java 5.0 [8] the type syste...
We describe Jqual, a practical framework for type qualifier inference in Java. Jqual is implemented ...
Type-checked object-oriented languages have typically been designed with extremely simple type syste...
Dynamically typed languages lack information about the types of variables in the source code. Develo...
Although dynamically typed languages allow developers to be more productive in writing source code, ...
Dynamically typed languages allow developers to write more expressive source code, but their lack of...
Abstract. The race condition checker rccjava uses a formal type system to statically identify potent...
Abstract. With the introduction of Java 5.0 [1] the type system has been extended by parameterized t...
The lack of static type information is one of the main obstacles to program comprehension in dynamic...
Java’s type system provides programmers with strong guarantees of type and memory safety, but there ...
AbstractThe race condition checker rccjava uses a formal type system to statically identify potentia...
We present a new approach to inferring types in untyped object-oriented programs with inheritance, a...
This thesis begins with an overview of type systems: evolution, concepts, and problems. This survey ...
Maintaining large code bases written in dynamically typed languages, such as JavaScript or Python, c...
A partial type inference technique should come with a simple and precise specification, so that user...
Typeless programming in Java 5.0 with wildcards With the introduction of Java 5.0 [8] the type syste...
We describe Jqual, a practical framework for type qualifier inference in Java. Jqual is implemented ...
Type-checked object-oriented languages have typically been designed with extremely simple type syste...
Dynamically typed languages lack information about the types of variables in the source code. Develo...
Although dynamically typed languages allow developers to be more productive in writing source code, ...
Dynamically typed languages allow developers to write more expressive source code, but their lack of...
Abstract. The race condition checker rccjava uses a formal type system to statically identify potent...
Abstract. With the introduction of Java 5.0 [1] the type system has been extended by parameterized t...
The lack of static type information is one of the main obstacles to program comprehension in dynamic...
Java’s type system provides programmers with strong guarantees of type and memory safety, but there ...
AbstractThe race condition checker rccjava uses a formal type system to statically identify potentia...
We present a new approach to inferring types in untyped object-oriented programs with inheritance, a...
This thesis begins with an overview of type systems: evolution, concepts, and problems. This survey ...
Maintaining large code bases written in dynamically typed languages, such as JavaScript or Python, c...
A partial type inference technique should come with a simple and precise specification, so that user...
Typeless programming in Java 5.0 with wildcards With the introduction of Java 5.0 [8] the type syste...
We describe Jqual, a practical framework for type qualifier inference in Java. Jqual is implemented ...
Type-checked object-oriented languages have typically been designed with extremely simple type syste...