Accession Number : ADA332310
Title : Efficient Representation and Validation of Logical Proofs
Corporate Author : CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE
Personal Author(s) : Necula, George C. ; Lee, Peter
PDF Url : ADA332310
Report Date : OCT 1997
Pagination or Media Count : 74
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.
Descriptors : *COMPUTER LOGIC, *COMPUTER PROGRAM VERIFICATION, ALGORITHMS, OPTIMIZATION, EFFICIENCY.
Subject Categories : Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE