Foundational Proof Checkers with Small Witnesses (2003)
Cached
Download Links
- [www.cs.princeton.edu]
- [www.cs.princeton.edu]
- [www.eecs.umich.edu]
- DBLP
Other Repositories/Bibliography
by
Dinghao Wu
,
Andrew W. Appel
,
Aaron Stump
| Citations: | 21 - 6 self |
BibTeX
@MISC{Wu03foundationalproof,
author = {Dinghao Wu and Andrew W. Appel and Aaron Stump},
title = {Foundational Proof Checkers with Small Witnesses},
year = {2003}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Proof checkers for proof-carrying code (and similar systems) can su#er 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.
Citations
| 1016 | Proof-carrying code - Necula - 1997 |
| 634 | A framework for defining logics - Harper, Honsell, et al. - 1999 |
| 303 | Denotational Semantics: A Methodology for Language Development - SCHMIDT - 1986 |
| 122 | A semantic model of types and machine instructions for proof-carrying code - Appel, Felty - 2000 |
| 114 | An indexed model of recursive types for foundational proof-carrying code - Appel, McAllester - 2001 |
| 53 | P.: Efficient representation and validation of proofs - Necula, Lee - 1998 |
| 53 | S.P.: Oracle-based checking of untrusted software - Necula, Rahul |
| 40 | A provably sound TAL for back-end optimization - Chen, Wu, et al. - 2003 |
| 33 | Elf: A meta-language for deductive systems - Pfenning - 1995 |
| 28 | A stratified semantics of general references embeddable in higher-order logic - Ahmed, Appel, et al. - 2002 |
| 20 | How to believe a machine-checked proof - Pollack - 1998 |
| 4 | Pfenning and Carsten Schürmann. Twelf User’s Guide, Version 1.4, 2002. Available electronically at http://www.cs.cmu.edu/~twelf - Frank |
