 |
Université d'Orléans |  |
|
Université d'Orléans | |
| HAL: inria-00073660, version 1 |
| See detailed view |  BibTeX,EndNote,... |
 |
|
|
| Formal Validation of Data-Parallel Programs : a Two-Component Assertional Proof System for a Simple Language |
|
|
| Luc Bougé 1David Cachera 1 |
|
|
| (1996) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | REMAP (INRIA Rhône-Alpes / LIP Laboratoire de l'Informatique du Parallélisme) |
|
|
|
INRIA – École Normale Supérieure - Lyon – CNRS : UMR5668 – LIP |
|
|
| 2: | Laboratoire de Recherche en Informatique et ses Applications de Vannes et Lorient (VALORIA) |
|
|
|
Université de Bretagne Sud |
|
|
| 3: | Laboratoire de l'Informatique du Parallélisme (LIP) |
|
|
|
Université de Lyon – CNRS : UMR5668 – INRIA – École Normale Supérieure - Lyon – Université Claude Bernard - Lyon I |
|
|
| 4: | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
|
|
|
|
|
|
|
| Domain | : | Computer Science/Other |
|
|
| CONCURRENT PROGRAMMING / SPECIFYING AND VERIFYING AND REASONING ABOUT PROGRAMS / SEMANTICS OF PROGRAMMING LANGUAGES / DATA-PARALLEL LANGUAGES / PROOF SYSTEM / HOARE LOGIC / WEAKEST PRECONDITIONS |
|
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| inria-00073660, version 1 | |
| http://hal.inria.fr/inria-00073660 | |
| oai:hal.inria.fr:inria-00073660 | |
| From: Rapport De Recherche Inria | |
| Submitted on: Wednesday, 24 May 2006 13:26:12 | |
| Updated on: Friday, 23 October 2009 14:47:34 | |
