Results 1  10
of
2,123
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
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
Theorem Proving with the Real Numbers
, 1996
"... This thesis discusses the use of the real numbers in theorem proving. Typically, theorem provers only support a few `discrete' datatypes such as the natural numbers. However the availability of the real numbers opens up many interesting and important application areas, such as the verification ..."
Abstract

Cited by 119 (13 self)
 Add to MetaCart
This thesis discusses the use of the real numbers in theorem proving. Typically, theorem provers only support a few `discrete' datatypes such as the natural numbers. However the availability of the real numbers opens up many interesting and important application areas, such as the verification
A Hybrid Tool for Linking HOL Theorem Proving with MDG Model Checking
, 2003
"... MDG Model Checking and submitted in partial fulfilment of the requirements for the degree of Master of Applied Science complies with the regulations of this University and meets the accepted standards with respect to originality and quality. Signed by the final examining committee: Dr. M. Reza Soley ..."
Abstract
 Add to MetaCart
MDG Model Checking and submitted in partial fulfilment of the requirements for the degree of Master of Applied Science complies with the regulations of this University and meets the accepted standards with respect to originality and quality. Signed by the final examining committee: Dr. M. Reza Soleymani Dr. Otmane Ait Mohamed Dr. Patrice Chalin Dr. Sofi`ene Tahar Approved by Chair of the ECE Department
Cryptographically Sound Theorem Proving
 In Proc. 19th IEEE CSFW
, 2006
"... We describe a faithful embedding of the DolevYao model of Backes, Pfitzmann, and Waidner (CCS 2003) in the theorem prover Isabelle/HOL. This model is cryptographically sound in the strong sense of reactive simulatability/UC, which essentially entails the preservation of arbitrary security proper ..."
Abstract

Cited by 33 (10 self)
 Add to MetaCart
We describe a faithful embedding of the DolevYao model of Backes, Pfitzmann, and Waidner (CCS 2003) in the theorem prover Isabelle/HOL. This model is cryptographically sound in the strong sense of reactive simulatability/UC, which essentially entails the preservation of arbitrary security
Formal Development of Processes by ModelChecking and Theorem Proving with FDR and HOLCSP
"... Abstract. Modelcheckers are highly specialized tools, geared towards one particular formal method. In contrast, theorem provers are flexible, versatile formal proof environments suitable for a wide variety of formal methods. Their strengths are complimentary, and hence their combination rewarding. ..."
Abstract
 Add to MetaCart
. This paper describes a case study where the embedding HOLCSP of the process algebra CSP into the theorem prover Isabelle and the modelchecker FDR are combined, arriving at a development environment combining the advantages of both FDR and HOLCSP. In this environment, we can use FDR to prove properties
Z and HOL
, 1994
"... A simple `shallow' semantic embedding of the Z notation into the HOL logic is described. The Z notation is based on set theory and first order predicate logic. The HOL theorem proving system supports higher order logic. A wellknown case study is used as a running example. The presentation is i ..."
Abstract
 Add to MetaCart
A simple `shallow' semantic embedding of the Z notation into the HOL logic is described. The Z notation is based on set theory and first order predicate logic. The HOL theorem proving system supports higher order logic. A wellknown case study is used as a running example. The presentation
Z and HOL
, 1994
"... A simple `shallow' semantic embedding of the Z notation into the HOL logic is described. The Z notation is based on set theory and first order predicate logic and is typically used for humanreadable formal specification. The HOL theorem proving system supports higher order logic and is used fo ..."
Abstract
 Add to MetaCart
A simple `shallow' semantic embedding of the Z notation into the HOL logic is described. The Z notation is based on set theory and first order predicate logic and is typically used for humanreadable formal specification. The HOL theorem proving system supports higher order logic and is used
Experience with embedding hardware description languages in HOL
 Theorem Provers in Circuit Design
, 1992
"... Abstract The semantics of hardware description languages can be represented in higher order logic. This provides a formal definition that is suitable for machine processing. Experiments are in progress at Cambridge to see whether this method can be the basis of practical tools based on the HOL theor ..."
Abstract

Cited by 40 (5 self)
 Add to MetaCart
theoremproving assistant. Three languages are being investigated: ELLA, Silage and VHDL. The approaches taken for these languages are compared and current progress on building semanticallybased theoremproving tools is discussed.
MachineAssisted TheoremProving for Software Engineering
 Technical Monograph PRG121, ISBN 0902928953, Oxford University Computing LaboratoryWolfson Building, Parks Road
, 1994
"... The thesis describes the production of a large prototype proof system for Z, and a tactic language in which the proof tactics used in a wide range of systems (including the system described here) can be discussed. The details of the construction of the toolusing the W logic for Z, and implemented ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
The thesis describes the production of a large prototype proof system for Z, and a tactic language in which the proof tactics used in a wide range of systems (including the system described here) can be discussed. The details of the construction of the toolusing the W logic for Z
Results 1  10
of
2,123