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. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
