Results 1  10
of
23
From Timed Automata to Logic  and Back
 MFCS’95, LNCS 969
, 1995
"... One of the most successful techniques for automatic verification is that of model checking. For finite automata there exist since long extremely efficient modelchecking algorithms, and in the last few years these algorithms have been made applicable to the verification of realtime automata usi ..."
Abstract

Cited by 61 (11 self)
 Add to MetaCart
One of the most successful techniques for automatic verification is that of model checking. For finite automata there exist since long extremely efficient modelchecking algorithms, and in the last few years these algorithms have been made applicable to the verification of realtime automata using the regiontechniques of Alur and Dill. In this
HOLCF: Higher Order Logic of Computable Functions
 In Theorem Proving in Higher Order Logics, volume 971 of LNCS
, 1995
"... . This paper presents a survey of HOLCF, a higher order logic of computable functions. The logic HOLCF is based on HOLC, a variant of the well known higher order logic HOL, which offers the additional concept of type classes. HOLCF extends HOLC with concepts of domain theory such as complete pa ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
. This paper presents a survey of HOLCF, a higher order logic of computable functions. The logic HOLCF is based on HOLC, a variant of the well known higher order logic HOL, which offers the additional concept of type classes. HOLCF extends HOLC with concepts of domain theory such as complete partial orders, continuous functions and a fixed point operator. With the help of type classes the extension can be formulated in a way such that the logic LCF constitutes a proper sublanguage of HOLCF. Therefore techniques from higher order logic and LCF can be combined in a fruitful manner avoiding drawbacks of both logics. The development of HOLCF was entirely conducted within the Isabelle system. 1 Introduction This paper presents a survey of HOLCF, a higher order logic of computable functions. The logic HOLCF is based on HOLC, a variant of the well known higher order logic HOL [GM93], which offers the additional concept of type classes. HOLCF extends HOLC with concepts of domain t...
Translating Specifications in VDMSL to PVS
 Theorem Proving in Higher Order Logics: 9th International Conference, TPHOLs '96, volume 1125 of Lecture Notes in Computer Science
, 1996
"... . This paper presents a method for translating a subset of VDMSL to higher order logic, more specifically the PVS specification language. This method has been used in an experiment where we have taken three existing, relatively large specifications written in VDMSL, handtranslated these to PVS an ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
(Show Context)
. This paper presents a method for translating a subset of VDMSL to higher order logic, more specifically the PVS specification language. This method has been used in an experiment where we have taken three existing, relatively large specifications written in VDMSL, handtranslated these to PVS and then tried to type check the results. This is not as simple as it may sound since the specifications make extensive use of subtypes, via type invariants and pre and postconditions, and therefore type checking necessarily involves some theorem proving. In trying to prove some of these type checking conditions, a worrying number of errors were identified in the specifications. 1 Introduction In a research project entitled "Towards industrially applicable proof support for VDMSL", we aim at developing tool support for proving theorems about specifications written in the VDM Specification Language (VDMSL) [6]. We would like to base our work on available theorem proving technology. The goal...
Experiments with ZF Set Theory in HOL and Isabelle
 IN PROCEEDINGS OF THE 8TH INTERNATIONAL WORKSHOP ON HIGHER ORDER LOGIC THEOREM PROVING AND ITS APPLICATIONS, LNCS
, 1995
"... Most general purpose proof assistants support versions of typed higher order logic. Experience has shown that these logics are capable of representing most of the mathematical models needed in Computer Science. However, perhaps there exist applications where ZFstyle set theory is more natural, ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
Most general purpose proof assistants support versions of typed higher order logic. Experience has shown that these logics are capable of representing most of the mathematical models needed in Computer Science. However, perhaps there exist applications where ZFstyle set theory is more natural, or even necessary. Examples may include Scott's classical inverselimit construction of a model of the untyped  calculus (D1 ) and the semantics of parts of the Z specification notation. This paper
LCF Examples in HOL
 The Computer Journal
