Using the Refinement Calculus for Dataflow Processes (1994)
| Venue: | IN PROC. SECOND AUSTRALASIAN REFINEMENT WORKSHOP |
| Citations: | 16 - 2 self |
BibTeX
@TECHREPORT{Mahony94usingthe,
author = {Brendan P. Mahony},
title = {Using the Refinement Calculus for Dataflow Processes},
institution = {IN PROC. SECOND AUSTRALASIAN REFINEMENT WORKSHOP},
year = {1994}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 real-time) dataflow-like processes. Conventional precondition and postcondition specifications of sequential programs are generalised to assumption and effect specifications of processes. Such specifications may be given predicate transformer semantics and then formally refined to implementations in much the same way as precondition and postcondition specifications of sequential programs. A minimal collection of dataflow-process operators and associated refinement laws is considered. Small examples of dataflow-process development are presented to demonstrate the utility of the approach. The compositionality of the approach is considered in detail.
