Results 1 
3 of
3
Faster Proof Checking in the Edinburgh Logical Framework
 In 18th International Conference on Automated Deduction
, 2002
"... This paper describes optimizations for checking proofs represented in the Edinburgh Logical Framework (LF). The optimizations allow large proofs to be checked eciently which cannot feasibly be checked using the standard algorithm for LF. The crucial optimization is a form of result caching. To f ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
(Show Context)
This paper describes optimizations for checking proofs represented in the Edinburgh Logical Framework (LF). The optimizations allow large proofs to be checked eciently which cannot feasibly be checked using the standard algorithm for LF. The crucial optimization is a form of result caching. To formalize this optimization, a path calculus for LF is developed and shown equivalent to a standard calculus.
Producing Proofs from an Arithmetic Decision Procedure in Elliptical LF
 In 3rd International Workshop on Logical Frameworks and MetaLanguages
"... Software that can produce independently checkable evidence for the correctness of its output has received recent attention for use in certifying compilers and proofcarrying code. CVC (“a Cooperating Validity Checker) is a proofproducing validity checker for a decidable fragment of firstorder logic ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
Software that can produce independently checkable evidence for the correctness of its output has received recent attention for use in certifying compilers and proofcarrying code. CVC (“a Cooperating Validity Checker) is a proofproducing validity checker for a decidable fragment of firstorder logic enriched with background theories. This paper describes how proofs of valid formulas are produced from the decision procedure for linear real arithmetic implemented in CVC. It is shown how extensions to LF which support proof rules schematic in an arity (“elliptical ” rules) are very convenient for this purpose. 1