Proof-carrying code with untrusted proof rules

DOI10.1007/3-540-36532-X_18MaRDI QIDQ4418583zbMATH OpenFDO

Authors George C. Necula, Robert R. Schneck

Publication date 11 August 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2609/26090283.htm

Mathematics Subject Classification ID

Theory of software (68N99) Data encryption (aspects in computer science) (68P25)

Recommendations

• A gradual approach to a more trustworthy, yet scalable, proof-carrying code
• scientific article; zbMATH DE number 2110618
• Term Rewriting and Applications
• scientific article; zbMATH DE number 1330435
• Tutorial examples of the semantic approach to foundational proof-carrying code

Cited in

(9)

• A trustworthy proof checker
• Building certified libraries for PCC: dynamic storage allocation
• A scalable architecture for proof-carrying code
• Tutorial examples of the semantic approach to foundational proof-carrying code
• Building certified libraries for PCC: Dynamic storage allocation
• A gradual approach to a more trustworthy, yet scalable, proof-carrying code
• scientific article; zbMATH DE number 2110618 (Why is no real title available?)
• Oracle-based checking of untrusted software
• Typed Lambda Calculi and Applications

Describes a project that uses

Uses Software

• TAPS

This page was built for publication: Proof-carrying code with untrusted proof rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418583)