A reexamination of “Optimization of array subscript range checks”

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A reexamination of “Optimization of array subscript range checks”

Full text

Pdf (638 KB)

Source

ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 17 , Issue 2 (March 1995) table of contents

Pages: 217 - 227

Year of Publication: 1995

ISSN:0164-0925

Authors

Wei-Ngan Chin	National Univ. of Singapore, Singapore
Eak-Khoon Goh	Defense Science Organization, Singapore

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 17, Citation Count: 3

Additional Information:

abstract references cited by index terms review collaborative colleagues

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/201059.201063 What is a DOI?

ABSTRACT

Jonathan Asuru proposed recently an enhanced method for optimizing array subscript range checks. The proposed method is however unsafe and may generate optimized programs whose behavior is different from the original program. Two main flaws in Asuru's method are described, together with suggested remedies and improvements.

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	Jonathan M. Asuru, Optimization of array subscript range checks, ACM Letters on Programming Languages and Systems (LOPLAS), v.1 n.2, p.109-118, June 1992 [doi>10.1145/151333.151392]
	2	Rajiv Gupta, A fresh look at optimizing array bound checking, Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation, p.272-282, June 1990, White Plains, New York, United States
	3	Rajiv Gupta, Optimizing array bound checks using flow analysis, ACM Letters on Programming Languages and Systems (LOPLAS), v.2 n.1-4, p.135-150, March–Dec. 1993 [doi>10.1145/176454.176507]
	4	Victoria Markstein , John Cocke , Peter Markstein, Optimization of range checking, Proceedings of the 1982 SIGPLAN symposium on Compiler construction, p.114-119, June 23-25, 1982, Boston, Massachusetts, United States

CITED BY 3

	Mikel Luján , Mikel Luján , John R. Gurd , T. L. Freeman , José Miguel, Elimination of Java array bounds checks in the presence of indirection, Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande, p.76-85, November 03-05, 2002, Seattle, Washington, USA
	Sheri J. Bernstein , Robert S. Duff, Optimizing Ada on the fly, ACM SIGAda Ada Letters, v.XIX n.3, p.169-179, Sept. 1999
	Thi Viet Nga Nguyen , François Irigoin, Efficient and effective array bound checking, ACM Transactions on Programming Languages and Systems (TOPLAS), v.27 n.3, p.527-570, May 2005

INDEX TERMS

Primary Classification:
D. Software
D.3 PROGRAMMING LANGUAGES
D.3.4 Processors
Subjects: Compilers

General Terms:
Languages, Reliability

Keywords:
backward checks propagation, integer programming, loop guard elimination, safe bound checks optimization

REVIEW

"Zoran D. Budimac : Reviewer"

Chin and Goh present and remedy some flaws in the optimization techniques of array subscript range checks, proposed in Asuru [1]. This paper reveals the flaws in three of Asuru's proposed techniques: loop guard elimination, conservative expres more...

Collaborative Colleagues:

Wei-Ngan Chin: colleagues

Eak-Khoon Goh: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player