Efficient representation and validation of proofs
Necula, G.C.
Lee, P.
Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA;
This paper appears in: Logic in Computer Science, 1998. Proceedings. Thirteenth Annual IEEE Symposium on
Publication Date: 21-24 Jun 1998
On page(s): 93-104
Meeting Date: 06/21/1998 - 06/24/1998
Location: Indianapolis, IN, USA
ISSN: 1043-6871
ISBN: 0-8186-8506-9
References Cited: 16
INSPEC Accession Number: 5992420
Digital Object Identifier: 10.1109/LICS.1998.705646
Current Version Published: 2002-08-06
Abstract
This paper presents a logical framework derived from the Edinburgh
Logical Framework (LF) 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 system, in which
proofs are used to support easy validation of properties of
safety-critical or untrusted code. Our framework, which we call LFi
, inherits from LF the capability to encode various logics in a
natural way. In addition, the LFi framework allows proof
representations without the high degree of redundancy that is
characteristic of LF representations. The missing parts of
LFi 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-Carrying Code system shows that the savings obtained
from using LFi instead of LF can make the difference between
practically useless proofs of several megabytes and manageable proofs of
tens of kilobytes
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
