Elimination of redundant array subscript range checks

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn Part F129371, Issue , 1995, Pages 270-278

  Kolte, Priyadarshan ^a   Wolfe, Michael ^a  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; PROGRAM COMPILERS;

ARRAY SUBSCRIPTS; BENCHMARK PROGRAMS; COMPILER OPTIMIZATIONS; MARGINAL BENEFIT; OPTIMIZATION ALGORITHMS; PARTIAL REDUNDANCY ELIMINATIONS; RUNTIMES;

OPTIMIZATION;

EID: 85030182593     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/207110.207160     Document Type: Conference Paper

References (18)

1. A. V. Aho, R. Sethi, J. D. Ullman. Compilers, Principles, Techniques, Tools. Addison-Wesley, 1986.
2. J. M. Asuru. Optimization of array subscript range checks. ACM Letters on Programming Languages and Systems, vol. 1, no. 2, 109-118, June 1992.
3. P. Briggs and K. D. Cooper. Effective partial redundancy elimination. Proceedings of the ACM SIGPLAN '94 Conference on Programming Language Design and Implementation, 159-170, June, 1994.
4. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. Conference Record of the 4th ACM Symposium on Principles of Programming Languages, 238-252, January, 1977.
5. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. Conference Record of the 5 ACM Symposium on Principles of Programming Languages, 84-96, January, 1978.
6. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, vol. 13, no. 4, pp. 451-490, October, 1991.
7. M. P. Gerlek, E. Stoltz, M. Wolfe. Beyond induction variables: Detecting and classifying sequences using a demand-driven SSA form. A CM Transactions on Programming Languages and Systems, to appear.
8. S. M. German. Automating proofs of the absence of common runtime errors. Conference Record of the 5th ACM Symposium on Principles of Programming Languages, 105-118, January, 1978.
9. R. Gupta. A fresh look at optimizing array bound checking. Proceedings of the ACM SIGPLAN '90 Conference on Programming Language Design and Implementation, 272-282, June, 1990.
10. R. Gupta. Optimizing array bound checks using flow analysis. A CM Letters on Programming Languages and Systems, vol. 2, nos. 1-4, 135-150, March-December, 1993.
11. W. H. Harrison. Compiler analysis for the value ranges for variables. IEEE Transactions on Software Engineering, SE-3, 3, 243-250, May, 1977.
12. J. Knoop, O. Ruthing, B. Steffen. Lazy code motion. Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation, 224-234, June, 1992.
13. V. Markstein, J. Cocke, P. Markstein. Optimization of range checking. Proceedings of the SIGPLAN '82 Symposium on Compiler Construction, 114-119, June 1982.
14. E. Morel. Data flow analysis and global optimization, in Methods and tools for compiler construction, B. Lorho (ed.), Cambridge University Press, New York, 289-315, 1984.
15. E. Morel and C. Renvoise. Global optimization by suppression of partial redundancies. Communications of the ACM, vol. 2, no. 2, 96-103, February, 1979.
16. B. Schwarz, W. Kirchgassner, R. Landwehr. An optimizer for Ada-design, experiences and results. Proceedings SIGPLAN '88 Oonference on Programming Language Design and Implementation, 175-185, June, 1988.
17. N. Suzuki and K. Ishihata. Implementation of an array bound checker. Conference Record of the 4th ACM Symposium on Principles of Programming Languages, 132-143, January, 1977.
18. M. Wolfe. Beyond induction variables. Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation, 162-174, June, 1992.