Mike J. C. Gordon and Tom F. Melham. Introduction to HOL. Cambridge University Press, Cambridge, United Kingdom, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A Case Study of a Formalized Security Architecture - Brucker, Wolff (2003) (Correct)
....CombinedSec ImplArchSec CVSServer FileSystem Refinement SysConsistency Fig. 2. The Specification Organization i.e. new object logics can be introduced by specifying their syntax and inference rules. Isabelle HOL is an instance of Isabelle with Church s higher order logic (HOL) [8], a classical logic with equality. Isabelle HOL Z is a conservative embedding of Z into HOL (which is semantically isomorphic to Z since Z is based on typed set theory and HOL on typed # calculus. As a result, Isabelle HOL Z combines up to date theorem prover technology with a widespread ....
Gordon, M. J. C. and T. F. Melham, "Introduction to HOL," Cambridge University Press, 1993, 472 pp.
Combining Formal Refinement and Model Checking for Real-Time.. - Krupp, Mueller (2003) (Correct)
....= loader.wait) AX(loader.state = loader.load) 4. Refinement with B The Boyer Moore Theorem Prover (BMTP) and HOL are the two classical approaches to theorem proving in the domain of electronic design automation. BMTP and HOL are both interactive proof assistant for high order logic [5, 10]. In theorem proving, a proof has to be interactively found for a given set of axioms and inference rules. Though several practical studies have been undertaken, interactive theorem proving has not received wider industrial acceptance so far. Alternatively, B specification and its theorem proving ....
M.J.Gordon. Introduction to HOL. Cambridge University Press, Cambridge, 1993.
Inductive Verification of Cryptographic Protocols - Bella (2000) (4 citations) (Correct)
....tend to sacrifice the intuitive nature of the logic itself. We believe that confidentiality has never received an adequate treatment in this setting. Proofs by belief logics are typically short and carried out by hand, but certain logics have been implemented [29, 30] using the theorem prover HOL [45]. 2.1.2 State Enumeration via Model Checking The well known process calculus CSP [49] has had vast applications in the field of formal methods thanks to its intuitive notions of process and channel. This setting easily scales up to the analysis of cryptographic protocols [97] as pioneered by ....
M. J. C. Gordon and T. F. Melham. Introduction to HOL. Cambridge University Press, 1993.
Using Theory Morphisms for Implementing Formal Methods Tools - Brucker, Wolff (2003) (Correct)
....programming language with additional constructs such as quantifiers or universally quantified variables. Among the plethora of specification languages that has been developed, we will refer here only to examples such as Hoare Logics [1, 2] Z [3, 4] or its semantic sister Higher order Logics (HOL) [5], which has been advertised as functional language with quantifiers recently [6] For the formal analysis of specification languages, their representation, i.e. their embedding, within a logical framework based on typed # calculi such as NuPRL [7] Coq [8] or Isabelle [9, 10] is a widely ....
....the extension of subsets on tuples for component wise set inclusion) A signature morphism is a mapping # # which can be naturally extended to a specification morphism and a theory morphism. The following specification extensions S S # , called conservative specification extensions (see [5]) are of particular interest for this paper: 1. type synonyms, 2. constant definitions, and 3. type definitions. A type synonym introduces a type abbreviation and is denoted as: types t(# 1 , # n ) T (# 1 , # n , t # ) It is purely syntactical (i.e. it we will be used ....
[Article contains additional citation context not shown here]
Gordon, M.J.C., Melham, T.F.: Introduction to HOL. Cambridge Press (1993)
Using Theory Morphisms for Implementing Formal Methods Tools - Brucker, Wolff (2003) (Correct)
....programming language with additional constructs such as quantifiers or universally quantified variables. Among the plethora of specification languages that has been developed, we will refer here only to examples such as Hoare Logics [1, 2] Z [3, 4] or its semantic sister Higher order Logics (HOL) [5], which has been advertised as functional language with quantifiers recently [6] For the formal analysis of specification languages, their representation, i.e. their embedding, within a logical framework based on typed # calculi such as NuPRL [7] Coq [8] or Isabelle [9, 10] is a widely ....
....the extension of subsets on tuples for component wise set inclusion) A signature morphism is a mapping # # which can be naturally extended to a specification morphism and a theory morphism. The following specification extensions S S # , called conservative specification extensions (see [5]) are of particular interest for this paper: 1. type synonyms, 2. constant definitions, and 3. type definitions. A type synonym introduces a type abbreviation and is denoted as: types t(# 1 , #n ) T (# 1 , #n , t # ) It is purely syntactical (i.e. it we will be used ....
[Article contains additional citation context not shown here]
Gordon, M.J.C., Melham, T.F.: Introduction to HOL. Cambridge Press (1993)
Hol-Z 2.0: A Proof Environment for Z-Specifications - Brucker, Rittinger, Wolff (2003) (Correct)
....and lemmas, the axiomatic approach is too errorprone in practice. In contrast, a conservative extension introduces new constants (by constant definitions) and types (by type definitions) only via axioms of a particular form; a proof that conservative extensions preserve consistency can be found in [Gordon and Melham, 1993]. The HOL library provides conservative theories for the HOL core based on type bool, for the numbers such as nat and int, for typed set theory based on # set and a list theory based on # list. Isabelle [Paulson, 1994] is a generic theorem prover. New object logics can be introduced by ....
....a deductive system for Z, i.e. the soundness of all rules of the system with this semantics. The core of the ZFSN semantics consists of the definition of the partial functions [ # ] e] and [ p] P that assign to each element of each syntactic category HOL Z ZF Z Encoder Semantics [Gordon and Melham, 1993] = e] # ] p] P in ZFSN Figure 2: An Overview of Semantic Relations (types # , expressions e and predicates p) a type resp. a value (meaning) A calculus conforms to the standard if it reflects the semantic function where it is defined. The semantic functions are interpreted ....
[Article contains additional citation context not shown here]
Gordon, M. J. C. and Melham, T. F. (1993). Introduction to HOL. Cambridge University Press.
Fast Tactic-based Theorem Proving - Hickey, Nogin (2000) (Correct)
....structures and modularity, which allows parts of the prover to be customized on a domain speci c basis. Our architecture is used in the MetaPRL logical framework, with speedups of more than two orders of magnitude over traditional tactic based proof search. 1 Introduction Several provers [7 9, 11, 12, 15, 18] use higher order logics for reasoning because the expressivity of the logics permits concise problem descriptions, and because meta principles that characterize entire classes of problems can be proved and reused on multiple problem instances. In these provers, proof automation is coded in a ....
M.J.C. Gordon and T.F. Melham. Introduction to HOL. Cambridge University Press, 1993.
Simplification with Renaming: A general proof technique for.. - Massacci (1997) (5 citations) (Correct)
....This answer is not only of theoretical relevance but has an extreme importance for the future development of hardware and software verification tools. Indeed, variants of the sequent calculus are the main techniques used by interactive theorem provers, such as Isabelle [29] PVS [33] or HOL [1, 19]. Those provers have successfully tackled hardware and software verification and often require to prove some properties in decidable sub theories such as propositional logic (e.g. a N bits binary adder) or fragments of arithmetics [1, 33] If tableauxlike methods are hopeless by nature , then ....
M. J. C. Gordon and T. F. Melham. Introduction to HOL. Cambridge University Press, 1993.
Efficient Approximate Deduction and an Application to Computer.. - Massacci (1998) (Correct)
.... in knowledge representation points out a tight correspondence between dynamic logics and description logics, a family of expressive class based knowledge representation formalisms[182] First and higher order logics have also been widely used in hardware verifi cation with the system H0L [5, 27, 78] and in the analysis of security protocols by Marick [111] and Paulson [142] A general overview can also be found in the paper of Rushby [149] The unwinding of new applications areas and the progressive attention towards more complicated (real) problems require automated reasoning tools, for ....
....works of Vardi ; Wolper [174, 175] and Street ; Emerson [167] Besides fully automatic systems, the last years have seen the development of interactive theorem provers where the construction of the proof is guided by the user with more or less automatic proof tools and tactics. Systems like H0L [5, 78], Isabelle [141] or PVS [149] have been successfully used for tackling a number of problems in hardware and software verification. Their proofs are often based on variants of the sequent (Gentzen) calculus in the attempt to combine effective proof search with human oriented proof presentation. ....
M. Gordon and T. Melham. Introduction to HOL. Cambridge University Press, 1993.
A Theory for Composing Distributed Components, Based .. - Prasetya, Vos.. (2003) (Correct)
....ourselves of its connection to actual distributed systems and of its soundness. We will give a UNITY like semantics, and although no soundness proof will be presented here, all our laws have been mechanically checked for soundness with respect to the chosen semantics using the theorem prover HOL [10]. In principle, it should be possible to port the theory to a di#erent semantic setting (e.g. trace based semantics as used in [2, 3, 8, 9] 1.1 Contents of the paper A more technical motivation for attacking the problem we are confronted with, and our approach to solve it is explained in ....
....Second, it provides us with the concrete basis we need to argue about the soundness of our theory. Using the proposed semantics, we have mechanically verified almost all laws presented in this paper (except the laws in Section 6) using the Higher Order Logic theorem proving environment HOL [10]. The proofs will not be presented here, as they are too long and contain lots of low level technical details. If the reader is interested, the HOL proof scripts are available at request. The semantics we will give here is a UNITY like semantics. UNITY is an elegant and simple programming theory ....
[Article contains additional citation context not shown here]
Mike J.C. Gordon and Tom F. Melham. Introduction to HOL. Cambridge University Press, 1993.
Bridging Theorem Proving and Mathematical - Knowledge Retrieval Christoph (2005) (Correct)
No context found.
Mike J. C. Gordon and Tom F. Melham. Introduction to HOL. Cambridge University Press, Cambridge, United Kingdom, 1993.
Non-trivial Symbolic Computations in Proof - Planning Volker Sorge (2000) (Correct)
No context found.
M. Gordon and T. Melham. Introduction to HOL. Cambridge Univ. Press, 1993.
Defining a non-concrete recursive type in HOL which includes sets - Vos, Swierstra (2000) (Correct)
No context found.
M.J.C. Gordon and T.F. Melham. Introduction to HOL. Cambridge University Press, 1993.
Inductive Verification of Cryptographic Protocols - Bella (2000) (4 citations) (Correct)
No context found.
M. J. C. Gordon and T. F. Melham. Introduction to HOL. Cambridge University Press, 1993.
Two Semantic Embeddings of Z Schemas in Isabelle/HOL - Völker (2001) (Correct)
No context found.
M.J.C. Gordon and T.F. Melham. Introduction to HOL. Cambridge University Press, 1993.
A Theory for Composing Distributed Components Based.. - Prasetya, Vos.. (2003) (Correct)
No context found.
Mike J.C. Gordon and Tom F. Melham. Introduction to HOL. Cambridge University Press, 1993.
An Irrational Construction of R from Z - Arthan (Correct)
No context found.
Michael J.C. Gordon and Tom F. Melham, editors. Introduction to HOL. Cambridge University Press, 1993.
MMode, a Mizar Mode for the proof assistant Coq - Giero, Wiedijk (2003) (Correct)
No context found.
M.J.C. Gordon and T.F. Melham, editors. Introduction to HOL. Cambridge University Press, Cambridge, 1993.
A Case Study of a Formalized Security Architecture - Brucker, Wolff (2003) (Correct)
No context found.
Gordon, M. J. C. and T. F. Melham, "Introduction to HOL," Cambridge University Press, 1993, 472 pp.
Fusion and Simultaneous Execution in the Refinement Calculus - Back, Butler (1997) (6 citations) (Correct)
No context found.
M. Gordon and T. Melham. Introduction to HOL. Cambridge University Press, 1993.
Statecharts: From Visual Syntax to Model--Theoretic Semantics - Gerald Luttgen Michael (Correct)
No context found.
M.J.C. Gordon and T.F. Melham. Introduction to HOL. Cambridge Univ. Press, 1993.
Formal Refinement and Model Checking of an Echo.. - Alexander Krupp Wolfgang (Correct)
No context found.
M.J.Gordon. Introduction to HOL. Cambridge University Press, Cambridge, 1993.
Extending the Reach of Proof Planning by - Randomization And Restart (Correct)
No context found.
M. J. C. Gordon and T. F. Melham. Introduction to HOL. Cambridge University Press, Cambridge, UK, 1993.
Encoding the HOL Light logic in Coq - Wiedijk (Correct)
No context found.
M.J.C. Gordon and T.F. Melham, editors. Introduction to HOL. Cambridge University Press, Cambridge, 1993.
Mechanized Operational Semantics via (Co)Induction - Simon Ambler And (Correct)
No context found.
T. F. Melham and M. J. C. Gordon. Introduction to HOL. Cambridge University Press, 1993.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC