Skip to main content
Conference Proceedings

Building BSP programs using the refinement calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1998) 1388 790-795
DOI: 10.1007/3-540-64359-1_742
2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We extend the refinement calculus to permit the derivation of programs in the Bulk Synchronous Parallelism (BSP) style. This demon* strates that formal approaches developed for sequential computing can be generalised to (some) parallel computing environments, and may be useful for managing some of the details of programming in such situations.

Cite

CITATION STYLE

APA

Skillicorn, D. B. (1998). Building BSP programs using the refinement calculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1388, pp. 790–795). Springer Verlag. https://doi.org/10.1007/3-540-64359-1_742

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free