Results 1  10
of
3,824
Reasoning with inductively defined relations in the HOL theorem prover
, 1992
"... Abstract: Inductively defined relations are among the basic mathematical tools of computer science. Examples include evaluation and computation relations in structural operational semantics, labelled transition relations in process algebra semantics, inductivelydefined typing judgements, and proof ..."
Abstract

Cited by 49 (0 self)
 Add to MetaCart
systems in general. This paper describes a set of HOL theoremproving tools for reasoning about such inductively defined relations. We also describe a suite of worked examples using these tools. First printed: August 1992
A Proof Development System for the HOL Theorem Prover
, 1993
"... . In this paper, we present a system to improve the interaction between HOL and the user when doing proofs. 1 Introduction Learning how to use any theorem prover requires a rather important investment. The user has not only to assimilate the specificities of the prover in terms of the logic and the ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
. In this paper, we present a system to improve the interaction between HOL and the user when doing proofs. 1 Introduction Learning how to use any theorem prover requires a rather important investment. The user has not only to assimilate the specificities of the prover in terms of the logic
Reasoning with Inductively Defined Relations in the HOL Theorem Prover
, 1992
"... : Inductively defined relations are among the basic mathematical tools of computer science. Examples include evaluation and computation relations in structural operational semantics, labelled transition relations in process algebra semantics, inductivelydefined typing judgements, and proof systems ..."
Abstract
 Add to MetaCart
in general. This paper describes a set of HOL theoremproving tools for reasoning about such inductively defined relations. We also describe a suite of worked examples using these tools. First printed: August 1992 Parts of this report have previously appeared as: T. Melham, `A Package for Inductive
HOL Theorem Prover Case Study: Verifying Probabilistic Programs
"... The focus of this paper is the question: “How suited is the HOL theorem prover to the verification of probabilistic programs? ” To answer this, we give a brief introduction to our model of probabilistic programs in HOL, and then compare this approach to other formal tools that have been used to veri ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The focus of this paper is the question: “How suited is the HOL theorem prover to the verification of probabilistic programs? ” To answer this, we give a brief introduction to our model of probabilistic programs in HOL, and then compare this approach to other formal tools that have been used
H.: Efficiently checking propositional refutations in hol theorem provers
 Journal of Applied Logic
, 2009
"... Abstract This paper describes the integration of zChaff and MiniSat, currently two leading SAT solvers, with Higher Order Logic (HOL) theorem provers. Both SAT solvers generate resolutionstyle proofs for (instances of) propositional tautologies. These proofs are verified by the theorem provers. Th ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
Abstract This paper describes the integration of zChaff and MiniSat, currently two leading SAT solvers, with Higher Order Logic (HOL) theorem provers. Both SAT solvers generate resolutionstyle proofs for (instances of) propositional tautologies. These proofs are verified by the theorem provers
Multiway Decision Graphs Reduction Approach based on the HOL Theorem Prover
"... Multiway Decision Graphs (MDGs) subsume Binary Decision Diagrams (BDDs) by representing formulae which are suitable for firstorder model checking able to handle large datapath circuits. In this paper, we propose a reduction approach to improve MDGs model checking. We use a reduction platform based ..."
Abstract
 Add to MetaCart
on combining MDGs with the rewriting engine of the HOL theorem prover. The idea is to prune the transition relation of the design using preproved theorems and lemmas from the specification given at system level. Then, the actual proof of temporal MDG formulae will be achieved by the MDGs model checker.
Formal Verificaction of the ADSP2100 Processor Using the HOL Theorem Prover
, 2002
"... In this technical report, we present the application of formal verification to digital signal processors of the family ADSP2100 using the HOL (Higher Order Logic) theorem prover. To solve the problem of complexity related to the big number of parameters of the processor, we used a structured method ..."
Abstract
 Add to MetaCart
In this technical report, we present the application of formal verification to digital signal processors of the family ADSP2100 using the HOL (Higher Order Logic) theorem prover. To solve the problem of complexity related to the big number of parameters of the processor, we used a structured
A High Level Reachability Analysis using Multiway Decision Graph in the HOL Theorem Prover
"... Abstract. In this paper, we provide all the necessary infrastructure to define a high level states exploration approach within the HOL theorem prover. While related work has tackled the same problem by representing primitive BDD operations as inference rules added to the core of the theorem prover, ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. In this paper, we provide all the necessary infrastructure to define a high level states exploration approach within the HOL theorem prover. While related work has tackled the same problem by representing primitive BDD operations as inference rules added to the core of the theorem prover
A Case Study Using Timed Transition Diagrams and the HOL Theorem Prover for the Formal Development of a Production Cell
, 1994
"... This report illustrates the use of hierarchical timed transition diagrams (HTTDs) and the HOL theorem prover for the formal specification and verification of a production cell. The specification generalizes the geometries and component speeds of the production cell, realtime behaviour is modelled, ..."
Abstract
 Add to MetaCart
This report illustrates the use of hierarchical timed transition diagrams (HTTDs) and the HOL theorem prover for the formal specification and verification of a production cell. The specification generalizes the geometries and component speeds of the production cell, realtime behaviour is modelled
Extending the HOL theorem prover with a Computer Algebra System to Reason about the Reals
 Higher Order Logic Theorem Proving and its Applications (HUG `93
, 1993
"... In this paper we describe an environment for reasoning about the reals which combines the rigour of a theorem prover with the power of a computer algebra system. 1 Introduction Computer theorem provers are a topic of research interest in their own right. However much of their popularity stems from ..."
Abstract

Cited by 34 (4 self)
 Add to MetaCart
In this paper we describe an environment for reasoning about the reals which combines the rigour of a theorem prover with the power of a computer algebra system. 1 Introduction Computer theorem provers are a topic of research interest in their own right. However much of their popularity stems from
Results 1  10
of
3,824