Equational logic as a programming language
Equational logic as a programming language
Language and machine-independent global optimization on intermediate code
Computer Languages
An experiment with inline substitution
Software—Practice & Experience
Procedure merging with instruction caches
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Compiling with continuations
Subprogram Inlining: A Study of its Effects on Program Execution Time
IEEE Transactions on Software Engineering
Profile-guided automatic inline expansion for C programs
Software—Practice & Experience
Computational aspects of inlining
Computational aspects of inlining
Benchmarking implementations of lazy functional languages
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
On the conversion of indirect to direct recursion
ACM Letters on Programming Languages and Systems (LOPLAS)
An analysis of inline substitution for a structured programming language
Communications of the ACM
Inlining to Reduce Stack Space
PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming
Program improvement by the selective integration of procedure calls
Program improvement by the selective integration of procedure calls
EQUALS – a fast parallel implementation of a lazy language
Journal of Functional Programming
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
An Improved Min-Cut Algonthm for Partitioning VLSI Networks
IEEE Transactions on Computers
Online feedback-directed optimization of Java
OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
An Empirical Study of Method In-lining for a Java Just-in-Time Compiler
Proceedings of the 2nd Java Virtual Machine Research and Technology Symposium
On the side-effects of code abstraction
Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems
Scalable High Performance Cross-Module Inlining
Proceedings of the 13th International Conference on Parallel Architectures and Compilation Techniques
Design and evaluation of dynamic optimizations for a Java just-in-time compiler
ACM Transactions on Programming Languages and Systems (TOPLAS)
Interface Abstraction for Compositional Verificatio
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Inline Analysis: Beyond Selection Heuristics
Proceedings of the International Symposium on Code Generation and Optimization
Jolt: lightweight dynamic analysis and removal of object churn
Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
Program Transformations under Dynamic Security Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
Aggressive function inlining: preventing loop blockings in the instruction cache
HiPEAC'08 Proceedings of the 3rd international conference on High performance embedded architectures and compilers
| Hi-index | 0.00 |
For efficiency and ease of implementation, many compilers implicitly impose an ''inlining policy'' to restrict the conditions under which a procedure may be inlined. An inlining technique consists of an inlining policy and a strategy for choosing a sequence of inlining operations that is consistent with the policy. The effectiveness of an inlining technique is affected by the restrictiveness of the inlining policy as well as the effectiveness of the (heuristic) inlining strategy. The focus of this paper is on the comparison of inlining policies and techniques, and the notions of power and flexibility are introduced. As a major case study, we identify and compare policies based on the version of the inlined procedure that is used.