DSpace Home >
→
Organismes déposants >
→
LIP - Laboratoire de l'Informatique du Parallélisme >
→
View Item >

dc.contributor.author	Laboratoire de l'informatique du parallélisme	en_US
dc.contributor.author	Bougé, Luc	en_US
dc.contributor.author	Utard, Gil	en_US
dc.date.accessioned	2007-05-24T11:53:16Z
dc.date.available	2007-05-24T11:53:16Z
dc.date.issued	1994-06-02	en_US
dc.identifier.other	LIP-RR - 1994-18	en_US
dc.identifier.uri	http://hdl.handle.net/2332/1192
dc.description.abstract	(eng) 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.	en_US
dc.format.extent	2+19p	en_US
dc.format.extent	309331 bytes
dc.format.extent	23 bytes
dc.format.mimetype	application/pdf
dc.format.mimetype	application/octet-stream
dc.language.iso	eng	en_US
dc.rights	http://lara.inist.fr/utilisation.jsp	en_US
dc.source.uri	ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR1994/RR1994-18.ps.Z	en_US
dc.subject	Concurrent Programming	en_US
dc.subject	Specifying and Verifying and Reasoning about Programs	en
dc.subject	Semantics of Programming Languages	en
dc.subject	Data-Parallel Languages	en
dc.subject	Proof System, Hoare Logic
dc.subject	Hoare Logic	en
dc.title	Escape constructs in data-parallel languages: semantics and proof system	en_US
dc.type	Research report	en_US