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.Nous décrivons un langage minimal qui capture la sémantique des structures de contrôle des langages data-parallèles tels que MPL de MasPar ou HyperC. en particulier, il étend le concept d'échappement du langage C scalaire, tel que...
. Most data-parallel languages use arrays to support parallelism. This regular data structure allows...
This thesis presents a set of verification techniques based on permission-based separation logic to ...
This thesis presents an axiomatic method for proving certain correctness properties of parallel pro...
(eng) We describe a simple data-parallel kernel language which encapsulates the main data-parallel c...
We describe a small kernel language which encapsulates the semantic features of data-parallel contr...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : RP 13451 / INIST-CNRS - ...
(eng) We present a proof outline generation system for a simple data-parallel kernel language called...
AbstractWe present a proof system for a simple data-parallel kernel language called L. This proof sy...
The development of massively parallel computing in the last two decades has initially been oriented ...
We give a Hoare-like proof system for the data-parallel language L, and we present an automatic tool...
Two formal models for parallel computation are presented: an abstract conceptual model and a paralle...
The success of parallel architectures has been limited by the lack of high-level parallel programmin...
. We propose an alternate approach to the usual introduction of parallelism in logic programming. In...
This thesis is about scalable formal verification techniques for software. A verification technique ...
A simple but general parallel programming language is considered. The semantics of programs is defin...
. Most data-parallel languages use arrays to support parallelism. This regular data structure allows...
This thesis presents a set of verification techniques based on permission-based separation logic to ...
This thesis presents an axiomatic method for proving certain correctness properties of parallel pro...
(eng) We describe a simple data-parallel kernel language which encapsulates the main data-parallel c...
We describe a small kernel language which encapsulates the semantic features of data-parallel contr...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : RP 13451 / INIST-CNRS - ...
(eng) We present a proof outline generation system for a simple data-parallel kernel language called...
AbstractWe present a proof system for a simple data-parallel kernel language called L. This proof sy...
The development of massively parallel computing in the last two decades has initially been oriented ...
We give a Hoare-like proof system for the data-parallel language L, and we present an automatic tool...
Two formal models for parallel computation are presented: an abstract conceptual model and a paralle...
The success of parallel architectures has been limited by the lack of high-level parallel programmin...
. We propose an alternate approach to the usual introduction of parallelism in logic programming. In...
This thesis is about scalable formal verification techniques for software. A verification technique ...
A simple but general parallel programming language is considered. The semantics of programs is defin...
. Most data-parallel languages use arrays to support parallelism. This regular data structure allows...
This thesis presents a set of verification techniques based on permission-based separation logic to ...
This thesis presents an axiomatic method for proving certain correctness properties of parallel pro...