Efficient Representation and Validation of Proofs

Efficient Representation and Validation of Proofs (1998)

Cached

Download Links

[www.cs.cmu.edu]

Other Repositories/Bibliography

DBLP

by George C. Necula , Peter Lee

Citations:

53 - 7 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Efficient Representation and Validation of Proofs	user correction - Legacy Corrections
AUTHOR NAME	George C. Necula	SVM HeaderParse 0.1
AUTHOR AFFIL	School of Computer Science; Carnegie Mellon University	SVM HeaderParse 0.2
AUTHOR ADDR	Pittsburgh, Pennsylvania 15213--3891	SVM HeaderParse 0.1
AUTHOR NAME	Peter Lee	SVM HeaderParse 0.1
AUTHOR AFFIL	School of Computer Science; Carnegie Mellon University	SVM HeaderParse 0.2
AUTHOR ADDR	Pittsburgh, Pennsylvania 15213--3891	SVM HeaderParse 0.1
ABSTRACT	This paper presents a logical framework derived from the Edinburgh Logical Framework (LF) [5] that can be used to obtain compact representations of proofs and efficient proof checkers. These are essential ingredients of any application that manipulates proofs as first-class objects, such as a Proof-Carrying Code [11] system, in which proofs are used to allow the easy validation of properties of safety-critical or untrusted code. Our framework, which we call LF i , inherits from LF the capability to encode various logics in a natural way. In addition, the LF i framework allows proof representations without the high degree of redundancy that is characteristic of LF representations. The missing parts of LF i proof representations can be reconstructed during proof checking by an efficient reconstruction algorithm. We also describe an algorithm that can be used to strip the unnecessary parts of an LF representation of a proof. The experimental data that we gathered in the context of a Proof...	user correction - Legacy Corrections
YEAR	1998	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	93--104	INFERENCE
CITATIONS	18 found	ParsCit 1.0