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.
Foundational Proof-Carrying Code REF proposes to reduce the TCB to a proofchecker and the definition of the program semantics.
Foundational proof-carrying code
Foundations of Intrusion Tolerant Systems, 2003 [Organically Assured and Survivable Information Systems]
Foundations of Intrusion Tolerant Systems, 2003 [Organically Assured and Survivable Information Systems]
Computer Science