Chers collègues,
La prochaine session du séminaire Performance et Généricité du LRDE
(Laboratoire de Recherche et Développement de l'EPITA) aura lieu le
Mercredi 18 février 2015 (11h00--12h30), Salle L0 du LRDE.
Vous trouverez sur le site du séminaire [1] les prochaines séances,
les résumés, captations vidéos et planches des exposés précédents [2],
le détail de cette séance [3] ainsi que le plan d'accès [4].
[1] http://seminaire.lrde.epita.fr
[2] http://seminaire.lrde.epita.fr/Archives
[3] http://seminaire.lrde.epita.fr/2015-02-18
[4] http://www.lrde.epita.fr/Contact
Au programme du Mercredi 18 février 2015 :
* 11h: Faveod, meta-modèle au service de la qualité logicielle
-- Yann Azoury, Faveod
www.faveod.com
L’accroissement exponentiel de la complexité technique des logiciels
métiers a du mal à être compensée par les progrès du génie logiciel :
les coûts et les délais augmentent jusqu’à ce que l’intérêt de
l’informatique soit fondamentalement remis en cause dans certains cas,
arguments rationnels et légitimes à l’appui. Cette anomalie
épistémologique s’explique pourtant par des erreurs technologiques
récurrentes dans l’histoire, des pièges et des culs-de-sac ralentissant
le progrès scientifique. Parmi ces freins : la dette technique,
l’utilisation de trop de technologies, trop élitistes pour être
correctement utilisées en général, et le niveau maximal de compréhension
et d’analyse de chaque humain, qui est fortement variable mais toujours
plafonné.
La technologie Faveod sert à éviter ces freins par la formalisation
structurée et factorisée des besoins métiers, applicatifs et techniques
dans un modèle générique et exhaustif. L’analyse continue des évolutions
collaboratives de ce modèle permet la production totalement automatisée
et instantanée de sa traduction technique : l’application cible en
cohérence et en qualité. La gestion de la complexité des facteurs
influant sur la qualité logicielle étant déléguée à la technologie, il
devient possible d’augmenter son niveau par accumulation linéaire sans
dépendre des facteurs humains limitants.
-- Yann Azoury, EPITA SIGL 2006, a toujours travaillé pour des éditeurs de
logiciels en France et aux Etats-Unis. En 2002, sa participation au
projet de portage d’OpenOffice pour Mac OS X pour le compte d’Apple lui
permet d'atteindre ses propres limites d’analyse et donc de comprendre
la nécessité de les dépasser par des outils. Ainsi, en 2005, il crée le
projet Faveod pour ce faire et fonde la société éponyme en 2007 pour
diffuser cette technologie.
L'entrée du séminaire est libre. Merci de bien vouloir diffuser cette
information le plus largement possible. N'hésitez pas à nous faire
parvenir vos suggestions d’orateurs.
--
Akim Demaille
Akim.Demaille(a)lrde.epita.fr
_______________________________________________
Seminaire mailing list
Seminaire(a)lrde.epita.fr
https://lists.lrde.epita.fr/listinfo/seminaire
ELS'15 - 8th European Lisp Symposium
Goldsmiths College, London, UK
April 20-21, 2015
http://www.european-lisp-symposium.org/
Sponsored by EPITA, Franz Inc. and Lispworks Ltd.
Recent news:
- Submission deadline in less than a month now!
- Programme committee has been announced (see below)
- Venue information now available on the web site
The purpose of the European Lisp Symposium is to provide a forum for
the discussion and dissemination of all aspects of design,
implementation and application of any of the Lisp and Lisp-inspired
dialects, including Common Lisp, Scheme, Emacs Lisp, AutoLisp, ISLISP,
Dylan, Clojure, ACL2, ECMAScript, Racket, SKILL, Hop and so on. We
encourage everyone interested in Lisp to participate.
The 8th European Lisp Symposium invites high quality papers about
novel research results, insights and lessons learned from practical
applications and educational perspectives. We also encourage
submissions about known ideas as long as they are presented in a new
setting and/or in a highly elegant way.
Topics include but are not limited to:
- Context-, aspect-, domain-oriented and generative programming
- Macro-, reflective-, meta- and/or rule-based development approaches
- Language design and implementation
- Language integration, inter-operation and deployment
- Development methodologies, support and environments
- Educational approaches and perspectives
- Experience reports and case studies
We invite submissions in the following forms:
Papers: Technical papers of up to 8 pages that describe original
results or explain known ideas in new and elegant ways.
Demonstrations: Abstracts of up to 2 pages for demonstrations of
tools, libraries, and applications.
Tutorials: Abstracts of up to 4 pages for in-depth presentations
about topics of special interest for at least 90 minutes and up to
180 minutes.
The symposium will also provide slots for lightning talks, to be
registered on-site every day.
All submissions should be formatted following the ACM SIGS guidelines
and include ACM classification categories and terms. For more
information on the submission guidelines and the ACM keywords, see:
http://www.acm.org/sigs/publications/proceedings-templates and
http://www.acm.org/about/class/1998.
Important dates:
- 22 Feb 2015: Submission deadline
- 15 Mar 2015: Notification of acceptance
- 29 Mar 2015: Early registration deadline
- 05 Apr 2015: Final papers
- 20-21 Apr 2015: Symposium
Programme chair:
Julian Padget, University of Bath, UK
Local chair:
Christophe Rhodes, Goldsmiths, University of London, UK
Programme committee:
Sacha Chua — Toronto, Canada
Edmund Weitz — University of Applied Scicences, Hamburg, Germany
Rainer Joswig — Hamburg, Germany
Henry Lieberman — MIT, USA
Matthew Flatt — University of Utah, USA
Christian Queinnec — University Pierre et Marie Curie, Paris 6, France
Giuseppe Attardi — University of Pisa, Italy
Marc Feeley — University of Montreal, Canada
Stephen Eglen — University of Cambridge, UK
Robert Strandh — University of Bordeaux, France
Nick Levine — RavenPack, Spain
Search Keywords:
#els2015, ELS 2015, ELS '15, European Lisp Symposium 2015,
European Lisp Symposium '15, 8th ELS, 8th European Lisp Symposium,
European Lisp Conference 2015, European Lisp Conference '15
--
My new Jazz CD entitled "Roots and Leaves" is out!
Check it out: http://didierverna.com/records/roots-and-leaves.php
Lisp, Jazz, Aïkido: http://www.didierverna.info
J’ai le plaisir de vous annoncer que le papier suivant a été accepté pour publication dans la 30e édition de SAC (ACM/SIGAPP Symposium On Applied Computing) :
D. Khelladi (1), R. Bendraou (1), S. Baarir (2), Y. Laurent (1), M.‑P. Gervais (1) : A Framework to Formally Verify Conformance of a Software Process to a Software Method <https://publications.lip6.fr/index.php/publications/show/11054> ».
(1) Sorbonne Universités, UPMC Univ. Paris 06, France,
CNRS UMR 7606, LIP6, F-75005 Paris, France
(2) LRDE, EPITA, Kremlin-Bicêtre, France
ABSTRACT
The increasing complexity of development projects requires methodological frameworks or methods to support development processes. A method comes with a set of best practices that are enforced and instantiated into processes to drive the realization steps of the development projects. However, those best practices come in the form of text in guides and books, or they are in the developer’s mind. Thus, during an instantiation of a method, there is no guaranty to enforce its best practices into the process, which could impact negatively the criteria: cost, time, and quality. To cope with this issue, we propose a library of constraints to be checked for four popular methods: Unified Process, Extreme Programming, Scrum and Kanban. It represents a set of best practices of these four methods that must be enforced during the instantiation. On top of this library we have built up a template-based constraint language, and implemented it to express additional constraints on processes that are modeled with UML Activity Diagrams (AD). To apply formal verification we leverage on our formalization of the way UML AD operates based on fUML semantics. The evaluation showed the feasibility of our approach as well as the feasibility to check constraints of different dimensions, i.e. time, resource, control-flow, and data-flow.
We are pleased to announce that the following paper has been accepted in the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Find the title and abstract below.
Title and corresponding authors:
Parallel Explicit Model Checking for Generalized Büchi Automata
Etienne Renault(1,2,3), Alexandre Duret-Lutz(1), Fabrice Kordon(2,3) and Denis Poitrenaud(3,4)
(1) LRDE, EPITA, Kremlin-Bicêtre, France
(2) Sorbonne Universités, UPMC Univ. Paris 06, France
(3) CNRS UMR 7606, LIP6, F-75005 Paris, France
(4) Université Paris Descartes, Paris, France
Abstract:
We present new parallel emptiness checks for LTL model checking. Unlike existing parallel emptiness checks, these are based on
an SCC enumeration, support generalized Büchi acceptance, and require no synchronization points nor repair procedures. A salient feature of our algorithms is the use of a global union-find data structure in which multiple threads share structural information about the automaton being checked. Our prototype implementation has encouraging performances: the new emptiness checks have better speedup than existing algorithms in half of our experiments.
Hello,
I'm pleased to announce that I will hold a 90 minutes session at the
next ACCU conference, Bristol, April 2015. The abstract follows:
Referential transparency is overrated
The expression "referential transparency" itself is already
confusing and subject to interpretation, according to whether you're
in the context of natural, functional or imperative languages. In
any of those contexts however, referential transparency is generally
regarded as a Good Thing(tm). In computer science for example, it
helps to reason about programs, prove them, optimize them, and even
enables some paradigms such as normal order (lazy) evaluation.
In this talk, we claim that referential transparency is overrated
because it also limits your expressive power. We demonstrate some
neat and tricky things that we can do only when referential
transparency is broken, and we explain the language constructs and
techniques that allow us to break it intentionally, both at the
regular and meta-programming levels. Such tools include duality of
syntax and syntax extension, mixing of different scoping policies,
intentional variable capture and free variable injection, lexical
communication channels, anaphoric macros.
Please fasten your seat belts, as we're going to explore mostly
uncharted territory. Whether these techniques are considered
extremely powerful, extremely unsafe, or extremely bad style is a
matter of personal taste. In fact, they are probably all of that,
and much more...
--
My new Jazz CD entitled "Roots and Leaves" is out!
Check it out: http://didierverna.com/records/roots-and-leaves.php
Lisp, Jazz, Aïkido: http://www.didierverna.info
Hello,
I'm happy to report that my keynote at the last ACCU conference
(Bristol, April 2014), entitled "Biological Realms in Computer Science",
has been filmed and is now online at the following address:
http://www.infoq.com/presentations/biology-computer-science
"Didier Verna keynotes on the bonds between biology and computer
science, how these bonds developed over the years, and how software
could behave like living organisms."
--
My new Jazz CD entitled "Roots and Leaves" is out!
Check it out: http://didierverna.com/records/roots-and-leaves.php
Lisp, Jazz, Aïkido: http://www.didierverna.info
Chers collègues,
La prochaine session du séminaire Performance et Généricité du LRDE
(Laboratoire de Recherche et Développement de l'EPITA) aura lieu le
Mercredi 10 décembre 2014 (11h00--12h00), Salle L0 du LRDE.
Elle intéressera sans doute tous ceux qui travaillent avec des GPUs.
Nous vous rappelons par ailleurs que la séance suivante aura lieu
le mercredi 17 décembre 2014, voir plus bas dans ce message.
L'entrée du séminaire est libre. Merci de bien vouloir diffuser cette
information le plus largement possible. N'hésitez pas à nous faire
parvenir vos suggestions d'orateurs.
Au programme du Mercredi 10 décembre 2014 :
* 11h: Une nouvelle approche pour la gestion de la mémoire avec CUDA
-- Raphaël Boissel, EPITA, CSI
https://developer.nvidia.com/cuda-toolkit
Dans de nombreux domaines, de plus en plus de personnes cherchent à
améliorer les performances de leurs programmes en faisant appel à une
technique appelée le GPGPU: un ensemble d’outils et de techniques
permettant d’utiliser le GPU d’une machine afin de lui déléguer d'autres
calculs que les traditionnelles routines de dessins. Cependant, écrire
un programme qui exploite à la fois le GPU et le CPU n’est pas une tâche
facile. Même lorsque les algorithmes se prêtent bien à la programmation
GPU il arrive que le gain en performance soit décevant. L’un des
principaux problèmes reste la gestion de la mémoire et surtout du
transfert de données entre le GPU et le CPU. En effet l'optimisation les
temps de transfert est délicate et peut nécessiter plusieurs jours
d’analyse et de réécriture pour obtenir de bonnes performances.
CUDA offre de nouveaux outils pour résoudre ce problème. Des outils de
profilage de code permettent de voir où se situe les problèmes de
transfert. UVM (Unified Virtual Memory), le nouveau modèle de gestion de
la mémoire, permet de tirer pleinement parti de CUDA bien plus
facilement que par le passé.
C’est à l’utilisation de ces nouvelles techniques que nous nous
intéressons dans cette présentation.
-- Étudiant au LRDE dans la majeure CSI (Calcul Scientifique et Image),
Raphaël a fait son stage de fin d’étude chez NVidia, dans l’équipe CUDA
driver. Il travaillait au sein de l'équipe sur UVM sur l’implémentation
de nouvelles fonctionnalités pour ce nouveau modèle de gestion de la
mémoire.
Au programme du Mercredi 17 décembre 2014 :
* 11h: D’un MOOC à l'autre
-- Christian Queinnec, UPMC, LIP6
http://lip6.fr/Christian.Queinnec/
Au printemps 2014, j'ai animé un MOOC d'initiation à l'informatique,
centré sur la programmation récursive. Bien que loin d'être massif, ce
MOOC a permis d'expérimenter ce nouveau medium ainsi que de mettre à
l'épreuve une infrastructure de correction automatisée. L'exposé portera
sur ces deux aspects et présentera également les nouveautés prévues pour
la prochaine édition de ce MOOC.
-- Lispeur depuis 1974, Unixien depuis 1984, HDR depuis 1988, et depuis
peu professeur émérite de l’UPMC. Surtout connu pour ses livres sur Lisp
et Scheme, il a récemment animé le MOOC ``Programmation Récursive'' dont
il sera question dans l’exposé.
Vous trouverez sur le site du séminaire [1] les prochaines séances,
les résumés, captations vidéos et planches des exposés précédents [2],
le détail de cette séance [3] et la suivante [3], ainsi que le plan
d'accès [5].
[1] http://seminaire.lrde.epita.fr
[2] http://seminaire.lrde.epita.fr/Archives
[3] http://seminaire.lrde.epita.fr/2014-12-10
[4] http://seminaire.lrde.epita.fr/2014-12-17
[5] http://www.lrde.epita.fr/Contact
_______________________________________________
Seminaire mailing list
Seminaire(a)lrde.epita.fr
https://lists.lrde.epita.fr/listinfo/seminaire
ELS'15 - 8th European Lisp Symposium
Goldsmiths College, London, UK
April 20-21, 2015
http://www.european-lisp-symposium.org/
Sponsored by EPITA, Franz Inc. and Lispworks Ltd.
The purpose of the European Lisp Symposium is to provide a forum for
the discussion and dissemination of all aspects of design,
implementation and application of any of the Lisp and Lisp-inspired
dialects, including Common Lisp, Scheme, Emacs Lisp, AutoLisp, ISLISP,
Dylan, Clojure, ACL2, ECMAScript, Racket, SKILL, Hop and so on. We
encourage everyone interested in Lisp to participate.
The 8th European Lisp Symposium invites high quality papers about
novel research results, insights and lessons learned from practical
applications and educational perspectives. We also encourage
submissions about known ideas as long as they are presented in a new
setting and/or in a highly elegant way.
Topics include but are not limited to:
- Context-, aspect-, domain-oriented and generative programming
- Macro-, reflective-, meta- and/or rule-based development approaches
- Language design and implementation
- Language integration, inter-operation and deployment
- Development methodologies, support and environments
- Educational approaches and perspectives
- Experience reports and case studies
We invite submissions in the following forms:
Papers: Technical papers of up to 8 pages that describe original
results or explain known ideas in new and elegant ways.
Demonstrations: Abstracts of up to 2 pages for demonstrations of
tools, libraries, and applications.
Tutorials: Abstracts of up to 4 pages for in-depth presentations
about topics of special interest for at least 90 minutes and up to
180 minutes.
The symposium will also provide slots for lightning talks, to be
registered on-site every day.
All submissions should be formatted following the ACM SIGS guidelines
and include ACM classification categories and terms. For more
information on the submission guidelines and the ACM keywords, see:
http://www.acm.org/sigs/publications/proceedings-templates and
http://www.acm.org/about/class/1998.
Important dates:
- 22 Feb 2015: Submission deadline
- 15 Mar 2015: Notification of acceptance
- 29 Mar 2015: Early registration deadline
- 05 Apr 2015: Final papers
- 20-21 Apr 2015: Symposium
Programme chair:
Julian Padget, University of Bath, UK
Local chair:
Christophe Rhodes, Goldsmiths, University of London, UK
Programme committee:
To be announced
Search Keywords:
#els2015, ELS 2015, ELS '15, European Lisp Symposium 2015,
European Lisp Symposium '15, 8th ELS, 8th European Lisp Symposium,
European Lisp Conference 2015, European Lisp Conference '15
--
My new Jazz CD entitled "Roots and Leaves" is out!
Check it out: http://didierverna.com/records/roots-and-leaves.php
Lisp, Jazz, Aïkido: http://www.didierverna.info
We are happy to announce that the following paper has been accepted to the
10th International Conference on Computer Vision Theory and Applications
(VISAPP)
that will take place in Berlin, on March 11 - 14, 2015:
A self-adaptive likelihood function for tracking with
particle filter
Séverine Dubuisson (1), Myriam Robert-Seidowsky (2) and Jonathan
Fabrizio (2)
(1) CNRS, UMR 7222, ISIR, F-75005, Paris, France
(2) LRDE-EPITA, 14-16, rue Voltaire, F-94276, Le Kremlin
Bicêtre, France
Abstract:
The particle filter is known to be efficient for visual
tracking. However, its parameters are empirically fixed,
depending on the target application, the video sequences
and the context. In this paper, we introduce a new
algorithm which automatically adjusts ``on-line" two majors
of them: the correction and the propagation parameters. Our
purpose is to determine, for each frame of a video, the
optimal value of the correction parameter and to adjust the
propagation one to improve the tracking performance. On one
hand, our experimental results show that the common
settings of particle filter are sub-optimal. On another
hand, we prove that our approach achieves a lower tracking
error without needing tuning these parameters. Our adaptive
method allows to track objects in complex conditions
(illumination changes, cluttered background, etc.) without
adding any computational cost compared to the common usage
with fixed parameters.
--
Myriam Robert-Seidowsky - LRDE/EPITA
We are happy to announce that the following paper has been accepted to the
10th International Conference on Computer Vision Theory and Applications
(VISAPP)
that will take place in Berlin, on March 11 - 14, 2015:
TextTrail: A Robust Text Tracking Algorithm In Wild
Environments
Myriam Robert-Seidowsky (1), Jonathan Fabrizio (1) and Séverine
Dubuisson (2)
(1) LRDE-EPITA, 14-16, rue Voltaire, F-94276, Le Kremlin
Bicêtre, France
(2) CNRS, UMR 7222, ISIR, F-75005, Paris, France
Abstract:
In this paper, we propose TextTrail, a robust new
algorithm dedicated to text tracking in uncontrolled
environments (strong motion of camera and objects, partial
occlusions, blur, etc.). It is based on a particle filter
framework whose correction step has been improved. First,
we compare some likelihood functions and introduce a new
one that integrates tangent distance. We show that the
likelihood function has a strong influence on the text
tracking performances. Secondly, we compare our tracker
with another and finally present an example of application.
TextTrail has been tested on real video sequences and has
proven its efficiency. In particular, it can track texts in
complex situations starting from only one detection step
without needing another one to reinitialize the tracking
model.
--
Myriam Robert-Seidowsky - LRDE/EPITA