Results 1 
3 of
3
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 29 (7 self)
 Add to MetaCart
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 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 indeed be very small. In our current system the TCB is less than 2,700 lines of code (an order of magnitude smaller even than other PCC systems) which adds to our confidence of its correctness.
Rulebased Deduction and Views in Mathematica
, 2003
"... We propose a rulebased system built on top of the capabilities of Mathematica to program nondeterministic and partially defined computations. The system is called #Log and has primitive operators for defining elementary rules and for computing with unions, compositions, reflexivetransitive cl ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We propose a rulebased system built on top of the capabilities of Mathematica to program nondeterministic and partially defined computations. The system is called #Log and has primitive operators for defining elementary rules and for computing with unions, compositions, reflexivetransitive closures, and normal forms of rule applications. Moreover, #Log can compute proof objects, which are internal representations of deduction derivations which respect a specification given by the user.
Deduction and Presentation in ρLog
, 2003
"... We describe the deductive and proof presentation capabilities of a rulebased system implemented in Mathematica. The system can compute proof objects, which are internal representations of deduction derivations which respect a specification given by the user. It can also visualize such deductions in ..."
Abstract
 Add to MetaCart
We describe the deductive and proof presentation capabilities of a rulebased system implemented in Mathematica. The system can compute proof objects, which are internal representations of deduction derivations which respect a specification given by the user. It can also visualize such deductions in human readable format, at various levels of detail. The presentation of the computed proof objects is done in a naturallanguage style which is derived and simplified for our needs from the proof presentation styles of Theorema.