DMCA
Eliminating Array Bound Checking Through Dependent Types (1998)
Cached
Download Links
- [www.lb.cs.cmu.edu]
- [www.ececs.uc.edu]
- CiteULike
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation |
| Citations: | 186 - 24 self |
BibTeX
@INPROCEEDINGS{Xi98eliminatingarray,
author = {Hongwei Xi and Frank Pfennig},
title = {Eliminating Array Bound Checking Through Dependent Types},
booktitle = {In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation},
year = {1998},
pages = {249--257},
publisher = {ACM Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This enables the programmer to capture more invariants through types while type-checking remains decidable in theory and can still be performed efficiently in practice. We illustrate our approach through concrete examples and present the result of our preliminary experiments which support support the feasibility and effectiveness of our approach. 1 Introduction The absence of run-time array bound checks is an infamous source of fatal errors for programs in languages such as C. Nonetheless, compilers offer the option to omit array bound checks, since they can turn out to be expensive in practice (Chow 1983; Gupta 1994). In statically typed languages such as ML, one would like to provide strong guarantees about the safety of all operations, so array bound checks cannot be omitted in general. The same is true for Ja...
