Efficient Representation and Validation of Logical Proofs (1997)
Cached
Download Links
- [reports-archive.adm.cs.cmu.edu]
- [www.cs.berkeley.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 44 - 6 self |
BibTeX
@MISC{Necula97efficientrepresentation,
author = {George C. Necula and Peter Lee},
title = {Efficient Representation and Validation of Logical Proofs},
year = {1997}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This report describes a framework for representing and validating formal proofs in various axiomatic systems. The framework is based on the Edinburgh Logical Framework (LF) but is optimized for minimizing the size of proofs and the complexity of proof validation, by removing redundant representation components. Several variants of representation algorithms are presented with the resulting representations being a factor of 15 smaller than similar LF representations. The validation algorithm is a reconstruction algorithm that runs about 7 times faster than LF typechecking. We present a full proof of correctness of the reconstruction algorithm and hints for the efficient implementation using explicit substitutions. We conclude with a quantitative analysis of the algorithms. This research was sponsored in part by the Advanced Research Projects Agency CSTO under the title "The Fox Project: Advanced Languages for Systems Software," ARPA Order No. C533, issued by ESC/ENS under Contract No. F1...
