• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Abstract Eliminating Array Bound Checking Through Dependent Types*

Cached

  • Download as a PDF

Download Links

  • [www.cs.cmu.edu]
  • [www.lb.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu.]
  • [cs-www.bu.edu]
  • [www.cs.cmu.edu]
  • [www-2.cs.cmu.edu]
  • [www.cs.bu.edu]
  • [http.cs.berkeley.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Hongwei Xi , Frank Pfenning
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Xi_abstracteliminating,
    author = {Hongwei Xi and Frank Pfenning},
    title = {Abstract Eliminating Array Bound Checking Through Dependent Types*},
    year = {}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

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 the-ory and can still be performed efficiently in practice. We il-lustrate our approach through concrete examples and present the result of our preliminary experiments which support sup-port the feasibility and effectiveness of our approach. 1

Citations

1016 Proof-carrying code - NECULA - 1997
245 The design and implementation of a certifying compiler - Necula, Lee - 1998
235 Constructive mathematics and computer programming - Martin-Lof - 1982
196 Introduction to Algorithms - Corman, Leiserson, et al. - 1990
189 PVS: Combining specification, proof checking, and model checking - Owre, Rajan, et al. - 1996
151 Refinement types for ML - Freeman, Pfenning - 1991
87 NESL: A nested data-parallel language (version 3.1 - Blelloch - 1995
70 Optimizing array bound checks using flow analysis - Gupta - 1993
69 Eliminating false data dependences using the Omega test - Pugh, Wonnacott - 1992
66 A portable machine-independent global optimizer–design and measurements - Chow - 1984
58 K.: Implementation of an array bound checker - Suzuki, Ishihata - 1977
46 Optimization of range checking - Markstein, Cocke, et al. - 1982
44 The Coq proof assistant user’s guide. Rapport Techniques 154 - Dowek, Felty, et al. - 1993
36 G.: The COQ Proof Assistant User’s Guide - Dowek, Felty, et al. - 1993
33 On the SUP-INF method for proving Presburger formulas - Shostak - 1977
22 Shape checking of array programs - Jay, Sekanina - 1997
16 Experiences with constraint-based array dependence analysis - Pugh, Wonnacott - 1994
10 Design and Implementation of Practical Constraint Logic Programming Systems - Michaylov - 1992
7 union and intersection types for program extraction - Hayashi, Singleton - 1994
6 Practical refinement-type checking. Thesis Proposal - Davies - 1997
6 Some examples of DML programming. Available at http://www.cs.cmu.edu/~hwxi/DML/examples - Xi - 1997
1 Optimizac tion of range checking - Markstein, J, et al. - 1982
1 Constructive mathematics and computer programming - Martin-Liif - 1980
1 Design and Implementation of Pmctical Constraint Logic Programming Systems - Michaylov - 1992
1 Proof-carrying code - NecuIa - 1997
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University