Precise Constraint-Based Type Inference for Java

Wang, Zhihui; Smith, Scott F.

doi:10.1007/3-540-45337-7_6

Cited by 41 publications

(57 citation statements)

References 14 publications

(21 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ruf [22] compared context-insensitive analysis to using "assumption sets" as the context abstraction, and concluded that on C benchmarks, context sensitivity had little effect on the points-to sets of pointers that are actually dereferenced. Like object sensitivity, the Cartesian Product Algorithm [1,28] uses abstract objects as the context abstraction, but includes all method parameters as context, rather than only the receiver parameter. In the future, it would be interesting to empirically compare these additional variations of context-sensitive analysis with those studied in this paper.…”

Section: Related Workmentioning

confidence: 99%

Context-Sensitive Points-to Analysis: Is It Worth It?

Lhoták

Hendren

2006

Lecture Notes in Computer Science

145

155

View full text Add to dashboard Cite

Abstract. We present the results of an empirical study evaluating the precision of subset-based points-to analysis with several variations of context sensitivity on Java benchmarks of significant size. We compare the use of call site strings as the context abstraction, object sensitivity, and the BDD-based context-sensitive algorithm proposed by Zhu and Calman, and by Whaley and Lam. Our study includes analyses that context-sensitively specialize only pointer variables, as well as ones that also specialize the heap abstraction. We measure both characteristics of the points-to sets themselves, as well as effects on the precision of client analyses. To guide development of efficient analysis implementations, we measure the number of contexts, the number of distinct contexts, and the number of distinct points-to sets that arise with each context sensitivity variation. To evaluate precision, we measure the size of the call graph in terms of methods and edges, the number of devirtualizable call sites, and the number of casts statically provable to be safe.The results of our study indicate that object-sensitive analysis implementations are likely to scale better and more predictably than the other approaches; that object-sensitive analyses are more precise than comparable variations of the other approaches; that specializing the heap abstraction improves precision more than extending the length of context strings; and that the profusion of cycles in Java call graphs severely reduces precision of analyses that forsake context sensitivity in cyclic regions.

show abstract

Section: Related Workmentioning

confidence: 99%

Context-Sensitive Points-to Analysis: Is It Worth It?

Lhoták

Hendren

2006

Lecture Notes in Computer Science

145

155

View full text Add to dashboard Cite

show abstract

“…Since then, numerous systems have been developed for object-oriented languages (e.g. [30,31,32,33,65,66,34,67,68]). These, almost exclusively, assume the original program is completely untyped and employ set constraints (see [54,55]) as the mechanism for inferring types.…”

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

“…A secondary goal of type analysis is to type check programs, in case of downcasts or of unsafe type overriding, and it may save some dynamic type checks [Wang and Smith 2001]. 7.3.4 Dead code. An interesting by-product of type analysis is the ability to distinguish living and dead classes and code.…”

Section: · 35mentioning

confidence: 99%

Implementing statically typed object-oriented programming languages

Ducournau

2011

ACM Comput. Surv.

View full text Add to dashboard Cite

In statically typed object-oriented languages, message sending, or late binding, is implemented with tables often called virtual functions tables (VFT). Those tables reduce method calls to function calls, with a small fixed number of extra indirections. The overhead is more or less important, whether inheritance and subtyping are single or multiple.In this paper, we survey the various implementation schemes available in separate compilation, in the three cases of single inheritance, multiple inheritance, and single inheritance but multiple subtyping, e.g. Java. Many works have been done recently in the framework of global compilation, mostly for dynamically typed languages but also applied to the Eiffel language in the Small Eiffel compiler. We examine how global compilation can improve the implementation and propose to use global techniques-coloring and type analysis-in a separate compilation framework.

show abstract

Precise Constraint-Based Type Inference for Java

Cited by 41 publications

References 14 publications

Context-Sensitive Points-to Analysis: Is It Worth It?

Context-Sensitive Points-to Analysis: Is It Worth It?

A calculus for constraint-based flow typing

Implementing statically typed object-oriented programming languages

Contact Info

Product

Resources

About