Yann Le Guyadec

Learn 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)
The data-parallel programming model is now widely recognized as fundamental for high performance computing in massively parallel machines. Amazingly, much eeort has be done on designing data-parallel languages and developing compilers for them, but little attention has been paid to the precise semantic deenition of these languages, and to the formal(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)
This work inserts in the general field of collective robotics. In this paper, we present the results on the design and the conception of (1) our robotics component called Atom, (2) the informal semantics of the HoRoCoL language and two possible execution models. The expressivity of the language is illustrated on a simple example. Specific compilation(More)
In this paper we present an example of the use of the Horocol language for programming a society or teams of robots. This example shows the principal features of the Horocol language. This language has been developed to offer a solution to express the behaviours of a set of teams of robots or agents. We focus on the originality of this language which is in(More)