Refinement of Parallel and Reactive Programs

Authors:
R. J.R. Back
Affiliations:
-
Venue:
Refinement of Parallel and Reactive Programs
Year:
1992

Citing 0
Cited 3

A Formal Method for Building Concurrent Real-Time Software

IEEE Software
Simulation Machines for Checking Action System Refinements

Electronic Notes in Theoretical Computer Science (ENTCS)
Modelling program compilation in the refinement calculus

2FACS'97 Proceedings of the 2nd BCS-FACS conference on Northern Formal Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show how to apply the refinement calculus to stepwise refinement of parallel and reactive programs. We use action systems as our basic program model. Action systems are sequential programs which can be implemented in a parallel fashion. Hence refinement calculus methods, originally developed for sequential programs, carry over to the derivation of parallel programs. Refinement of reactive programs is handled by data refinement techniques originally developed for the sequential refinement calculus. We exemplify the approach by a derivation of a mutual exclusion algorithm.