Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Harrison, W. H.: Compiler Analysis of the Value Ranges for Variables. IEEE Transactions on Software Engineering, vol. SE-3, no. 3, May 1977, 243–250
Møller, P. L.: Elimination of Redundant Run Time Checks in Ada 9X, master thesis, Technical Univ. of Denmark, Feb. 1993
Sakharov, A.: Propagation of Constants and Assertions, ACM Sigplan Notices, vol. 29, no. 5, May 1994
Schwartz, B., Kirchgässner, W., Landwehr, R.: An Optimizer for Ada — Design, Experiences and Results. Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, Atlanta, Georgia, June 1988, 175–184
Welsh, J.: Economic Range Checks in Pascal. Software — Practice and Experience, vol. 8 (1978), 85–97
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Møller, P.L. (1994). Run-time check elimination for Ada 9X. In: Toussaint, M. (eds) Ada in Europe. Ada-Europe 1994. Lecture Notes in Computer Science, vol 887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58822-1_84
Download citation
DOI: https://doi.org/10.1007/3-540-58822-1_84
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58822-1
Online ISBN: 978-3-540-49110-1
eBook Packages: Springer Book Archive