Results 1 
5 of
5
A Comparison of PVS and Isabelle/HOL
 Theorem Proving in Higher Order Logics, number 1479 in Lect. Notes Comp. Sci
, 1998
"... . There is an overwhelming number of different proof tools available and it is hard to find the right one for a particular application. Manuals usually concentrate on the strong points of a proof tool, but to make a good choice, one should also know (1) which are the weak points and (2) whether the ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
(Show Context)
. There is an overwhelming number of different proof tools available and it is hard to find the right one for a particular application. Manuals usually concentrate on the strong points of a proof tool, but to make a good choice, one should also know (1) which are the weak points and (2) whether the proof tool is suited for the application in hand. This paper gives an initial impetus to a consumers' report on proof tools. The powerful higherorder logic proof tools PVS and Isabelle are compared with respect to several aspects: logic, specification language, prover, soundness, proof manager, user interface (and more). The paper concludes with a list of criteria for judging proof tools, it is applied to both PVS and Isabelle. 1 Introduction There is an overwhelming number of different proof tools available (e.g. in the Database of Existing Mechanised Reasoning Systems one can find references to over 60 proof tools [Dat]). All have particular applications that they are especially suited ...
Importing HOL Light into Coq
 In ITP
, 2010
"... Abstract. We present a new scheme to translate mathematical developments from HOL Light to Coq, where they can be reused and rechecked. By relying on a carefully chosen embedding of HigherOrder Logic into Type Theory, we try to avoid some pitfalls of interoperation between proof systems. In parti ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We present a new scheme to translate mathematical developments from HOL Light to Coq, where they can be reused and rechecked. By relying on a carefully chosen embedding of HigherOrder Logic into Type Theory, we try to avoid some pitfalls of interoperation between proof systems. In particular, our translation keeps the mathematical statements intelligible. This translation has been implemented and allows the importation of the HOL Light basic library into Coq. 1
A proof of the S m n theorem in Coq
, 1997
"... This report describes the implementation of a mechanisation of the theory of computation in the Coq proof assistant which leads to a proof of the S m n theorem. This mechanisation is based on a model of computation similar to the partial recursive function model and includes the denition of a comput ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
This report describes the implementation of a mechanisation of the theory of computation in the Coq proof assistant which leads to a proof of the S m n theorem. This mechanisation is based on a model of computation similar to the partial recursive function model and includes the denition of a computable function, proofs of the computability of a number of functions and the denition of an eective coding from the set of partial recursive functions to natural numbers. This work forms part of a comparative study of the HOL and Coq proof assistants.
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
 Add to MetaCart
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 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
Formal Verification of a Ubiquitous Hardware Component
, 2004
"... The paper begins by discussing various approaches to hardware specification and verification. The main emphasis is on using mechanical verification tools to assist the verification process. The case study is the verification of a sevensegment LED display decoder circuit design, in which two popular ..."
Abstract
 Add to MetaCart
(Show Context)
The paper begins by discussing various approaches to hardware specification and verification. The main emphasis is on using mechanical verification tools to assist the verification process. The case study is the verification of a sevensegment LED display decoder circuit design, in which two popular verification tools, HOL and PVS, are compared and evaluated.