Eliminating array bound checking through dependent types
- 1 May 1998
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 33 (5), 249-257
- https://doi.org/10.1145/277652.277732
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- The design and implementation of a certifying compilerPublished by Association for Computing Machinery (ACM) ,1998
- Proof-carrying codePublished by Association for Computing Machinery (ACM) ,1997
- PVS: Combining specification, proof checking, and model checkingLecture Notes in Computer Science, 1996
- Optimizing array bound checks using flow analysisACM Letters on Programming Languages and Systems, 1993
- Eliminating false data dependences using the Omega testPublished by Association for Computing Machinery (ACM) ,1992
- Refinement types for MLPublished by Association for Computing Machinery (ACM) ,1991
- Optimization of range checkingPublished by Association for Computing Machinery (ACM) ,1982
- On the SUP-INF Method for Proving Presburger FormulasJournal of the ACM, 1977
- Implementation of an array bound checkerPublished by Association for Computing Machinery (ACM) ,1977