Unreachable procedures in object-oriented programming

Srivastava, Amitabh

doi:10.1145/161494.161517

Cited by 49 publications

(14 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We presented a family of low-cost algorithms for constructing call graphs of Scala programs, in the spirit of Name-Based Resolution (RA) [26], Class Hierarchy Analysis (CHA) [9] and Rapid Type Analysis (RTA) [6]. Our algorithms consider how traits are combined in a Scala program to improve precision and handle the full Scala language, including features such as abstract type members, closures, and path-dependent types.…”

Section: Discussionmentioning

confidence: 99%

“…Our focus is on adapting low-cost algorithms to Scala, in particular Name-Based Resolution (RA) [26], Class Hierarchy Analysis (CHA) [9], and Rapid Type Analysis (RTA) [6]. We consider how key Scala features such as traits, abstract type members, and closures can be accommodated, and present a family of successively more precise algorithms.…”

Section: Introductionmentioning

confidence: 99%

“…We present variations on the RA [26] and RTA [6] algorithms for Scala. To our knowledge, these are the first call graph construction algorithms designed for Scala.…”

Section: Introductionmentioning

confidence: 99%

“…The main challenge in constructing call graphs of object-oriented programs is in approximating the behavior of dynamically dispatched (virtual) method calls. Early work (see, e.g., [26]) simply assumed that a virtual call e.m(· · · ) can invoke any method with the same name m. This approach can be captured using the following constraints:…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Constructing Call Graphs of Scala Programs

Ali

Rapoport

Lhoták

et al. 2014

ECOOP 2014 – Object-Oriented Programming

View full text Add to dashboard Cite

Abstract. ConsAs Scala gains popularity, there is growing interest in programming tools for it. Such tools often require call graphs. However, call graph construction algorithms in the literature do not handle Scala features, such as traits and abstract type members. Applying existing call graph construction algorithms to the JVM bytecodes generated by the Scala compiler produces very imprecise results due to type information being lost during compilation. We adapt existing call graph construction algorithms, Name-Based Resolution (RA) and Rapid Type Analysis (RTA), for Scala, and present a formalization based on Featherweight Scala. We evaluate our algorithms on a collection of Scala programs. Our results show that careful handling of complex Scala constructs greatly helps precision and that our most precise analysis generates call graphs with 1.1-3.7 times fewer nodes and 1.5-18.7 times fewer edges than a bytecode-based RTA analysis.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…We present variations on the RA [26] and RTA [6] algorithms for Scala. To our knowledge, these are the first call graph construction algorithms designed for Scala.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Constructing Call Graphs of Scala Programs

Ali

Rapoport

Lhoták

et al. 2014

ECOOP 2014 – Object-Oriented Programming

View full text Add to dashboard Cite

show abstract

“…Such information is not available in native binary programs. Srivastava [1992] has studied the removal of unreachable procedures in objectoriented programming environments as well.…”

Section: Other Program Compaction Techniquesmentioning

confidence: 99%

Link-time binary rewriting techniques for program compaction

Sutter

Bus

Bosschere

2005

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

Small program size is an important requirement for embedded systems with limited amounts of memory. We describe how link-time compaction through binary rewriting can achieve code size reductions of up to 62% for statically bound languages such as C, C++, and Fortran, without compromising on performance. We demonstrate how the limited amount of information about a program at link time can be exploited to overcome overhead resulting from separate compilation. This is done with scalable, cost-effective, whole-program analyses, optimizations, and duplicate code and data elimination techniques. The discussed techniques are evaluated and their cost-effectiveness is quantified with SQUEEZE++, a prototype link-time compactor.

show abstract

alto: a link‐time optimizer for the Compaq Alpha

Muth¹,

Debray

Watterson

et al. 2001

Softw: Pract. Exper.

View full text Add to dashboard Cite

Traditional optimizing compilers are limited in the scope of their optimizations by the fact that only a single function, or possibly a single module, is available for analysis and optimization. In particular, this means that library routines cannot be optimized to specific calling contexts. Other optimization opportunities, exploiting information not available before link time, such as addresses of variables and the final code layout, are often ignored because linkers are traditionally unsophisticated. A possible solution is to carry out whole‐program optimization at link time. This paper describes alto, a link‐time optimizer for the Compaq Alpha architecture. It is able to realize significant performance improvements even for programs compiled with a good optimizing compiler with a high level of optimization. The resulting code is considerably faster than that obtained using the OM link‐time optimizer, even when the latter is used in conjunction with profile‐guided and inter‐file compile‐time optimizations. Copyright © 2001 John Wiley & Sons, Ltd.

show abstract

Unreachable procedures in object-oriented programming

Cited by 49 publications

References 2 publications

Constructing Call Graphs of Scala Programs

Constructing Call Graphs of Scala Programs

Link-time binary rewriting techniques for program compaction

alto: a link‐time optimizer for the Compaq Alpha

Contact Info

Product

Resources

About