Results 1  10
of
663
Prototype Proof Checker
, 1995
"... This report is a brief user's guide to the prototype proof checker. The proof browser was developed to be part of the EVES system [1] and will not be described here. 2 EVES Project TR95548204 2 The Prototype Proof Checker ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This report is a brief user's guide to the prototype proof checker. The proof browser was developed to be part of the EVES system [1] and will not be described here. 2 EVES Project TR95548204 2 The Prototype Proof Checker
A Trustworthy Proof Checker
 IN ILIANO CERVESATO, EDITOR, WORKSHOP ON THE FOUNDATIONS OF COMPUTER SECURITY
, 2002
"... ProofCarrying Code (PCC) and other applications in computer security require machinecheckable proofs of properties of machinelanguage programs. The main advantage of the PCC approach is that the amount of code that must be explicitly trusted is very small: it consists of the logic in which predic ..."
Abstract

Cited by 34 (8 self)
 Add to MetaCart
predicates and proofs are expressed, the safety predicate, and the proof checker. We have built a minimal proof checker, and we explain its design principles, and the representation issues of the logic, safety predicate, and safety proofs. We show that the trusted computing base (TCB) in such a system can
On Extensibility of Proof Checkers
 in Dybjer, Nordstrom and Smith (eds), Types for Proofs and Programs: International Workshop TYPES'94, Bastad
, 1995
"... This paper is about mechanical checking of formal mathematics. Given some formal system, we want to construct derivations in that system, or check the correctness of putative derivations; our job is not to ascertain truth (that is the job of the designer of our formal system), but only proof. Howeve ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
by their direct proofs, so it might be accepted as a kind of indirect proof. In fact, even for very simple formal systems, such an indirect proof may compute to a very much bigger direct proof, and if we will only accept a fully expanded direct proof (in a mechanical proof checker for example), we
Foundational proof checkers with small witnesses
, 2003
"... Proof checkers for proofcarrying code (and similar) systems can suer from two problems: huge proof witnesses and untrustworthy proof rules. No previous design has addressed both of these problems simultaneously. We show the theory, design, and implementation of a proofchecker that permits small p ..."
Abstract

Cited by 26 (6 self)
 Add to MetaCart
Proof checkers for proofcarrying code (and similar) systems can suer from two problems: huge proof witnesses and untrustworthy proof rules. No previous design has addressed both of these problems simultaneously. We show the theory, design, and implementation of a proofchecker that permits small
The PVS Proof Checker: . . .
, 1993
"... ion and Verification System (Draft). Computer Science Laboratory, SRI International, Menlo Park, CA, February 1993. [SOR93] N. Shankar, S. Owre, and J. M. Rushby. PVS Tutorial. Computer Science Laboratory, SRI International, Menlo Park, CA, February 1993. Beta Release 58 REFERENCES rerun: Rerun a ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
a Proof or Partial Proof syntax: (rerun &optional proof ) effect: This step can be used to rerun a partial or completed proof from a previous attempt or from another branch of the proof. This step is largely used automatically by the system when it queries as to whether the proof should
An abstract proof checker
 In Proc. 2nd Intnl. Conference on Arti Intelligence and Mathematics, Fort
, 1992
"... Mathematicians rarely present proofs in all their detail; usually they give just an outline or abstraction of the proof. This paper describes our attempt to reproduce such activity within a computer proof system. 1 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Mathematicians rarely present proofs in all their detail; usually they give just an outline or abstraction of the proof. This paper describes our attempt to reproduce such activity within a computer proof system. 1
A Generic Proof Checker
, 2001
"... The use of formal methods in software development seeks to increase our confidence in the resultant system. Their use often requires tool support, so the integrity of a development using formal methods is dependent on the integrity of the toolset used. Specifically its integrity depends on the theo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
on the theorem prover, since in a typical formal development system the theorem prover is used to establish the validity of the proof obligations incurred by all the steps in the design and refinement process. In this
A Logiweb proof checker
"... 1.1 Electronic appendices........................ 3 1.2 Referenced Logiweb pages...................... 4 ..."
Abstract
 Add to MetaCart
1.1 Electronic appendices........................ 3 1.2 Referenced Logiweb pages...................... 4
Dedukti: a Universal Proof Checker
"... Context The success of formal methods both as tools of practical importance and as objects of intellectual curiosity, has spawned a bewildering variety of software systems to support them. While the field has developed to maturity in academia and has registered some important successes in the indust ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
universal proof language. This calculus, introduced by Cousineau and Dowek [5], is a dependent typed λcalculus where the definitional equality has been generalized to an arbitrary congruence generated by rewrite rules. Our opinion is that this formalism is well suited for encoding foreign logics and make
Results 1  10
of
663