Skip to Main content Skip to Navigation
New interface
Reports (Research report)

Escape constructs in data-parallel languages: semantics and proof system

Abstract : We describe a simple data-parallel kernel language which encapsulates the main data-parallel control structures found in high-level languages such as MasPar's MPL or the recent HyperC. In particular, it includes the concept of data-parallel escape, which extends the break and continue constructs of the scalar C language. We give this language a natural semantics, we define a notion of assertion and describe an assertional proof system. We demonstrate its use by proving a small data-parallel Mandelbrot-like program.
Document type :
Reports (Research report)
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Colette ORANGE Connect in order to contact the contributor
Submitted on : Wednesday, April 17, 2019 - 1:29:08 PM
Last modification on : Wednesday, October 26, 2022 - 8:15:52 AM


Files produced by the author(s)


  • HAL Id : hal-02102484, version 1



Luc Bougé, Gil Utard. Escape constructs in data-parallel languages: semantics and proof system. [Research Report] LIP RR-94-18, Laboratoire de l'informatique du parallélisme. 1994, 2+19p. ⟨hal-02102484⟩



Record views


Files downloads