A type system for certified binaries

ACM Transactions on Programming Languages and Systems

Volumn 27, Issue 1, 2005, Pages 1-45

  Shao, Zhong ^a,d   Trifonov, Valery ^a,d   Saha, Bratin ^b   Papaspyrou, Nikolaos ^c  

^a YALE UNIVERSITY   (United States)

^b INTEL CORPORATION   (United States)

^c NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^d Yale University   (United States)

Author keywords

Certified code; Proof preserving compilation; Typed intermediate languages

Indexed keywords

CERTIFIED CODE; PROOF-PRESERVING COMPILATION; TYPE SYSTEMS; TYPED INTERMEDIATE LANGUAGES;

COMPUTATIONAL LINGUISTICS; DATA STRUCTURES; PROGRAM ASSEMBLERS; PROGRAM COMPILERS; QUERY LANGUAGES; THEOREM PROVING;

BINARY CODES;

EID: 13644274214     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/1053468.1053469     Document Type: Review

References (43)

1. ALTENKIRCH, T. 1993. Constructions, inductive types and strong normalization. Ph.D. dissertation. University of Edinburgh, UK.
2. APPEL, A. W. AND FELTEN, E. W. 2001. Models for security policies in proof-carrying code. Tech. Rep. CS-TR-636-01, Princeton Univ., Princeton, N.J.
3. APPEL, A. W. AND FELTY, A. P. 2000. A semantic model of types and machine instructions for proof-carrying code. In Proceedings of the 27th ACM Symposium on Principles of Programming Languages. ACM, New York, pp. 243-253.
4. BARENDREGT, H. P. 1991. Lambda calculi with types. In Handbook of Logic in Computer Science, vol. 2, S. Abramsky, D. Gabbay, and T. Maibaum, Eds. Oxford Univ. Press.
5. BARENDREGT, H. P. AND GEUVERS, H. 1999. Proof-assistants using dependent type systems. In Handbook of Automated Reasoning, A. Robinson and A. Voronkov, Eds. Elsevier, Amsterdam, The Netherlands.
6. BARTHE, G., HATCLIFF, J., AND SORENSEN, M. 1999. CPS translations and applications: The cube and beyond. Higher Order and Symbolic Computation 12, 2 (Sept.), 125-170.
7. BURSTALL, R. AND MCKINNA, J. 1991. Deliverables: An approach to program development in constructions. Tech. Rep. ECS-LFCS-91-133, Univ. of Edinburgh, UK.
8. CERVESATO, I. AND PFENNING, F. 1996. A linear logical framework. In Proceedings of the 11th IEEE Symposium on Logic in Computer Science. 264-275.
9. COLBY, C., LEE, P., NECULA, G. C., BLAU, F., PLESKO, M., AND CLINE, K. 2000. A certifying compiler for Java. In Proceedings of the 2000 ACM Conference on Programming Language Design and Implementation. ACM, New York, 95-107.
10. CONSTABLE, R. 1985. Constructive mathematics as a programming logic I: Some principles of theory. Ann. Disc. Math. 24.
11. COQUAND, T. AND HUET, G. 1988. The calculus of constructions. Inf. Comput. 76, 95-120.
12. CRARY, K. AND VANDERWAART, J. 2001. An expressive, scalable type theory for certified code. Tech. Rep. CMU-CS-01-113, School of Computer Science, Carnegie Mellon Univ., Pittsburgh, Pa.
13. CRARY, K., WALKER, D., AND MORRISETT, G. 1999. Typed memory management in a calculus of capabilities. In Proceedings of the 26th ACM Symposium on Principles of Programming Languages. ACM, New York, 262-275.
14. CRARY, K. AND WEIRICH, S. 1999. Flexible type analysis. In. Proceedings of the 1999 ACM SIGPLAN International Conference on Functional Programming. ACM, New York, 233-248.
15. CRARY, K. AND WEIRICH, S. 2000. Resource bound certification. In Proceedings of the 27th ACM Symposium on Principles of Programming Languages. ACM, New York, 184-198.
16. CRARY, K., WEIRICH, S., AND MORRISETT, G. 1998. Intensional polymorphism in type-erasure semantics. In Proceedings of the 1998 ACM SIGPLAN Int'l Conf. on Functional Prog. ACM, New York, 301-312.
17. GEUVERS, H. 1993. Logics and type systems. Ph.D. thesis, Catholic University of Nijmegen, The Netherlands.
18. GIRARD, J.-Y. 1972. Interprétation fonctionnelle et élimination des coupures dans l'arithmétique d'ordre supérieur. Ph.D. thesis, University of Paris VII.
19. HARPER, R. 2000. The practice of type theory. Talk presented at 2000 Alan J. Perlis Symposium, Yale University, New Haven, Conn.
20. HARPER, R. AND LILLIBRTOGE, M. 1993. Explicit polymorphism and CPS conversion. In Proceedings of the 20th ACM Symposium on Principles of Programming Languages. ACM, New York, 206-219.
21. HARPER, R. AND MORRISETT, G. 1995. Compiling polymorphism using intensional type analysis. In Proceedings of the 22nd ACM Symposium on Principles of Programming Languages. ACM, New York, 130-141.
22. HAYASHI, S. 1991. Singleton, union and intersection types for program extraction. In Proceedings of the International Conference on Theoretical Aspects of Computer Software, A. R. Meyer, Ed. 701-730.
23. HOWARD, W. A. 1980. The formulae-as-types notion of constructions. In To H.B.Curry: Essays on Computational Logic, Lambda Calculus and Formalism. Academic Press, Orlando, Fla.
24. HUET, G., PAULIN-MOHRING, C., ET AL. 2000. The Coq proof assistant reference manual. Part of the Coq system version 6.3.1.
25. MINAMIDE, Y., MORRISETT, G., AND HARPER, R. 1996. Typed closure conversion. In Proceedings of the 23rd ACM Symposium on Principles of Programming Languages. ACM, New York, 271-283.
26. MONNIER, S., SAHA, B., AND SHAO, Z. 2001. Principled scavenging. In Proceedings of the 2001 ACM Conference on Programming Language Design and Implementation. ACM, New York, 81-91.
27. MORRISETT, G., WALKER, D., CRARY, K., AND GLEW, N. 1998. From System F to typed assembly language. In Proceedings of the 25th ACM Symposium on Principles of Programming Languages. ACM, New York, 85-97.
28. NECULA, G. 1997. Proof-carrying code. In Proceedings of the 24th ACM Symposium on Principles of Programming Languages. ACM, New York, 106-119.
29. NECULA, G. 1998. Compiling with proofs. Ph.D. dissertation, School of Computer Science, Carnegie Mellon Univ, Pittsburgh, Pa.
30. NECULA, G. AND LEE, P. 1996. Safe kernel extensions without run-time checking. In Proceedings of the 2nd USENIX Symposium on Operating System Design and Implementation. USENIX Assoc., 229-243.
31. NECULA, G. AND LEE, P. 1998. The design and implementation of a certifying compiler. In Proceedings of the 1998 ACM Conference on Programming Language Design and Implementation. ACM, New York, 333-344.
32. NORDSTROM, B., PETERSSON, K., AND SMITH, J. 1990. Programming in Martin-Löf's type theory. Oxford University Press.
33. ω's programs from proofs in the Calculus of Constructions. In Proceedings of the 16th ACM Symposium on Principles of Programming Languages. ACM, New York, 89-104.
34. PAULIN-MOHRING, C. 1993. Inductive definitions in the system Coq-Rules and properties. In Proceedings of the TLCA, M. Bezem and J. Groote, Eds. Lecture Notes in Computer Science, vol. 664, Springer-Verlag, New York.
35. SHAO, Z. 1997. An overview of the FLINT/ML compiler. In Proceedings of the 1997 ACM SIGPLAN Workshop on Types in Compilation. ACM, New York.
36. SHAO, Z., LEAGUE, C., AND MONNIER, S. 1998. Implementing typed intermediate languages. In Proceedings of the 1998 ACM SIGPLAN International Conference on Functional Programming. ACM, New York, 313-323.
37. SHAO, Z., SAHA, B., TRIFONOV, V., AND PAPASPYROU, N. 2001. A type system for certified binaries. Tech. Rep. YALEU/DCS/TR-1211, Dept. of Computer Science, Yale University, New Haven, Conn.
38. SHELDON, M. A. AND GIFFORD, D. K. 1990. Static dependent types for first class modules. In Proceedings of the 1990 ACM Conference on LISP and Functional Programming. ACM, New York, 20-29.
39. TRIFONOV, V., SAHA, B., AND SHAO, Z. 2000. Fully reflexive intensional type analysis. In Proceedings of the 2000 ACM SIGPLAN International Conference on Functional Programming. ACM, New York, 82-93.
40. WALKER, D. 2000. A type system for expressive security policies. In Proceedings of the 27th ACM Symposium on Principles of Programming Languages. ACM, New York, 254-267.
41. WERNER, B. 1994. Une théorie des constructions inductives. Ph.D. dissertation. A L'Université Paris 7, Paris, France.
42. WRIGHT, A. K. AND FELLEISEN, M. 1994. A syntactic approach to type soundness. Inf. Comput. 115, 1, 38-94.
43. XI, H. AND PFENNING, F. 1999. Dependent types in practical programming. In Proceedings of the 26th ACM Symposium on Principles of Programming Languages. ACM, New York, 214-227.