Add to ORKGWe 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
The remainder of this thesis is organized as follows. Chapters 2 and 3 introduce the specification f...
We are developing a shared-variable refinement calculus in the style of the sequential calculi of Ba...
Abstract. Parallel programming continues to be difficult and error-prone, whether starting from spec...
We show how to apply the refinement calculus to stepwise refinement of parallel and reactive program...
AbstractThe refinement calculus and the action system formalism are combined to provide a uniform me...
. Action systems provide a general description of reactive systems, capable of modeling terminating,...
A standard multiplication algorithm for square matrices is transformed into a distributed algorithm....
Abstract. Action systems provide a general description of reactive systems, capable of modeling term...
Abstract. We extend the refinement calculus to permit the derivation of programs in the Bulk Synchro...
An action system is a framework for describing parallel or distributed systems, for which the refine...
. Action systems are used to extend program refinement methods for sequential programs, as described...
The action system formalism [3] is a state-based approach to distributed computing. In this paper, i...
We present a refinement strategy for Circus, which is the combination of Z, CSP, and the refinement ...
Refactoring is the process of changing the structure of a program without changing its behaviour. Re...
We define a language and a predicative semantics to model concurrent real-time programs. We consider...
The remainder of this thesis is organized as follows. Chapters 2 and 3 introduce the specification f...
We are developing a shared-variable refinement calculus in the style of the sequential calculi of Ba...
Abstract. Parallel programming continues to be difficult and error-prone, whether starting from spec...
We show how to apply the refinement calculus to stepwise refinement of parallel and reactive program...
AbstractThe refinement calculus and the action system formalism are combined to provide a uniform me...
. Action systems provide a general description of reactive systems, capable of modeling terminating,...
A standard multiplication algorithm for square matrices is transformed into a distributed algorithm....
Abstract. Action systems provide a general description of reactive systems, capable of modeling term...
Abstract. We extend the refinement calculus to permit the derivation of programs in the Bulk Synchro...
An action system is a framework for describing parallel or distributed systems, for which the refine...
. Action systems are used to extend program refinement methods for sequential programs, as described...
The action system formalism [3] is a state-based approach to distributed computing. In this paper, i...
We present a refinement strategy for Circus, which is the combination of Z, CSP, and the refinement ...
Refactoring is the process of changing the structure of a program without changing its behaviour. Re...
We define a language and a predicative semantics to model concurrent real-time programs. We consider...
The remainder of this thesis is organized as follows. Chapters 2 and 3 introduce the specification f...
We are developing a shared-variable refinement calculus in the style of the sequential calculi of Ba...
Abstract. Parallel programming continues to be difficult and error-prone, whether starting from spec...