An Indexed Model of Recursive Types for Foundational Proof-Carrying Code (2000)
by
Andrew W. Appel
,
David Mcallester
| Venue: | ACM Transactions on Programming Languages and Systems |
| Citations: | 114 - 13 self |
BibTeX
@ARTICLE{Appel00anindexed,
author = {Andrew W. Appel and David Mcallester},
title = {An Indexed Model of Recursive Types for Foundational Proof-Carrying Code},
journal = {ACM Transactions on Programming Languages and Systems},
year = {2000},
volume = {23},
pages = {2001}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The proofs of "traditional" proof carrying code (PCC) are type-specialized in the sense that they require axioms about a specific type system. In contrast, the proofs of foundational PCC explicitly define all required types and explicitly prove all the required properties of those types assuming only a fixed foundation of mathematics such as higher-order logic. Foundational PCC is both more flexible and more secure than type-specialized PCC.
