Results 1  10
of
62,413
Procedures and Invariants in the Refinement Calculus
 Science of Computer Programming
, 1994
"... Invariants allow a rigorous treatment of types as sets in the refinement calculus, a method for developing imperative programs. The interaction of procedures and invariants is explored, resulting in a practical formalisation of existing programming practice. 1 Introduction The notion of local invar ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
Invariants allow a rigorous treatment of types as sets in the refinement calculus, a method for developing imperative programs. The interaction of procedures and invariants is explored, resulting in a practical formalisation of existing programming practice. 1 Introduction The notion of local
An iterator construct for the refinement calculus
 In Fourth Irish Workshop on Formal Methods
, 2000
"... This paper concerns the introduction of an iterator into the refinement calculus. The construct is based on concepts from functional programming, and the work gives an interesting example of crossfertilisation between the functional and imperative programming worlds. Specifically, the iterator cons ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper concerns the introduction of an iterator into the refinement calculus. The construct is based on concepts from functional programming, and the work gives an interesting example of crossfertilisation between the functional and imperative programming worlds. Specifically, the iterator
A Refinement Calculus for VHDL
, 1996
"... A refinement calculus for the specification of realtime systems and their refinement to a VHDL behavioural description is set out here. The specification format is alogical triple with the look of a ZorVDM schema. Choices from a short menu of refinement operations gradually convert an initial speci ..."
Abstract
 Add to MetaCart
A refinement calculus for the specification of realtime systems and their refinement to a VHDL behavioural description is set out here. The specification format is alogical triple with the look of a ZorVDM schema. Choices from a short menu of refinement operations gradually convert an initial
Interpreting Nondeterminism in the Refinement Calculus
 Proceedings of the BCSFACS 7th Refinement Workshop, Workshops in Computing
, 1996
"... We introduce a simple programming language and define its predicate transformer semantics. We motivate the choice of the constructs for the language by algebraic arguments, showing that the constructs are essentially the basic algebraic operations that are available for predicate transformers, when ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
nondeterminism. We also consider the notion of correctness and refinement of program statements that this intuitive interpretation gives rise to, and show the connection between the usersystem interpretation and the interpretation of program execution as a game. Keywords: Refinement Calculus, nondeterminism
A Refinement Calculus for Promela
"... Abstract—The use of formal methods for developing software is increasing. However in many cases only a model of the system is validated against a set of specifications. The actual implementation may thus not correspond to the formal model. One approach to this problem is to directly verify the actua ..."
Abstract
 Add to MetaCart
dual action semantics for a minimal core of Promela (called Featherweight Promela). The operational semantics of Featherweight Promela makes it easier to define the refinement calculus as a set of structural rules. Based on our calculus, we derive syntax directed translation rules for refinement
Products in the Refinement Calculus
, 1999
"... We study program states that are described as tuples, i.e., product state spaces. Modeling programs as predicate transformers, we define a product operator on program statements that describes the independent execution of statements on disjoint state spaces. The algebraic properties of this product ..."
Abstract

Cited by 36 (2 self)
 Add to MetaCart
are useful to formulate data refinement, both as a general concept and as a technique for replacing local state components of program blocks.
Fusion and Simultaneous Execution in the Refinement Calculus
 Acta Informatica
, 1997
"... In the refinement calculus, program statements are modelled as predicate transformers. A product operator for predicate transformers was introduced by Martin [18] and Naumann [25] using category theoretic considerations. ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
In the refinement calculus, program statements are modelled as predicate transformers. A product operator for predicate transformers was introduced by Martin [18] and Naumann [25] using category theoretic considerations.
Metavariables and Conditional Refinements in the Refinement Calculus
 Proceedings of the 6th Refinement Workshop
, 1994
"... We describe two techniques for the refinement calculus that facilitate goaldirected development. The techniques achieve this by allowing the deferring of decisions about the precise form of refinement steps, so highlevel choices can be expressed as soon as those choices are appropriate. Metavar ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We describe two techniques for the refinement calculus that facilitate goaldirected development. The techniques achieve this by allowing the deferring of decisions about the precise form of refinement steps, so highlevel choices can be expressed as soon as those choices are appropriate
Using the Refinement Calculus for Dataflow Processes
 IN PROC. SECOND AUSTRALASIAN REFINEMENT WORKSHOP
, 1994
"... The refinement calculus, based on predicate transformer semantics, is proving useful in the construction of sequential programs. It is argued that the refinement calculus provides a suitable development formalism for (possibly realtime) dataflowlike processes. Conventional precondition and pos ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
The refinement calculus, based on predicate transformer semantics, is proving useful in the construction of sequential programs. It is argued that the refinement calculus provides a suitable development formalism for (possibly realtime) dataflowlike processes. Conventional precondition
Program Inversion in the Refinement Calculus
 Information Processing letters
, 1990
"... We present a calculational method for inverting programs by inverting the components separately. This is made possible by using assertions as commands and by permitting constructs that exhibit angelic nondeterminism. Rules are given for transforming inverted programs so that the angelic constructs a ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We present a calculational method for inverting programs by inverting the components separately. This is made possible by using assertions as commands and by permitting constructs that exhibit angelic nondeterminism. Rules are given for transforming inverted programs so that the angelic constructs are removed. A simple example illustrates the method. 1 Introduction The idea of program inversion goes back to Dijkstra [8]. Informally speaking, inverting a program S means constructing a program T that works like the reverse of S . Thus T , supplied with some output of S , will calculate the corresponding input to S . Intuitively based rules for program inversion by calculation are given by Gries [9]. A formal definition of the concept of inverse program together with proof rules for inverting programs is given by Chen and Udding [6], who demonstrate the use of program inversion in formal program development. Both Dijkstra and Gries consider programs to be invertible only if they are func...
Results 1  10
of
62,413