Proof-Carrying Code with Untrusted Proof Rules

  • George C. Necula
  • Robert R. Schneck
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2609)

Abstract

Proof-carrying code (PCC) allows a code producer to associate to a program a machine-checkable proof of its safety. In traditional implementations of PCC the producer negotiates beforehand, and in an unspecified way, with the consumer the permission to prove safety in whatever high-level way it chooses. In practice this has meant that highlevel rules for type safety have been hard-wired into the system as part of the trusted code base. This limits the security and flexibility of the PCC system.

In this paper, we exhibit an approach to removing the safety proof rules from the trusted base, with a technique by which the producer can convince the consumer that a given set of high-level safety rules enforce a strong global invariant that entails the trusted low-level memory safety policy.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AF00.]
    Andrew W. Appel and Amy P. Felty. A semantic model of types and machine instructions for proof-carrying code. In POPL’ 00: The 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 243–253. ACM Press, January 2000.Google Scholar
  2. [App01.]
    Andrew W. Appel. Foundational proof-carrying code. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, pages 247–258, June 2001.Google Scholar
  3. [CLN+00.]
    Christopher Colby, Peter Lee, George C. Necula, Fred Blau, Mark Plesko, and Kenneth Cline. A certifying compiler for Java. ACM SIGPLAN Notices, 35(5):95–107, May 2000.CrossRefGoogle Scholar
  4. [Coq02.]
    Coq Development Team. The Coq proof assistant reference manual, version 7.3. May 2002.Google Scholar
  5. [HST+02.]
    Nadeem A. Hamid, Zhong Shao, Valery Trifonov, Stefan Monnier, and Zhaozhong Ni. A syntactic approach to foundational proof-carrying code. In Proceedings of the Seventeenth Annual IEEE Symposium on Logic in Computer Science, pages 89–100, Copenhagen, Denmark, July 2002.Google Scholar
  6. [Nec97.]
    George C. Necula. Proof-carrying code. In The 24th Annual ACM Symposium on Principles of Programming Languages, pages 106–119. ACM, January 1997.Google Scholar
  7. [Nec98.]
    George C. Necula. Compiling with Proofs. PhD thesis, Carnegie Mellon University, September 1998. Also available as CMU-CS-98-154.Google Scholar
  8. [SN02.]
    Robert R. Schneck and George C. Necula. A gradual approach to a more trustworthy, yet scalable, proof-carrying code. In Proceedings of the 18th International Conference on Automated Deduction (CADE-18), pages 47–62, Copenhagen, Denmark, July 2002. Springer-Verlag.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • George C. Necula
    • 1
  • Robert R. Schneck
    • 2
  1. 1.Department of Electrical Engineering and Computer SciencesUniversity of CaliforniaBerkeley
  2. 2.Group in Logic and the Methodology of ScienceUniversity of CaliforniaBerkeley

Personalised recommendations