Abstract

Proof-carrying code is a framework for proving the safety of machine-language programs with a machinecheckable proof. Such proofs have previously defined type-checking rules as part of the logic. We show a universal type framework for proof-carrying code that will allow a code producer to choose a programming language, prove the type rules for that language as lemmas in higher-order logic, then use those lemmas to prove the safety of a particular program. We show how to handle traversal, allocation, and initialization of values in a wide variety of types, including functions, records, unions, existentials, and covariant recursive types. 1

Citations

1016	Proof-carrying code - Necula - 1997
627	Efficient software-based fault isolation - Wahbe, Lucco, et al. - 1993
557	From system F to typed assembly language - Morrisett, Walker, et al. - 1999
339	Towards a theory of type structure - Reynolds
281	System description: Twelf - a meta-logical framework for deductive systems - Pfenning, Schürmann - 1999
267	G.D.: Abstract types have existential types - Mitchell, Plotkin - 1988
221	Interprétation fonctionnelle et élimination des coupures de l’arithmétique d’ordre supérieur. Thèse de Doctorat d’ État, Université de Paris VII - Girard - 1972
190	ORBIT: An optimizing compiler for Scheme - KRANZ, KELSEY, et al. - 1986
172	Logic programming in the LF logical framework - Pfenning - 1991
146	Typed closure conversion - Minamide, Morrisett, et al. - 1996
136	Stack-based typed assembly language - Morrisett, Crary, et al. - 2002
128	Compiling with Proofs - Necula - 1998
33	Typed cross-module compilation - Shao - 1998
31	Representing java classes in a typed intermediate language - League, Shao, et al. - 1999
15	An ideal model for recursive polymophic types - MacQueen, Plotkin, et al. - 1986
2	Effective models of polymorphism, subtyping and recursion - Mitchell, Viswanathan - 1996