An optimizer for Ada - design, experiences and results
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Propagation of constants and assertions
ACM SIGPLAN Notices
Proceedings of the 1999 annual ACM SIGAda international conference on Ada
An ANDF based Ada 95 compiler system
Proceedings of the conference on TRI-Ada '95: Ada's role in global markets: solutions for a changing complex world
| Hi-index | 0.00 |
An approach to the elimination of run-time checks in Ada 9X is presented. The approach is a flow analysis approach based on a combination of range propagation and assertion propagation. Range propagation computes estimates for the dynamic characteristics of program entities, for example the values of objects, while assertion propagation maintains valid assertions derived from assignments and conditions of the program. This approach offers a simple alternative to the more complex approach of a theorem prover.