Sciweavers

IPPS
1998
IEEE

Building BSP Programs Using the Refinement Calculus

13 years 8 months ago
Building BSP Programs Using the Refinement Calculus
Abstract. We extend the refinement calculus to permit the derivation of programs in the Bulk Synchronous Parallelism (BSP) style. This demonstrates 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.
David B. Skillicorn
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where IPPS
Authors David B. Skillicorn
Comments (0)