, 1994
"... The LCF system provides a logic of fixed point theory and is useful to reason about nontermination, recursive definitions and infinitevalued types such as lazy lists. Because of continual presence of bottom elements, it is clumsy for reasoning about finitevalued types and strict functions. The ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
(Show Context)
The LCF system provides a logic of fixed point theory and is useful to reason about nontermination, recursive definitions and infinitevalued types such as lazy lists. Because of continual presence of bottom elements, it is clumsy for reasoning about finitevalued types and strict functions. The HOL system provides set theory and supports reasoning about finitevalued types and total functions well. In this paper a number of examples are used to demonstrate that an extension of HOL with domain theory combines the benefits of both systems. The examples illustrate reasoning about infinite values and nonterminating functions and show how domain and set theoretic reasoning can be mixed to advantage. An example presents a proof of correctness of a recursive unification algorithm using wellfounded induction.
A Semantic Theory for ValuePassing Processes Late Approach  Part I: A Denotational Model and Its Complete Axiomatization
, 1995
"... A general class of languages and denotational models for valuepassing calculi based on the late semantic approach is defined. A concrete instantiation of the general syntax is given. This is a modification of the standard CCS according to the late approach. A denotational model for the concrete ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
A general class of languages and denotational models for valuepassing calculi based on the late semantic approach is defined. A concrete instantiation of the general syntax is given. This is a modification of the standard CCS according to the late approach. A denotational model for the concrete language is given, an instantiation of the general class. An equationally based proof system is defined and shown to be sound and complete with respect to the model.
Coalgebraic Theories of Sequences in PVS
, 1998
"... This paper explains the setting of an extensive formalisation of the theory of sequences (finite and infinite lists of elements of some data type) in the Prototype Verification System pvs. This formalisation is based on the characterisation of sequences as a final coalgebra, which is used as an axi ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
This paper explains the setting of an extensive formalisation of the theory of sequences (finite and infinite lists of elements of some data type) in the Prototype Verification System pvs. This formalisation is based on the characterisation of sequences as a final coalgebra, which is used as an axiom. The resulting theories comprise standard operations on sequences like composition (or concatenation), filtering, flattening, and their properties. They also involve the prefix ordering and proofs that sequences form an algebraic complete partial order. The finality axiom gives rise to various reasoning principles, like bisimulation, simulation, invariance, and induction for admissible predicates. Most of the proofs of equality statements are based on bisimulations, and most of the proofs of prefix order statements use simulations. Some significant aspects of these theories are described in detail. This coalgebraic formalisation of sequences is presented as a concrete example that shows t...
Reasoning about Correctness Properties of a Coordination Programming Language
, 2009
"... any of the information contained in it must acknowledge this thesis as the source of the quotation or information.   Safety critical systems place additional requirements to the programming language used to implement them with respect to traditional environments. Examples of features that influenc ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
any of the information contained in it must acknowledge this thesis as the source of the quotation or information.   Safety critical systems place additional requirements to the programming language used to implement them with respect to traditional environments. Examples of features that influence the suitability of a programming language in such environments include complexity of definitions, expressive power, bounded space and time and verifiability. Hume is a novel programming language with a design which targets the first three of these, in some ways, contradictory features: fully expressive languages cannot guarantee bounds on time and space, and lowlevel languages which can guarantee space and time bounds are often complex and thus errorphrone. In Hume, this contradiction is solved by a two layered architecture: a highlevel fully expressive language, is built on top of a lowlevel coordination language which can guarantee space and time bounds.
Supporting Reasoning about Functional Programs: An Operational Approach
 In Glasgow Workshop on Functional Programming
, 1995
"... ©Copyright in this paper belongs to the author(s) Published in collaboration with the ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
©Copyright in this paper belongs to the author(s) Published in collaboration with the
Formalising a Model of the lambdacalculus in HOLST
, 1994
"... Most new theorem provers implement strong and complicated type theories which eliminate some of the limitations of simple type theories such as the HOL logic. A more accessible alternative might be to use a combination of set theory and simple type theory as in HOLST which is a version of the HOL s ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Most new theorem provers implement strong and complicated type theories which eliminate some of the limitations of simple type theories such as the HOL logic. A more accessible alternative might be to use a combination of set theory and simple type theory as in HOLST which is a version of the HOL system supporting a ZFlike set theory in addition to higher order logic. This paper presents a case study on the use of HOLST to build a model of the calculus by formalising the inverse limit construction of domain theory. This construction is not possible in the HOL system itself, or in simple type theories in general. 1 Introduction The HOL system [GM93] supports a simple and accessible yet very powerful logic, called higher order logic or simple type theory. This is probably a main reason why it has one of the largest user communities of any theorem prover today. However, it is heard every now and then that users cannot quite do what they would like to do, e.g. due to restrictions in t...