Proof-Carrying Code

Proof-carrying code is a framework for the mechanical verification of safety properties of machine language programs, but the problem arises of quis custodiat ipsos 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.

• Type: Conference
• Year: 1997
• Where: POPL
• Authors: George C. Necula
• Keywords: Foundational Proof-carrying Code, POPL 1997, Programming Languages, Smallest Possible Runtime, Smallest Possible Set