Foundational proof checkers with small witnesses

Dinghao Wu, Andrew W. Appel, Aaron Stump
2003 Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming - PPDP '03  
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.
doi:10.1145/888251.888276 dblp:conf/ppdp/WuAS03 fatcat:by4aj4yjlvg5tg34g3ssccwawy