Eliminating Array Bound Checking Through Dependent Types

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 33, Issue 5, 1998, Pages 249-256

  Xi, Hongwei ^a   Pfenning, Frank ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347507512     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/277652.277732     Document Type: Article

References (24)

1. Blelloch, G. E. (1993, April). NESL: A nested data-parallel language (version 2.6). Technical Report CMU-CS-93-129, School of Computer Science, Carnegie Mellon University.
2. Chow, F. (1983). A portable machine-independent global optimizer - design and measurements. Ph. D. dissertation, Stanford University. Technical Report 83-254.
3. Constable, R. L. et al. (1986). Implementing Mathematics with the Nuprl Proof Development System. Englewood Cliffs, New Jersey: Prentice-Hall.
4. Corman, T. H., C. E. Leiserson, and R. L. Rivest (1989). Introduction to Algorithms. Cambridge, Massachusetts: The MIT Press.
5. Davies, R. (1997, November). Practical refinement-type checking. Thesis Proposal.
6. Dowek, G., A. Felty, H. Herbelin, G. Huet, C. Murthy, C. Parent, C. Paulin-Mohring, and B. Werner (1993). The Coq proof assistant user's guide. Rapport Techniques 154, INRIA, Rocquencourt, France. Version 5.8.
7. Freeman, T. (1994, March). Refinement Types for ML. Ph. D. dissertation, Carnegie Mellon University. Available as Technical Report CMU-CS-94-110.
8. Freeman, T. and F. Pfenning (1991). Refinement types for ML. In ACM SIGPLAN '91 Conference on Programming Language Design and Implementation, Toronto, Ontario, pp. 268-277.
9. Gupta, R. (1994). Optimizing array bound checks using flow analysis. ACM Letters on Programming Languages and Systems 2(1-4), 135-150.
10. Hayashi, S. (1991). Singleton, union and intersection types for program extraction. In A. R. Meyer (Ed.), Proceedings of the International Conference on Theoretical Aspects of Computer Software, pp. 701-730.
11. Jay, C. and M. Sekanina (1996). Shape checking of array programs. Technical Report 96.09, University of Technology, Sydney, Australia.
12. Markstein, V., C. J. and P. Markstein (1982). Optimization of range checking. In SIGPLAN '82 Symposium on Compiler Construction, pp. 114-119.
13. Martin-Löf, P. (1980). Constructive mathematics and computer programming. In Logic, Methodology and Philosophy of Science VI, pp. 153-175. North-Holland.
14. Michaylov, S. (1992, August). Design and Implementation of Practical Constraint Logic Programming Systems. Ph D. thesis, Carnegie Mellon University. Available as Technical Report CMU-CS-92-168.
15. Necula, G. (1997). Proof-carrying code. In Conference Record of 24th Annual ACM Symposium on Principles of Programming Languages, pp. 106-119. ACM press.
16. Necula, G. and P. Lee (1998, June). The design and implementation of a certifying compiler. In ACM SIGPLAN '98 Conference on Programming Language Design and Implementation. ACM press.
17. Owre, S., S. Rajan, J. Rushby, N. Shankar, and M. Srivas (1996, July/August). PVS: Combining specification, proof checking, and model checking. In R. Alur and T. A. Henzinger (Eds.), Computer-Aided Verification, CAV '96, Volume 1102 of LNCS, New Brunswick, NJ, pp. 411-414. Springer-Verlag.
18. Pugh, W. and D. Wonnacott (1992). Eliminating false data dependences using the Omega test. In ACM SIGPLAN '92 Conference on Programming Language Design and Implementation, pp. 140-151. ACM Press.
19. Pugh, W. and D. Wonnacott (1994, November). Experience with constraint-based array dependence analysis. Technical Report CS-TR-3371, University of Maryland.
20. Shostak, R. E. (1977, October). On the SUP-INF method for proving Presburger formulas. Journal of the ACM 24(4), 529-543.
21. Sun Microsystems (1995). The Java language specification. Available as ftp://ftp.javasoft.com/docs/javaspec.ps.zip.
22. Susuki, N. and K. Ishihata (1977). Implementation of array bound checker. In 4th ACM Symposium on Priciples of Programming Languages, pp. 132-143.
23. Xi, H. (1997, November). Some examples of DML programming. Available at http://www.cs.emu.edu/~hwxi/DML/examples/.
24. Xi, H. (1998). Dependent Types in Practical Programming. Ph. D. thesis, Carnegie Mellon University. Forthcoming.