Eliminating unnecessary array bounds checks in nests of loops

K. Psarris, D. Klappholz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Out-of-bounds array references are a source of bugs in sequential and parallel code. A potential solution to the problem is the introduction of run time bounds checks on all array references. However, run time checking of every array reference can result in a good deal of overhead and therefore eliminating unnecessary array bounds checks is extremely important. In this paper we provide methods for statically eliminating bounds checks or reducing the number of required run time checks for array references with linear subscript expression occurring in nests of loops.

Original languageEnglish
Title of host publicationProceedings - ICCI 1993
Subtitle of host publication5th International Conference on Computing and Information
EditorsWaldemar W. Koczkodaj, Osman Abou-Rabia, Carl K. Chang
Pages550-554
Number of pages5
ISBN (Electronic)0818642122, 9780818642128
DOIs
StatePublished - 1993
Event5th International Conference on Computing and Information, ICCI 1993 - Sudbury, Canada
Duration: 27 May 199329 May 1993

Publication series

NameProceedings - ICCI 1993: 5th International Conference on Computing and Information

Conference

Conference5th International Conference on Computing and Information, ICCI 1993
Country/TerritoryCanada
CitySudbury
Period27/05/9329/05/93

Keywords

  • Compiler Optimization
  • Flow Analysis
  • Program Analysis
  • Range Analysis

Fingerprint

Dive into the research topics of 'Eliminating unnecessary array bounds checks in nests of loops'. Together they form a unique fingerprint.

Cite this