Yann Le Guyadec

Learn More
We describe a small kernel language which encapsulates the semantic features of data-parallel control constructs as found in modern data-parallel languages. We give it a denotational semantics, and describe an assertional proof system in the style of Hoare's logic. Our contribution is to use two-part assertions , where the current extent of parallelism is(More)
Nowadays, most of distributed architectures are MIMD (Multiple Instruction streams, Multiple Data streams) parallel computers or networks of workstations. They are easily scalable, concerning the number of processing elements, the amount of memory or the bandwidth of the underlying communication network. The challenge consists in taking advantage of the(More)
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 deene a weakest preconditions calculus and analyse its deenability properties. This calculus is used to prove the completeness of the proof system. We also present a two-phase proof methodology, yielding proofs(More)
R esum e Nous pr esentons un calcul des pr econditions les plus faibles, tel que propos e par Dijkstra, pour un langage minimal repr esentatif des langages data-parallels existants. Nous employons un langage d'assertion en deux parties, o u la port ee du parall elisme est sp ecii ee par une expression bool eenne vectorielle distincte. Nous prouvons que les(More)
We propose an alternate approach to the usual introduction of parallelism in logic programming. Instead of detecting the intrinsic parallelism by an automatic and complex data-ow analysis, or upgrading standard logic languages by explicit concurrent control structures leading to task-oriented languages, we tightly integrate the concepts of the data-parallel(More)
SYNOPSIS Our work takes place in the general problem of building and controlling homogeneous robotics components that can dynamically reconfigure themselves to adapt their behaviour to a task. We present the design of our basic component, called atom, and the underlying functionalities. We show how these interconnected components may be controlled using a(More)
— One of the most challenging tasks in specification engineering for a multi-agent robotic system is to formally specify and architect the system, especially as a multi-agent robotic system is concurrent having concurrent processing, and often having dynamic environment. The formal requirement and architecture specifications along with step-wise refinement(More)