Results 1  10
of
8,668
Formal Proof
, 2008
"... There remains but one course for the recovery of a sound and healthy condition—namely, that the entire work of the understanding be commenced afresh, and the mind itself be from the very outset not left to take its own course, but guided at every step; and the business be done as if by machinery. ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
There remains but one course for the recovery of a sound and healthy condition—namely, that the entire work of the understanding be commenced afresh, and the mind itself be from the very outset not left to take its own course, but guided at every step; and the business be done as if by machinery.
Formal Proof Sketches
 In Proceedings of TYPES’03, volume 3085 of LNCS
, 2002
"... We de ne the notion of formal proof sketch for the mathematical language Mizar. We show by examples that formal proof sketches are very close to informal mathematical proofs. We discuss some ways in which formal proof sketches might be used to improve mathematical proof assistants. 1 ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
We de ne the notion of formal proof sketch for the mathematical language Mizar. We show by examples that formal proof sketches are very close to informal mathematical proofs. We discuss some ways in which formal proof sketches might be used to improve mathematical proof assistants. 1
Autarkic Computations in Formal Proofs
 J. Autom. Reasoning
, 1997
"... Formal proofs in mathematics and computer science are being studied because these objects can be verified by a very simple computer program. An important open problem is whether these formal proofs can be generated with an effort not much greater than writing a mathematical paper in, say, L A ..."
Abstract

Cited by 28 (1 self)
 Add to MetaCart
Formal proofs in mathematics and computer science are being studied because these objects can be verified by a very simple computer program. An important open problem is whether these formal proofs can be generated with an effort not much greater than writing a mathematical paper in, say, L A
Mining the archive of formal proofs
 Intelligent Computer Mathematics  International Conference, CICM 2015
"... Abstract. The Archive of Formal Proofs is a vast collection of computerchecked proofs developed using the proof assistant Isabelle. We perform an indepth analysis of the archive, looking at various properties of the proof developments, including size, dependencies, and proof style. This gives som ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. The Archive of Formal Proofs is a vast collection of computerchecked proofs developed using the proof assistant Isabelle. We perform an indepth analysis of the archive, looking at various properties of the proof developments, including size, dependencies, and proof style. This gives
The Formal Proof Sketch Challenge
"... A formal proof sketch is a way to present a formal proof in a style that is close to an informal proof, but which also is a skeleton of the full formal proof (this makes it easy to relate the presentation to the detailed formalization.) Recently to us every informal proof has started to feel like a ..."
Abstract
 Add to MetaCart
A formal proof sketch is a way to present a formal proof in a style that is close to an informal proof, but which also is a skeleton of the full formal proof (this makes it easy to relate the presentation to the detailed formalization.) Recently to us every informal proof has started to feel like a
Formal proof—theory and practice
 Notices AMS
, 2008
"... Aformal proof is a proof written in a precise artificial language that admits only a fixed repertoire of stylized steps. This formal language is usually designed so that there is a purely mechanical process by which the correctness of a proof in the language can be verified. Nowadays, there are nume ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
Aformal proof is a proof written in a precise artificial language that admits only a fixed repertoire of stylized steps. This formal language is usually designed so that there is a purely mechanical process by which the correctness of a proof in the language can be verified. Nowadays
Formal Proofs for the Security of Signcryption
 In PKC ’02
, 2002
"... Signcryption is a public key or asymmetric cryptographic method that provides simultaneously both message confidentiality and unforgeability at a lower computational and communication overhead. ..."
Abstract

Cited by 85 (3 self)
 Add to MetaCart
Signcryption is a public key or asymmetric cryptographic method that provides simultaneously both message confidentiality and unforgeability at a lower computational and communication overhead.
FP and Formal Proofs
"... if op is commutative, then (foldright op id lst) = (foldleft op id lst) for all op, id, lst. is it true? how would one prove it? 2 FP and Formal Proofs Let’s try something simple and familiar first. (define len (lambda (lst) (if (null? lst)) ..."
Abstract
 Add to MetaCart
if op is commutative, then (foldright op id lst) = (foldleft op id lst) for all op, id, lst. is it true? how would one prove it? 2 FP and Formal Proofs Let’s try something simple and familiar first. (define len (lambda (lst) (if (null? lst))
An Exploration Tool for Formal Proofs
"... Proof assistants aid the user in proving mathematical theorems by taking care of lowlevel reasoning details. Their user interfaces often present proof information as text, which becomes increasingly difficult to comprehend as it grows in size. Panoptes is a software tool that enables users to explo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
to explore graphical representations of the formal proofs produced by the imps Interactive Mathematical Proof System. Panoptes automatically displays an imps deduction graph as a visual graph that can be easily manipulated by the user. Its facilities include target zooming, floating information boxes, node
Formal Proof  Getting Started
, 2008
"... Today highly nontrivial mathematics is routinely being encoded in the computer, ensuring a reliability that is orders of a magnitude larger than if one had just used human minds. Such an encoding is called a formalization, and a program that checks such a formalization for correctness is called a pr ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
to make sure that this is not the case. Or maybe you just want to bring your proof into the most pure and complete form possible. We will explain in this article how to go about this. Although formalization has become a routine activity, it still is labor intensive. Using current technology, a
Results 1  10
of
8,668