An axiomatic semantics for data-parallel computation

Authors:
A. Stewart
Affiliations:
Department of Computer Science, The Queen's University of Belfast, Belfast
Venue:
IW-FM'97 Proceedings of the 1st Irish conference on Formal Methods
Year:
1997

Citing 12
Cited 0

Communicating sequential processes

Communicating sequential processes
An axiomatic treatment of SIMD assignment

BIT
Data parallel computers and the FORALL statement

Journal of Parallel and Distributed Computing
An approach to correctness of data parallel algorithms

Journal of Parallel and Distributed Computing
Reasoning about data-parallel array assignment

Journal of Parallel and Distributed Computing
A Language for Array and Vector Processors

ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming

Communications of the ACM
Verifiable Programming

Verifiable Programming
The Science of Programming

The Science of Programming
A Discipline of Programming

A Discipline of Programming
Synchronising Asynchronous Communications

Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
On the Expressivity of a Weakest Precondition Calculus for a Simple Data-Parallel Programming Language

CONPAR 94 - VAPP VI Proceedings of the Third Joint International Conference on Vector and Parallel Processing: Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Proof rules for both directly and indirectly indexed data-parallel array assignment are presented. Consequently, the correctness of two programs, (i) a representation of Cannon's algorithm and (ii) sparse matrix-vector multiplication, are established by application of the rules.