plateau.bib
@comment{{This file has been generated by bib2bib 1.98}}
@comment{{Command line: /usr/bin/bib2bib -q -oc plateau.cite -ob plateau.bib -c 'author : "plateau"' ../../biblio/abbrevs.bib ../../biblio/demons.bib ../../biblio/demons2.bib ../../biblio/demons3.bib ../../biblio/team.bib ../../biblio/crossrefs.bib}}
@inproceedings{MandelPlateau09_HFL,
address = {York, UK},
author = {Albert Cohen and Louis Mandel and Florence Plateau and Marc Pouzet},
booktitle = {Hardware Design using Functional languages (HFL 09)},
month = mar,
title = {Relaxing Synchronous Composition with Clock Abstraction},
year = {2009},
pages = {35-52},
x-international-audience = {yes},
x-proceedings = {yes},
topics = {team},
x-support = {actes_aux},
x-equipes = {demons PROVAL alchemy},
x-type = {article},
type_publi = {icolcomlec}
}
@inproceedings{MandelPlateauPouzet-DCC-10,
author = {Louis Mandel and Florence Plateau and Marc Pouzet},
title = {Clock Typing of n-Synchronous Programs},
booktitle = {Designing Correct Circuits ({DCC 2010})},
year = 2010,
month = mar,
address = {Paphos, Cyprus},
topics = {team},
x-equipes = {demons PROVAL},
x-support = {actes_aux},
x-cle-support = {DCCircuits},
x-type = {article},
x-international-audience = {yes},
x-proceedings = {yes},
x-editorial-board = {yes}
}
@inproceedings{Pouzet08c,
author = {Albert Cohen and Louis Mandel and Florence Plateau and
Marc Pouzet},
title = {{Abstraction of Clocks in Synchronous Data-flow Systems}},
booktitle = {The Sixth ASIAN Symposium on Programming Languages and Systems
(APLAS)},
abstract = { Synchronous data-flow languages such as Lustre manage infinite
sequences or streams as basic values. Each stream is
associated to a clock which defines the instants where the
current value of the stream is present. This clock is a type
information and a dedicated type system --- the so-called
clock-calculus --- statically rejects programs which cannot be
executed synchronously. In existing synchronous languages, it
amounts at asking whether two streams have the same clocks and thus
relies on clock equality only. Recent works have shown the interest
of introducing some relaxed notion of synchrony, where two streams can
be composed as soon as they can be synchronized through the
introduction of a finite buffer (as done in the SDF model of Edward
Lee). This technically consists in replacing typing by
subtyping. The present paper introduces a simple way to achieve
this relaxed model through the use of clock
envelopes. These clock envelopes are sets of concrete clocks which
are not necessarily periodic. This allows to model various features
in real-time embedded software such as bounded jitter as found in
video-systems, execution time of real-time processes and
scheduling resources or the communication through buffers. We
present the algebra of clock envelopes and its main theoretical
properties.},
x-pdf = {http://www.lri.fr/~plateau/papers/aplas08.pdf},
url = {http://www.lri.fr/~plateau/papers/aplas08.pdf},
year = 2008,
month = dec,
date = {9--11},
series = {Lecture Notes in Computer Science},
volume = {5356},
pages = {237--254},
address = {Bangalore, India},
type_publi = {icolcomlec},
x-equipes = {demons PROVAL EXT},
x-type = {article},
x-support = {actes},
x-cle-support = {APLAS},
x-editorial-board = {yes},
x-international-audience = {yes},
x-proceedings = {yes},
topics = {team}
}
@inproceedings{MandelPlateau2008SLAP,
author = {Louis Mandel and Florence Plateau},
title = {Interactive Programming of Reactive Systems},
booktitle = {Proceedings of Model-driven High-level Programming of Embedded Systems ({SLA++P'08})},
year = 2008,
month = apr,
address = {Budapest, Hungary},
pages = {44--59},
x-pdf = {http://www.lri.fr/~mandel/papers/MandelPlateau-SLAP-2008.pdf},
url = {http://www.lri.fr/~mandel/papers/MandelPlateau-SLAP-2008.pdf},
topics = {team},
type_publi = {icolcomlec},
series = {Electronic Notes in Computer Science},
publisher = {Elsevier Science Publishers},
x-equipes = {demons PROVAL},
x-type = {article},
x-support = {actes_aux},
x-cle-support = {ENTCS},
x-editorial-board = {yes},
x-international-audience = {yes},
x-proceedings = {yes}
}
@inproceedings{cohen05emsoft,
crossref = {pouzet05emsoft}
}
@inproceedings{pouzet05emsoft,
author = {Albert Cohen and Marc Duranton and Christine Eisenbeis
and Claire Pagetti and Florence Plateau and Marc Pouzet},
title = {Synchronizing Periodic Clocks},
booktitle = {ACM International Conference on
Embedded Software (EMSOFT'05)},
address = {Jersey city, New Jersey, USA},
month = sep,
topics = {team},
type_publi = {icolcomlec},
x-equipes = {demons PROVAL EXT},
x-type = {article},
x-support = {actes},
x-cle-support = {EMSOFT},
year = 2005
}
@inproceedings{cohen06popl,
crossref = {pouzet06popl}
}
@inproceedings{pouzet06popl,
author = {Albert Cohen and Marc Duranton and Christine Eisenbeis
and Claire Pagetti and Florence Plateau and Marc Pouzet},
title = {{N-Synchronous Kahn Networks: a Relaxed Model of Synchrony for Real-Time Systems}},
booktitle = {ACM International Conference on
Principles of Programming Languages (POPL'06)},
address = {Charleston, South Carolina, USA},
month = {January},
topics = {team},
x-equipes = {demons PROVAL EXT},
x-type = {article},
x-support = {actes},
x-cle-support = {POPL},
year = 2006
}
@inproceedings{mandel-plateau09jfla,
author = {Louis Mandel and Florence Plateau},
title = {{Abstraction d'horloges dans les syst\`emes synchrones flot de donn\'ees}},
url = {http://www.lri.fr/~plateau/papers/jfla09.pdf},
abstract = {Les langages synchrones flot de donn\'ees tels que
Lustre manipulent des s\'equences infinies de
donn\'ees comme valeurs de base. Chaque flot est
associ\'e \`a une horloge qui d\'efinit les instants
o\`u sa valeur est pr\'esente. Cette horloge est une
information de type et un syst\`eme de types
d\'edi\'e, le calcul d'horloges, rejette
statiquement les programmes qui ne peuvent pas \^etre
ex\'ecut\'es de mani\`ere synchrone. Dans les
langages synchrones existants, cela revient \`a se
demander si deux flots ont la m\^eme horloge et repose
donc uniquement sur l'\'egalit\'e d'horloges. Des
travaux r\'ecents ont montr\'e l'int\'er\^et
d'introduire une notion rel\^ach\'ee du synchronisme,
o\`u deux flots peuvent \^etre compos\'es d\`es qu'ils
peuvent \^etre synchronis\'es par l'introduction d'un
buffer de taille born\'ee (comme c'est fait dans le
mod\`ele SDF d'Edward Lee). Techniquement, cela
consiste \`a remplacer le typage par du
sous-typage. Ce papier est une traduction et
am\'elioration technique de~\cite{Pouzet08c} qui pr\'esente
un moyen simple de mettre en oeuvre ce mod\`ele
rel\^ach\'e par l'utilisation d'horloges abstraites.
Les valeurs abstraites repr\'esentent des ensembles
d'horloges concr\`etes qui ne sont pas
n\'ecessairement p\'eriodiques. Cela permet de
mod\'eliser divers aspects des logiciels
temps-r\'eel embarqu\'es, tels que la gigue born\'ee
pr\'esente dans les syst\`emes vid\'eo, le temps
d'ex\'ecution des processus temps r\'eel et, plus
g\'en\'eralement, la communication \`a travers des
buffers de taille born\'ee. Nous pr\'esentons ici
l'alg\`ebre des horloges abstraites et leurs
principales propri\'et\'es th\'eoriques.},
topics = {team, lri},
type_publi = {colcomlec},
x-equipes = {demons PROVAL},
x-type = {article},
x-support = {actes_aux},
x-cle-support = {JFLA},
crossref = {jfla09}
}
@inproceedings{MandelPlateauPouzet-MLworkshop-2009,
author = {Louis Mandel and Florence Plateau and Marc Pouzet},
title = {The {ReactiveML} Toplevel (Tool Demonstration)},
booktitle = {ACM SIGPLAN Workshop on ML},
address = {Edinburgh, Scotland, UK},
topics = {team, lri},
type_publi = {icolcomlec},
month = aug,
year = 2009,
x-type = {article},
x-support = {actes_aux},
x-equipes = {demons PROVAL},
x-cle-support = {ML},
x-international-audience = {yes},
x-proceedings = {no},
x-editorial-board = {yes}
}
@inproceedings{MandelPlateau10jfla,
author = {Louis Mandel and Florence Plateau and Marc Pouzet},
title = {{Lucy-n}~: une extension n-synchrone de {Lustre}},
url = {http://www.lri.fr/~mandel/papiers/MandelPlateau-JFLA-2010.pdf},
abstract = {Les langages synchrones flot de donn\'ees permettent de programmer
des r\'eseaux de processus communicant sans buffers.
Pour cela, chaque
flot est associ\'e \`a un type d'horloges, qui indique les instants de
pr\'esence de valeurs sur le flot. La communication entre deux
processus \verb+f+ et \verb+g+ peut \^etre faite sans buffer si le
type du flot de sortie de \verb+f+ est \'egal au type du flot d'entr\'ee
de~\verb+g+.
Un syst\`eme de type, le calcul d'horloge, inf\`ere des types tels que
cette condition est v\'erifi\'ee.
Le mod\`ele n-synchrone a pour but de rel\^acher ce mod\`ele de
programmation en autorisant les communications \`a travers des buffers
de taille born\'ee. En pratique, cela consiste \`a introduire une
r\`egle de sous-typage dans le calcul d'horloge.
Nous avons pr\'esent\'e l'ann\'ee derni\`ere un article d\'ecrivant comment
abstraire des horloges pour v\'erifier la relation de
sous-typage. Cette ann\'ee, nous pr\'esentons un langage de
programmation n-synchrone~: Lucy-n. Dans ce langage, l'inf\'erence
des types d'horloges est param\'etrable par l'algorithme de r\'esolution
des contraintes de sous-typage. Nous montrons ici un algorithme
bas\'e sur les travaux de
l'an dernier et comment programmer en Lucy-n \`a travers l'exemple
d'une application de traitement multim\'edia.},
topics = {team, lri},
type_publi = {colcomlec},
x-equipes = {demons PROVAL},
x-type = {article},
x-support = {actes_aux},
x-cle-support = {JFLA},
crossref = {jfla10}
}
@inproceedings{MandelPlateau10gpl,
author = {Louis Mandel and Florence Plateau and Marc Pouzet},
title = {{Lucy-n~:} une extension n-synchrone de {Lustre}},
booktitle = {{Journ\'ees nationales du GDR-GPL}},
year = {2010},
editor = {\'Eric Cariou and Laurence Duchien and Yves Ledru},
address = {{Pau, France}},
month = mar,
organization = {{GDR GPL}},
topics = {team},
x-equipes = {demons PROVAL},
x-support = {actes_aux},
x-cle-support = {JGDRGPL},
x-type = {article},
annote = {Invited, selected paper}
}
@inproceedings{MandelPlateauPouzet-MPC-2010,
author = {Louis Mandel and Florence Plateau and Marc Pouzet},
title = {{Lucy-n}: a n-Synchronous Extension of {Lustre}},
booktitle = {Tenth International Conference on Mathematics of Program Construction ({MPC 2010})},
year = 2010,
month = jun,
address = {Qu{\'e}bec, Canada},
url = {http://www.lri.fr/~mandel/papiers/MandelPlateauPouzet-MPC-10.pdf},
abstract = {Synchronous functional languages such as Lustre
or Lucid Synchrone define a
restricted class of Kahn Process Networks which can be executed with
no buffer.
Every expression is associated to a clock indicating the instants
when a value is present. A dedicated type system, the clock
calculus, checks that the actual clock of a stream equals its
expected clock and thus does not need to be buffered.
The n-synchrony relaxes synchrony by allowing the
communication through bounded buffers whose size is computed at
compile-time.
It is obtained by extending the clock calculus with
a subtyping rule which defines buffering points.
This paper presents the first implementation of the n-synchronous
model inside a Lustre-like language called Lucy-n. The language
extends Lustre with an explicit \verb-buffer- construct whose size
is automatically computed during the clock calculus.
This clock calculus is defined as an inference type system and is
parametrized by the clock language and the algorithm used to solve
subtyping constraints. We detail here one algorithm based on the
abstraction of clocks, an idea originally introduced
in~\cite{Pouzet08c}. The paper presents a simpler, yet more
precise, clock abstraction for which the main algebraic properties have
been proved in Coq. Finally, we illustrate the language on various
examples including a video application.},
topics = {team},
x-equipes = {demons PROVAL},
x-type = {article},
x-support = {actes},
x-cle-support = {MPC},
x-international-audience = {yes},
x-proceedings = {yes}
}
@inproceedings{MandelPlateau-MPC-2012,
author = {Louis Mandel and Florence Plateau},
title = {Scheduling and Buffer Sizing of n-Synchronous Systems:
Typing of Ultimately Periodic Clocks in {Lucy-n}},
booktitle = {Eleventh International Conference on Mathematics of Program Construction ({MPC'12})},
year = 2012,
month = jun,
address = {Madrid, Spain},
url = {http://www.lri.fr/~mandel/papiers/MandelPlateau-MPC-2012.pdf},
abstract = {Lucy-n is a language for programming networks of processes
communicating through bounded buffers. A dedicated type
system, termed a clock calculus, automatically computes static
schedules of the processes and the sizes of the buffers between
them.
In this article, we present a new algorithm which solves the
subtyping constraints generated by the clock calculus. The
advantage of this algorithm is that it finds schedules for tightly
coupled systems. Moreover, it does not overestimate the buffer
sizes needed and it provides a way
to favor either system throughput or buffer size minimization.},
topics = {team},
x-equipes = {demons PROVAL},
x-type = {article},
x-support = {actes},
x-cle-support = {MPC},
x-international-audience = {yes},
x-proceedings = {yes}
}
@inproceedings{MandelPlateau11jfla,
author = {Louis Mandel and Florence Plateau},
title = {Typage des horloges p{\'e}riodiques en {Lucy-n}},
url = {http://www.lri.fr/~mandel/papiers/MandelPlateau-JFLA-2011.pdf},
abstract = {Lucy-n est un langage permettant de programmer des r{\'e}seaux de
processus communiquant {\`a} travers des buffers de taille
born{\'e}e. La taille des buffers et les rythmes d'ex{\'e}cution relatifs
des processus sont calcul{\'e}s par une phase de typage appel{\'e}e calcul
d'horloge. Ce typage n{\'e}cessite la r{\'e}solution d'un ensemble de
contraintes de sous-typage. L'an dernier, nous avons propos{\'e} un
algorithme de r{\'e}solution de ces contraintes utilisant des m{\'e}thodes
issues de l'interpr{\'e}tation abstraite. Cette ann{\'e}e nous pr{\'e}sentons
un algorithme tirant profit de toute l'information contenue dans les
types.},
topics = {team},
type_publi = {colcomlec},
x-equipes = {demons PROVAL},
x-type = {article},
x-support = {actes_aux},
x-cle-support = {JFLA},
crossref = {jfla11}
}
@phdthesis{plateau10these,
author = {Florence Plateau},
title = {Mod{\`e}le n-synchrone pour la programmation de r{\'e}seaux de {Kahn} {\`a} m{\'e}moire born{\'e}e},
school = {Universit{\'e} Paris-Sud},
x-equipes = {demons PROVAL},
x-support = {rapport},
x-type = {these},
topics = {team},
type = {Th{\`e}se de Doctorat},
year = 2010
}
@inproceedings{mandel11fmcad,
author = {Louis Mandel and Florence Plateau and Marc Pouzet},
title = {Static Scheduling of Latency Insensitive Designs with {Lucy-n}},
booktitle = {Formal Methods in Computer Aided Design ({FMCAD 2011})},
year = 2011,
month = oct,
address = {Austin, TX, USA},
hal = {http://hal.inria.fr/hal-00654843},
url = {http://www.lri.fr/~mandel/papiers/MandelPlateauPouzet-FMCAD-2011.pdf},
webpage = {http://www.lri.fr/~mandel/lucy-n/fmcad11/},
abstract = {Lucy-n is a dataflow programming language similar to Lustre
extended with a buffer operator. This language is based on the
n-synchronous model which was initially introduced for programming
multimedia streaming applications. In this article, we show that
Lucy-n is also applicable to model Latency Insensitive
Designs~(LID). In order to model relay stations, we have to
introduce a delay operator. Thanks to this new operator, a LID can be
described by a Lucy-n program. Then, the Lucy-n compiler
automatically provides static schedules for computation nodes and
buffer sizes needed in the shell wrappers.},
topics = {team},
x-teams = {demons PROVAL},
x-type = {article},
x-support = {actes},
x-cle-support = {FMCAD},
x-international-audience = {yes},
x-proceedings = {yes}
}
@proceedings{jfla09,
title = {Journ\'ees Francophones des Langages Applicatifs},
year = 2009,
booktitle = {Vingti\`emes Journ\'ees Francophones des Langages Applicatifs},
month = jan,
address = {Saint-Quentin sur Is\`ere},
publisher = {INRIA},
x-international-audience = {no},
x-editorial-board = {yes},
x-proceedings = {yes}
}
@proceedings{jfla10,
title = {Journ\'ees Francophones des Langages Applicatifs},
year = 2010,
booktitle = {Vingt-et-uni\`emes Journ\'ees Francophones des Langages Applicatifs},
month = jan,
address = {Vieux-Port La Ciotat, France},
publisher = {INRIA},
x-international-audience = {no},
x-editorial-board = {yes},
x-proceedings = {yes}
}
@proceedings{jfla11,
title = {Journ\'ees Francophones des Langages Applicatifs},
editor = {Sylvain Conchon},
year = 2011,
booktitle = {Vingt-deuxi\`emes Journ\'ees Francophones des Langages Applicatifs},
month = jan,
address = {La Bresse, France},
publisher = {INRIA},
x-international-audience = {no},
x-editorial-board = {yes},
x-proceedings = {yes}
}