Synthesis of systolic arrays for inductive problems
Volume I: Parallel architectures on PARLE: Parallel Architectures and Languages Europe
A theoretical basis for stepwise refinement and the programming calculus
Science of Computer Programming
A calculus of refinements for program derivations
Acta Informatica
Parallel program design: a foundation
Parallel program design: a foundation
An exercise in the formal derivation of parallel programs: maximum flows in graphs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the conference on CONPAR 88
The Organization of Computations for Uniform Recurrence Equations
Journal of the ACM (JACM)
A Proof System for Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes
Communications of the ACM
Program development by stepwise refinement
Communications of the ACM
A Discipline of Programming
Stepwise Refinement of Action Systems
Proceedings of the International Conference on Mathematics of Program Construction, 375th Anniversary of the Groningen University
Types and Invariants in the Refinement Calculus
Proceedings of the International Conference on Mathematics of Program Construction, 375th Anniversary of the Groningen University
| Hi-index | 0.00 |
These last few years have seen the development of many parallel architectures. Among them, Distributed Memory Parallel Computers seem to be very promizing. The programmation of these machines requires to design processes to be mapped on the nodes, communicating by message passing along the links of the architecture. The aim of this paper is to give a contribution for a rationalized design of such programs, by defining refinement techniques.