Skip to Main content Skip to Navigation
Reports

Formal Validation of Data-Parallel Programs : a Two-Component Assertional Proof System for a Simple Language

Abstract : We present a proof system for a simple data-parallel kernel language called \L. This proof system is based on a two-component assertion language. We define a weakest preconditions calculus and analyse its definability properties. This calculus is used to prove the completeness of the proof system. We also present a two-phase proof methodology, yielding proofs similar to those for scalar languages. We finally discuss other approaches.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00073660
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 1:26:12 PM
Last modification on : Wednesday, November 20, 2019 - 3:15:16 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:22:00 PM

Identifiers

  • HAL Id : inria-00073660, version 1

Citation

Luc Bougé, David Cachera, Yann Le Guyadec, Gil Utard, Bernard Virot. Formal Validation of Data-Parallel Programs : a Two-Component Assertional Proof System for a Simple Language. [Research Report] RR-3033, INRIA. 1996. ⟨inria-00073660⟩

Share

Metrics

Record views

542

Files downloads

517