## Invited Paper: Foundational Proof-Carrying Code (at LICS 2001)

**Andrew W. Appel**

### Abstract

Proof-carrying code is a framework for the mechanical verification of safety properties of machine language programs, but the problem arises of quis custodiat ip-sos custodes-who will verify the verifier itself? Foundational proof-carrying code is verification from the smallest possible set of axioms, using the simplest possible verifier and the smallest possible runtime system. I will describe many of the mathematical and engineering problems to be solved in the construction of a foundational proof-carrying code system.

### BibTeX

@InProceedings{Appel-FoundationalProofCa, author = {Andrew W. Appel}, title = {Foundational Proof-Carrying Code}, booktitle = {Proceedings of the Sixteenth Annual IEEE Symposium on Logic in Computer Science (LICS 2001)}, year = {2001}, month = {June}, pages = {247--256}, location = {Boston, MA, USA}, note = {Invited Talk}, publisher = {IEEE Computer Society Press} }