Run-time check elimination for Ada 9X

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Run-time check elimination for Ada 9X

Full text

Pdf (1.91 MB)

Source

Annual International Conference on Ada archive
Proceedings of the conference on TRI-Ada '94 table of contents

Baltimore, Maryland, United States

Pages: 122 - 128

Year of Publication: 1994

ISBN:0-89791-666-2

Author

Peter Lützen Møller

DDC-I A/S, Gl. Lundtoftevej 1B, DK-2800 Lyngby, Denmark

Sponsor

SIGADA: ACM Special Interest Group on Ada Programming Language

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 4, Citation Count: 2

Additional Information:

abstract references cited by index terms peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/197694.197713 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	W. H. Harrison: Compiler Analysis of the Value Ranges for Variables. IEEE Transactions on Software Engineering, vol. SE-3, no. 3, May 1977, 243- 25O
	2	P. L. Mzller: Elimination of Redundant Run Time Checks in Ada 9X. master thesis, Technical Univ. of Denmark, Feb. 1993
	3	Alexander Sakharov, Propagation of constants and assertions, ACM SIGPLAN Notices, v.29 n.5, p.3-6, May 1994 [doi>10.1145/181734.181735]
	4	B. Schwarz , W. Kirchgässner , R. Landwehr, An optimizer for Ada - design, experiences and results, Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, p.175-184, June 20-24, 1988, Atlanta, Georgia, United States
	5	J. Welsh: Economic Range Checks in Pascal. Software- Practice and Experience, vol. 8 (1978), 85- 97

CITED BY 2

	Jørgen Bundgaard, 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, p.436-445, November 05-10, 1995, Anaheim, California, United States
	Sheri J. Bernstein , Robert S. Duff, Optimizing Ada on the fly, ACM SIGAda Ada Letters, v.XIX n.3, p.169-179, Sept. 1999