Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

POPL
1997
ACM

favoriteEmaildiscussreport

90views Programming Languages» more POPL 1997»

Proof-Carrying Code

13 years 9 months ago

Proof-Carrying Code

Download www.cs.princeton.edu

Proof-carrying code is a framework for the mechanical veriﬁcation of safety properties of machine language programs, but the problem arises of quis custodiat ipsos custodes—who will verify the veriﬁer itself? Foundational proof-carrying code is veriﬁcation from the smallest possible set of axioms, using the simplest possible veriﬁer 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.

George C. Necula

Real-time Traffic

Foundational Proof-carrying Code | POPL 1997 | Programming Languages | Smallest Possible Runtime | Smallest Possible Set |

claim paper

Related Content

» Prototyping Proof Carrying Code

» Research on ProofCarrying Code for UntrustedCode Security

» A Syntactic Approach to Foundational ProofCarrying Code

» A Tutorial Example of the Semantic Approach to Foundational ProofCarrying Code

» Tutorial Examples of the Semantic Approach to Foundational ProofCarrying Code

» A Gradual Approach to a More Trustworthy Yet Scalable ProofCarrying Code

» By Reason and Authority A System for Authorization of ProofCarrying Code

» A Proof Carrying Code Framework for Inlined Reference Monitors in Java Bytecode

» Temporal Logic for ProofCarrying Code

Post Info
More Details (n/a)

Added	07 Aug 2010
Updated	07 Aug 2010
Type	Conference
Year	1997
Where	POPL
Authors	George C. Necula

Comments (0)