An axiomatic treatment ofSIMD assignment |
| |
| Authors: | Alan Stewart |
| |
| Affiliation: | (1) Department of Computer Science, The Queen's University of Belfast, BT7 1NN, Northern Ireland |
| |
| Abstract: | The aims of this article are to provide (i) an abstract characterisation of SIMD computation and (ii) a simple proof theory for SIMD programs. A soundness result is stated and the consequences of the result are analysed. The use of the axiomatic theory is illustrated by a proof of a parallel implementation of Euclid's GCD algorithm. |
| |
| Keywords: | F.3.1 C.1.2 F3.2 D3.1 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
