HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Proving Data-Parallel Programs : a Unifying Approach

David Cachera 1 Gil Utard 2
1 REMAP - Regularity and massive parallel computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : 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.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 1:26:23 PM
Last modification on : Friday, February 4, 2022 - 3:19:31 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:38:02 PM


  • 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⟩



Record views


Files downloads