Results 1 
8 of
8
The Refinement Calculator: Proof Support for Program Refinement
 Formal Methods Pacific ’97
, 1997
"... . We describe the Refinement Calculator, a tool which supports ..."
Abstract

Cited by 29 (3 self)
 Add to MetaCart
(Show Context)
. We describe the Refinement Calculator, a tool which supports
A HOL Formalisation of the Temporal Logic of Actions
 Higher Order Logic Theorem Proving and Its Applications, volume 859 of Lecture Notes in Computer Science (LNCS
, 1994
"... . We describe an attempt to formalise the semantics of the ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
(Show Context)
. We describe an attempt to formalise the semantics of the
Program Derivation Using the Refinement Calculator
 Theorem Proving in Higher Order Logics: 9th International Conference, volume 1125 of Lecture Notes in Computer Science
, 1996
"... . The refinement calculus provides a theory for the stepwise refinement ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
. The refinement calculus provides a theory for the stepwise refinement
TkWinHOL: A Tool for Doing Window Inference in HOL
 In Proc. 1995 International Workshop on Higher Order Logic Theorem Proving and its Applications, Lecture
, 1995
"... Window inference is a method for contextual rewriting and refinement, supported by the HOL Window Inference Library. This paper describes a userfriendly interface for window inference. The interface permits the user to select subexpressions by pointing and clicking and to select transformations fro ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
Window inference is a method for contextual rewriting and refinement, supported by the HOL Window Inference Library. This paper describes a userfriendly interface for window inference. The interface permits the user to select subexpressions by pointing and clicking and to select transformations from menus. The correctness of each transformation step is proved automatically by the HOL system. The interface can be tailored to particular userdefined theories. One such extension, for program refinement, is described. 1 Introduction Though the original purpose of the HOL system [8] was as a tool for hardware verification, it has become popular also as a basis for software verification (see for example [1, 5, 7]). However, the theories built for supporting the software development process are normally difficult to use, especially if one does not have any previous detailed knowledge of the HOL system. In order to make such theories available to a general audience, it is essential that user...
Refining Reactive Systems in HOL using Action Systems
, 1997
"... This report discusses how to refine reactive systems using the HOL theorem prover. We show how Action Systems  the formal framework supported  can be formalised in HOL. We describe a simple refinement example. We also discuss how the work presented here can be used in connection with the Refinem ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This report discusses how to refine reactive systems using the HOL theorem prover. We show how Action Systems  the formal framework supported  can be formalised in HOL. We describe a simple refinement example. We also discuss how the work presented here can be used in connection with the Refinement Calculator, a tool supporting program refinement.
A mechanical formalization of several fairness notions
 VDM ’91: Formal Software Development Methods. SpringerVerlag Lecture Notes in Computer Science 551
, 1991
"... The views and conclusions contained in this document are those of the author and should not be interpreted as representing the official policies, either expressed or ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The views and conclusions contained in this document are those of the author and should not be interpreted as representing the official policies, either expressed or
Formal Methods and Mechanical Verification applied to the development of a convergent distributed sorting program
, 1996
"... Gentle introductions to the programming logic UNITY, the theorem proving environment HOL, and the embedding of the first into the latter are presented. Equipped with this apparatus a methodology for designing distributed algorithms is described. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Gentle introductions to the programming logic UNITY, the theorem proving environment HOL, and the embedding of the first into the latter are presented. Equipped with this apparatus a methodology for designing distributed algorithms is described.
Formalizing the Transformational Design of Communicating Systems in the Theorem Prover LAMBDA
, 1993
"... This paper presents the implementation of a transformational approach in the system LAMBDA, a proof checker for higher order logic. The approach aims at the design of communicating systems and is based on a sophisticated semantic model originating from the ESPRIT Basic Research Action "ProCoS&q ..."
Abstract
 Add to MetaCart
(Show Context)
This paper presents the implementation of a transformational approach in the system LAMBDA, a proof checker for higher order logic. The approach aims at the design of communicating systems and is based on a sophisticated semantic model originating from the ESPRIT Basic Research Action "ProCoS" [Bjø89]. The implementation is used for the formal verification of transformation rules and for the application of proved rules to synthesize parallel systems. Unlike other approaches [BvW90] explicit names, types and values are used for program variables and channels. 1 The transformational approach We pursue a transformational approach where specifications of communicating systems are transformed stepwise into occamlike programs. The starting point in our approach is the specification language SL, [ORSS92] which was developed in the project ProCoS [Bjø89]. SLsystems are made of an interface \Delta, local variables LV, trace assertions TA and communication assertions CA and are shortly writt...