UO - Université d'Orléans : EA4022 (Château de la Source - Avenue du Parc Floral - BP 6749 - 45067 Orléans cedex 2 - France)
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.
https://hal.inria.fr/inria-00073660 Contributor : Rapport de Recherche InriaConnect in order to contact the contributor Submitted on : Wednesday, May 24, 2006 - 1:26:12 PM Last modification on : Friday, February 4, 2022 - 3:30:04 AM Long-term archiving on: : Sunday, April 4, 2010 - 9:22:00 PM
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⟩