Foundational proof checkers with small witnesses

  • Authors:
  • Dinghao Wu;Andrew W. Appel;Aaron Stump

  • Affiliations:
  • Princeton University, Princeton, NJ;Princeton University, Princeton, NJ;Washington University in St. Louis

  • Venue:
  • Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Proof checkers for proof-carrying code (and similar systems) can suffer from two problems: huge proof witnesses and untrustworthy proof rules. No previous design has addressed both of these problems simultaneously. We show the theory, design, and implementation of a proof-checker that permits small proof witnesses and machine-checkable proofs of the soundness of the system.