Chris Bentley, Scott A. Watterson, David K. Lowenthal  Home/Search
Context Related
| uga.edu/~dkl/research/papers...wwc02.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uga.edu/~dkl/resea...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Several programming languages guarantee that array subscripts are checked to ensure they are within the array bounds. While this guarantee improves the correctness and security of array-based code, it adds overhead to array references. This is unacceptable in array-intensive scientific codes; some estimates show more than 60% overhead for array bounds checking. (Update)
Cited by: More
Active Libraries and Universal Languages - Veldhuizen (2004) (Correct)
Active bibliography (related documents): More All
0.5: Type Refinements - Harper, Pfenning (2001) (Correct)
0.1: An Efficient and Backwards-Compatible Transformation to.. - Xu, DuVarney, Sekar (2004) (Correct)
0.1: A Comparison of Publicly Available Tools for Dynamic Buffer.. - Wilander, Kamkar (2003) (Correct)
Similar documents based on text: More All
0.4: Cv - Lowenthal (Correct)
0.3: Client-Centered Energy Savings for Concurrent HTTP.. - Yan, Krishnan.. (2004) (Correct)
0.2: Architecture-Independent Parallelism for Both Sharedand.. - Lowenthal, Freeh (Correct)
Related documents from co-citation: More All
2: ISSN 10406042 (context) - Veldhuizen, Report et al. - 1995
BibTeX entry: (Update)
Chris Bentley, Scott A. Watterson, and David K. Lowenthal. A comparison of array bounds checking on superscalar and VLIW architectures. Technical report, September 2002. URL http://webster.cs.uga.edu/~dkl/research/papers/wwc02.pdf. http://citeseer.ist.psu.edu/bentley02comparison.html More
@misc{ bentley02comparison,
author = "C. Bentley and S. Watterson and D. Lowenthal",
title = "A comparison of array bounds checking on superscalar and VLIW architectures",
text = "Chris Bentley, Scott A. Watterson, and David K. Lowenthal. A comparison
of array bounds checking on superscalar and VLIW architectures. Technical
report, September 2002. URL http://webster.cs.uga.edu/~dkl/research/papers/wwc02.pdf.",
year = "2002",
url = "citeseer.ist.psu.edu/bentley02comparison.html" }
Citations (may not include all citations):217 NASA Ames Research Center (context) - Bailey, Barton et al.
141 StackGuard: Automatic adaptive detection and prevention of b.. - Cowan, Pu et al. - 1998
110 Eliminating array bound checking through dependent types - Xi, Pfenning - 1998
72 A first step towards automated detection of buffer overrun v.. - Wagner, Foster et al. - 2000
50 Elimination of redundant array subscript range checks - Kolte, Wolfe - 1995
43 ABCD: eliminating array bounds checks on demand - Bodik, Gupta et al. - 2000
40 Optimizing array bound checks using flow analysis - Gupta - 1993
34 Backwards-compatible bounds checking for arrays and pointers.. - Jones, Kelly - 1997
33 Symbolic bounds analysis of pointers (context) - Rugina, Rinard
14 RAD: A Compile-Time solution to buffer overflow attacks - Chiueh, Hsu - 2001
11 Automatic loop transformations and parallelization for java - Artigas, Gupta et al.
2 Towards array bound check elimination in Java virtual machin.. - Xi, Xia - 1999
http://www.gnu.org/software/gcc/projects/bp/main.html)
http://destroy.net/machines/security/p49-14-alephone
Documents on the same site (http://webster.cs.uga.edu/~dkl/research/publications.html): More
Accurate Data Redistribution Cost Estimation in Software.. - Morris, III, Lowenthal (2001) (Correct)
Accurate Data Redistribution Cost Estimation in Software.. - Morris, III, Lowenthal (2001) (Correct)
HyFi: Architecture-Independent Parallelism on Networks of .. - Lowenthal, Subramanian (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC