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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. A. Ashcroft and W. W. Wadge,“Rx” for semantics, ACM TOPLAS Vol. 4, No. 2, 283–294, 1982.
M. Clint and K. T. Narayana,Programming structures for synchronous parallelism, Parallel Computing 83, North-Holland, 405–412, 1984.
J. de Bakker,Mathematical Theory of Program Correctness, Prentice-Hall International, 1980.
E. W. Dijkstra,A Discipline of Programming, Prentice-Hall, 1976.
D. Gries,The Science of Programming, Prentice-Hall International, 1981.
C. A. R. Hoare,Communicating Sequential Processes, Prentice-Hall, 1985.
C. A. R. Hoare and N. Wirth,An axiomatic definition of the programming language Pascal, Acta Informatica 2, 335–355, 1973.
D. A. Schmidt,Denotational Semantics, Allyn and Bacon INC., 1986.
A. Stewart,SIMD language design using prescriptive semantics, BIT 28, 639–650, 1988.
A. Stewart and P. Wray,The Formal Semantics of a SIMD Language, Internal Report, The Queens's University of Belfast, 1989.
J. E. Stoy,Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, MIT Press, 1977.
R. D. Tennent,The denotational semantics of programming languages, CACM, Vol. 19, No. 8, 437–453, 1976.