[PDF][PDF] Program analysis and specialization for the C programming language

LO Andersen - 1994 - Citeseer
Software engineers are faced with a dilemma. They want to write general and wellstructured
programs that are flexible and easy to maintain. On the other hand, generality has a price …

Efficient context-sensitive pointer analysis for C programs

RP Wilson, MS Lam - ACM Sigplan Notices, 1995 - dl.acm.org
This paper proposes an efficient technique for context-sensitive pointer analysis that is
applicable to real C programs. For efficiency, we summarize the effects of procedures using …

Optimizing dynamically-dispatched calls with run-time type feedback

U Hölzle, D Ungar - Proceedings of the ACM SIGPLAN 1994 conference …, 1994 - dl.acm.org
Abstrach Object-oriented programs are difficult to optimize because they execute many
dynamically-dispatched calls. These calls cannot easily be eliminated because the compiler …

[書籍][B] Adaptive optimization for SELF: reconciling high performance with exploratory programming

U Holzle - 1994 - search.proquest.com
Crossing abstraction boundaries often incurs a substantial run-time overhead in the form of
frequent procedure calls. Thus, pervasive use of abstraction, while desirable from a design …

Hybrid analysis: static & dynamic memory reference analysis

S Rus, L Rauchwerger, J Hoeflinger - Proceedings of the 16th …, 2002 - dl.acm.org
We present a novel Hybrid Analysis technology which can efficiently and seamlessly
integrate all static and run-time analysis of memory references into a single framework that is …

Eliminating virtual function calls in C++ programs

G Aigner, U Hölzle - European conference on object-oriented …, 1996 - Springer
We have designed and implemented an optimizing source-to-source C++ compiler that
reduces the frequency of virtual function calls. Our prototype implementation demonstrates …

[書籍][B] An optimizing Fortran D compiler for MIMD distributed-memory machines

CW Tseng - 1993 - search.proquest.com
Massively parallel MIMD distributed-memory machines can provide enormous
computational power; however, the difficulty of develo** parallel programs for these …

A methodology for procedure cloning

KD Cooper, MW Hall, K Kennedy - Computer Languages, 1993 - Elsevier
Procedure cloning is an interprocedural transformation where the compiler creates
specialized copies of procedure bodies. The compiler divides incoming calls between the …

ThinLTO: scalable and incremental LTO

T Johnson, M Amini, XD Li - 2017 IEEE/ACM International …, 2017 - ieeexplore.ieee.org
Cross-Module Optimization (CMO) is an effective means for improving runtime performance,
by extending the scope of optimizations across source module boundaries. Two CMO …

Efficient call graph analysis

MW Hall, K Kennedy - ACM Letters on Programming Languages and …, 1992 - dl.acm.org
We present an efficient algorithm for computing the procedure call graph, the program
representation underlying most interprocedural optimization techniques. The algorithm …