O. Muller, T. Nipkow, D. Oheimb, and O. Slotosch. HOLCF = HOL + LCF. J. Functional Programming, 1999. to appear. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Verification Environment for I/O Automata - Part II: Theorem.. - Müller (1999) (Correct)
....and HOLCF in such a way, that the user employs only the simpler logic HOL, whereas the use of the more expressive, but difficult HOLCF is restricted to meta theoretic arguments. The framework is based upon a semantic model of lazy lists using Scott s domain theory, as provided by Isabelle HOLCF [32]. In a comparison [11] to other sequence formalizations, Research supported by BMBF, KorSys which all incorporated functions on natural numbers in some way, this sequence model turned out to be the most adequate. TLS is not encoded directly, but as an instance of a generic temporal logic TL, ....
....section we briefly introduce the components of our toolbox. 2.1 The Theorem Proving System Isabelle [36] is a generic theorem proving environment that supports a number of object logics. We only use Isabelle s instantiation of higher order logic (HOL) and its extension to domain theory (HOLCF) [32]. HOL is based on Church s formulation of simple type theory [9] which has been augmented by polymorphism, type classes like in Haskell, and extension mechanisms for defining new constants and types. The syntax is that of simply typed calculus with an ML style first order language of types. In ....
O. Muller, T. Nipkow, D. Oheimb, and O. Slotosch. HOLCF = HOL + LCF. J. Functional Programming, 1999. to appear.
I/O Automata and Beyond: Temporal Logic and Abstraction in Isabelle - Müller (1998) (Correct)
....for system verification (HOL) 1 Introduction I O automata [9, 5] are used to model reactive, distributed systems. In [15] the restricted class of safe I O automata has been formalized in Isabelle [17] System runs have been modeled as lazy lists using Scott s domain theory in Isabelle HOLCF [16]. In a comparison [4] to other sequence formalizations, which all incorporated functions on natural numbers in some way, this sequence model turned out to be the most adequate. In this paper we start with this sequence and automaton model and build an extensive framework for the verification of ....
....x6 TLS is used to describe live I O automata. Abstraction rules are derived in x7, which are applied to the combination of Isabelle with model checking in x8. 2 Preliminaries Isabelle [17] is a generic theorem prover. We only use higher order logic (HOL) and its extension to domain theory (HOLCF) [16]. We employ standard mathematical notation, which, however, differs only slightly from the syntax in Isabelle. Type abbreviations, constant declarations, definitions and theorems are introduced by the keywords types, consts, defs, and thms, respectively. HOLCF uses Isabelle s type classes to ....
O. Muller, T. Nipkow, D. Oheimb, and O. Slotosch. HOLCF = HOL + LCF. J. Functional Programming, 1998. submitted.
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