摘要：A recent trend in program development is the employment of generic software components such as libraries and frameworks. Typically, however, it is difficult to achieve both genericity and runtime execution efficiency simultaneously. Therefore, many researchers have studied program specialization, which is one technique to translate a generic program automatically into an efficient program specialized for a specific runtime environment. However, it is very difficult to implement a system that can specialize practical applications. Although some possible reasons exist for the problem, this paper focuses on the problems of instruction-dependent processes. Each necessary analysis for existing program specializer systems must include instruction-dependent processes. Therefore, not only does the code size of the specializer get larger, but maintainability and reliability are also degraded. Then, we propose a new algorithm of logic-based binding time analysis using reaching definitions analysis, which is widely used among many other analyses. We also evaluate how this technique improves the implementation simplicity of binding time analyzer: the code size is reduced by about 10%. Especially, instruction-dependent processes are almost entirely eliminated.
Loading...
