A Decompositional Approach to the Design of Parallel Programs

Authors:
Ying Liu;Ambuj K. Singh;Rajive L. Bagrodia
Affiliations:
Univ. of California at Santa Barbara, Santa Barbara;Univ. of California at Santa Barbara, Santa Barbara;Univ. of California at Los Angeles, Los Angeles
Venue:
IEEE Transactions on Software Engineering
Year:
1994

Citing 12
Cited 0

Systematic software development using VDM

Systematic software development using VDM
Hierarchical correctness proofs for distributed algorithms

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
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)
Stepwise refinement of parallel algorithms

Science of Computer Programming
Derivation of efficient parallel programs: an example from genetic sequence analysis

International Journal of Parallel Programming
UC: a language for the connection machine

Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Applications of the “phase abstractions” for portable and scalable parallel programming

Languages, compilers and run-time environments for distributed memory machines
An axiomatic basis for computer programming

Communications of the ACM
Efficient Implementation of high-level parallel programs

ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
The Science of Programming

The Science of Programming
A Discipline of Programming

A Discipline of Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

A methodology for the derivation of parallel implementations from program specifications is developed. The goal of the methodology is to decompose a program specification into a collection of module specifications via property refinement, such that each module may be implemented independently by a subprogram. The correctness of the implementation is then deduced from the correctness of the property refinement procedure and the correctness of the individual subprograms. The refinement strategy is based on identifying frequently occurring control structures such as sequential composition and iteration. The methodology is developed in the context of the UNITY logic and the UC programming language, and illustrated through the solution of diffusion aggregation in fluid flow simulations.