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.
A standard multiplication algorithm for square matrices is transformed into a distributed algorithm....
A functional language called BSML is designed for programming BSP algorithms in direct mode. Its aim...
We are developing a shared-variable refinement calculus in the style of the sequential calculi of Ba...
We extend the Refinement Calculus to permit the derivation of programs in the Bulk Synchronous Paral...
AbstractAn extension of the λ-calculus called BSλ is introduced as a formal basis for functional lan...
Abstract — With the current generalisation of parallel archi-tectures arises the concern of applying...
We show how to apply the refinement calculus to stepwise refinement of parallel and reactive program...
Research Report RR-2010-01With the current generalization of parallel architectures arises the conce...
The BSP model is an established practical general-purpose parallel programming model. This paper pre...
A uniform treatment is presented of specifications, programs, and programming for communicating proc...
Parallel computers are a powerful tool of modern science and engineering. A parallel computer may ha...
AbstractThe refinement calculus and the action system formalism are combined to provide a uniform me...
The Bulk-Synchronous Parallel (BSP) bridging model is a candidate for a simple and practical definit...
reasoning, trace semantics. Parallel computers have not yet had the expected impact on mainstream co...
We define a language and a predicative semantics to model concurrent real-time programs. We consider...
A standard multiplication algorithm for square matrices is transformed into a distributed algorithm....
A functional language called BSML is designed for programming BSP algorithms in direct mode. Its aim...
We are developing a shared-variable refinement calculus in the style of the sequential calculi of Ba...
We extend the Refinement Calculus to permit the derivation of programs in the Bulk Synchronous Paral...
AbstractAn extension of the λ-calculus called BSλ is introduced as a formal basis for functional lan...
Abstract — With the current generalisation of parallel archi-tectures arises the concern of applying...
We show how to apply the refinement calculus to stepwise refinement of parallel and reactive program...
Research Report RR-2010-01With the current generalization of parallel architectures arises the conce...
The BSP model is an established practical general-purpose parallel programming model. This paper pre...
A uniform treatment is presented of specifications, programs, and programming for communicating proc...
Parallel computers are a powerful tool of modern science and engineering. A parallel computer may ha...
AbstractThe refinement calculus and the action system formalism are combined to provide a uniform me...
The Bulk-Synchronous Parallel (BSP) bridging model is a candidate for a simple and practical definit...
reasoning, trace semantics. Parallel computers have not yet had the expected impact on mainstream co...
We define a language and a predicative semantics to model concurrent real-time programs. We consider...
A standard multiplication algorithm for square matrices is transformed into a distributed algorithm....
A functional language called BSML is designed for programming BSP algorithms in direct mode. Its aim...
We are developing a shared-variable refinement calculus in the style of the sequential calculi of Ba...
DOI
Add to ORKG