An optimizer for Ada - design, experiences and results
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Optimization of array subscript range checks
ACM Letters on Programming Languages and Systems (LOPLAS)
Run-time check elimination for Ada 9X
TRI-Ada '94 Proceedings of the conference on TRI-Ada '94
A reexamination of “Optimization of array subscript range checks”
ACM Transactions on Programming Languages and Systems (TOPLAS)
Elimination of redundant array subscript range checks
PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
Modern compiler implementation in Java
Modern compiler implementation in Java
Program Flow Analysis: Theory and Application
Program Flow Analysis: Theory and Application
Optimization of range checking
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
| Hi-index | 0.00 |
One of the features that makes Ada such a reliable programming language is its use of run-time constraint checks. However, such checks slow program execution and increase program size.The AdaMagic™ compiler uses one-pass, on-the-fly flow analysis during intermediate-language generation specifically to eliminate unnecessary constraint checks and to warn about potential error situations such as the use of uninitialized variables.The one-pass nature of our method allows for faster compile times than more elaborate multi-pass flow analysis. Thus, we are able to generate efficient code without the impact on compile-time, and without the added implementation complexity, associated with a traditional separate optimization phase.