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.
Type de document :
Rapport
[Research Report] RR-3032, INRIA. 1996
Liste complète des métadonnées

https://hal.inria.fr/inria-00073661
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 13:26:23
Dernière modification le : vendredi 20 avril 2018 - 15:44:24
Document(s) archivé(s) le : dimanche 4 avril 2010 - 21:38:02

Fichiers

Identifiants

  • HAL Id : inria-00073661, version 1

Citation

David Cachera, Gil Utard. Proving Data-Parallel Programs : a Unifying Approach. [Research Report] RR-3032, INRIA. 1996. 〈inria-00073661〉

Partager

Métriques

Consultations de la notice

138

Téléchargements de fichiers

102