Proving Data-Parallel Programs : a Unifying Approach - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1996

Proving Data-Parallel Programs : a Unifying Approach

David Cachera
Gil Utard


We define an axiomatic semantics for a common kernel of existing data-parallel languages. We introduce an assertional language which enables us to define a weakest liberal precondition calculus which has the Definability Property, and a proof system ({\it à la\/} Hoare) which has the Completeness Property. Moreover, our axiomatic semantics integrates two previous works in the definition of proof systems for data-parallel programs. This work sheds a new light on the logical complexity of proving data-parallel programs.
Fichier principal
Vignette du fichier
RR-3032.pdf (335.42 Ko) Télécharger le fichier

Dates and versions

inria-00073661 , version 1 (24-05-2006)


  • HAL Id : inria-00073661 , version 1


David Cachera, Gil Utard. Proving Data-Parallel Programs : a Unifying Approach. [Research Report] RR-3032, INRIA. 1996. ⟨inria-00073661⟩
63 View
146 Download


Gmail Facebook Twitter LinkedIn More