February 2010 - Annonce

Séminaire Performance et Généricité du LRDE le Mercredi 3 mars 2010
by Daniela Becker 24 Feb '10

24 Feb '10

Bonjour, La prochaine session du séminaire Performance et Généricité du LRDE (Laboratoire de Recherche et Développement de l'EPITA) a lieu le Mercredi 3 mars 2010 (14h-16h) en Amphi 4, KB. Au programme : Yayi : Bibliothèque générique de traitement morphologique d’images - Raffi Enficiaud Dans cet exposé, nous présenterons Yayi, une bibliothèque générique de traitement morphologique d'image. Cette base logicielle, écrite en C++ et interfacée avec Python, fournit un nombre croissant de fonctions en traitement d'image et en morphologie mathématique (distance, segmentation, etc.). Nous discuterons de la mise en oeuvre générale, des concepts génériques utilisés dans la bibliothèque, et de leurs utilisations dans l'élaboration de nouveaux algorithmes. Enfin, nous présenterons quelques pistes actuellement en développement dans Yayi pour adresser certains des problèmes levés par la programmation générique. Raffi Enficiaud a soutenu sa thèse au Centre de Morphologie Mathématique en 2007. Pendant sa thèse, il a participé au design et au développement de Morph-M (anciennement Morphée) qui est une base logicielle orientée recherche pour le traitement d'images et la morphologie mathématique. Il s'est particulièrement intéressé à l'extension multidimensionnelle et multispectrale des algorithmes morphologiques, et a proposé de nouvelles méthodes de segmentation et d'utilisation de la couleur. Après sa thèse, il travaillé à DxO sur le thème de la quantification de défaut optique et capteur. Il travaille depuis 2008 à l'INRIA Paris-Rocquencourt, équipe-projet IMEDIA en qualité d'ingénieur expert, où il s'intéresse à l'indexation d'image ainsi qu'à la visualisation de bases de donnée multimédia. Il développe Yayi sur son temps libre. -- Daniela Becker

1 0

conférence PMMH à l'ESPCI
by Daniela Becker 24 Feb '10

24 Feb '10

Dans le cadre du séminaire du laboratoire PMMH de l'ESPCI, Olivier Ricou a donné une conférence de culture générale sur la gouvernance de l'Internet le 19 février. Les transparents sont disponibles sur www.lrde.epita.fr/~ricou/espci.pdf -- Daniela Becker

1 0

COP 2010
by Didier Verna 17 Feb '10

17 Feb '10

I'm pleased to inform you that this year again, I will be part of the COP programme committee. COP is ECOOP's Context Oriented Programming workshop. See http://soft.vub.ac.be/cop10/ -- Resistance is futile. You will be jazzimilated. Scientific site: http://www.lrde.epita.fr/~didier Music (Jazz) site: http://www.didierverna.com EPITA/LRDE, 14-16 rue Voltaire, 94276 Le Kremlin-Bicêtre, France Tel. +33 (0)1 44 08 01 85 Fax. +33 (0)1 53 14 59 22

1 0

RT 1.0 for Emacs Lisp available now
by Didier Verna 15 Feb '10

15 Feb '10

Hello, the first public version (1.0) of RT for Emacs Lisp has just been released. This is an Emacs Lisp port of the original Common Lisp regression testing package. Grab it here: http://www.lrde.epita.fr/~didier/software/xemacs.php?rt -- Resistance is futile. You will be jazzimilated. Scientific site: http://www.lrde.epita.fr/~didier Music (Jazz) site: http://www.didierverna.com EPITA/LRDE, 14-16 rue Voltaire, 94276 Le Kremlin-Bicêtre, France Tel. +33 (0)1 44 08 01 85 Fax. +33 (0)1 53 14 59 22

1 0

[CfP] 7th European Lisp Workshop, June 21/22 2010, Maribor, Slovenia
by Didier Verna 15 Feb '10

15 Feb '10

+------------------------------------------------------------+ | CALL FOR PAPERS | | 7th European Lisp Workshop | | June 21/22, Maribor, Slovenia - co-located with ECOOP 2010 | +------------------------------------------------------------+ Important Dates =============== Submission deadline: April 19, 2010 Notification of acceptance: May 05, 2010 ECOOP early registration deadline: May 10, 2010 7th European Lisp Workshop: June 21 or 22, 2010 (tbdl) Please note that registration must be done with ECOOP itself. For more information visit http://www.european-lisp-workshop.org Contact: Didier Verna, didier(a)lrde.epita.fr Invited Speaker =============== Manuel Serrano (INRIA, France) http://www-sop.inria.fr/members/Manuel.Serrano/ Overview ======== "...Please don't assume Lisp is only useful for Animation and Graphics, AI, Bio-informatics, B2B and E-Commerce, Data Mining, EDA/Semiconductor applications, Expert Systems, Finance, Intelligent Agents, Knowledge Management, Mechanical CAD, Modeling and Simulation, Natural Language, Optimization, Research, Risk Analysis, Scheduling, Telecom, and Web Authoring just because these are the only things they happened to list." -- Kent Pitman Lisp, one of the eldest computer languages still in use today, is gaining momentum again. The structure of Lisp makes it easy to extend the language or even to implement entirely new dialects without starting from scratch, making it the ideal candidate for writing Domain Specific Languages. Common Lisp, with the Common Lisp Object System (CLOS), was the first object-oriented programming language to receive an ANSI standard and remains the most complete and advanced object system of any programming language, while influencing many other object-oriented programming languages that followed. This workshop will address the near-future role of Lisp-based languages in research, industry and education. We solicit contributions that discuss the opportunities Lisp provides to capture and enhance the possibilities in software engineering. We want to promote lively discussion between researchers proposing new approaches and practitioners reporting on their experience with the strengths and limitations of current Lisp technologies. The workshop will have two components: there will be formal talks, and interactive turorial/demo/coding sessions. Papers ====== Formal presentations in the workshop should take between 20 minutes and half an hour; additional time will be given for questions and answers. Suggested topics include (but are not limited to): - Context-, aspect-, domain-oriented and generative programming - Macro-, reflective-, meta- and/or rule-based development approaches - Protocol meta-programming and libraries - New language features and abstractions - Software evolution - Development aids - Persistent systems - Dynamic optimization - Implementation techniques - Hardware Support - Efficiency, distribution and parallel programming - Educational approaches and perspectives - Experience reports and case studies Interactive Tutorial/Demo/Coding Sessions ========================================= Additionally, we invite less formal talks in the form of interactive tutorial/demo/coding sessions. The purpose of these sessions is both to demonstrate and receive feedback on any interesting Lisp system, either stable or under development. Being less formal than technical paper presentations, these sessions are expected to be highly interactive. Submission Guidelines ===================== Potential contributors are encouraged to submit: - a long paper (around 10 pages) presenting scientific and/or empirical results about Lisp-based uses or new approaches for software engineering purposes, - a short essay (5 pages) defending a position about where research, practice or education based on Lisp should be heading in the near future, - a proposal for an interactive tutorial/demo/coding session (1-2 pages) describing the involved library or application, and the subject of the session. Papers (both long and short) should be formatted following the ACM SIGS guidelines and include ACM classification categories and terms (see below). Authors will later be required to sign an ACM copyright form, as the workshop proceedings will be published in the ACM Digital Library. For more information on the submission guidelines and the ACM keywords, see: http://www.acm.org/sigs/publications/proceedings-templates http://www.acm.org/about/class/1998 Submissions should be uploaded to Easy Chair, at the following address: http://www.easychair.org/conferences/?conf=elw2010 Organizers ========== Didier Verna, EPITA Research and Development Laboratory, Paris Charlotte Herzeel, Programming Technology Lab, Vrije Universiteit, Brussel Robert Strandh, LaBRI, University of Bordeaux 1, France Christophe Rhodes, Goldsmiths College, University of London -- Resistance is futile. You will be jazzimilated. Scientific site: http://www.lrde.epita.fr/~didier Music (Jazz) site: http://www.didierverna.com EPITA/LRDE, 14-16 rue Voltaire, 94276 Le Kremlin-Bicêtre, France Tel. +33 (0)1 44 08 01 85 Fax. +33 (0)1 53 14 59 22

1 0

Spot 0.5 has been released
by Alexandre Duret-Lutz 01 Feb '10

01 Feb '10

We're pleased to announce the release of Spot 0.5. Spot is a model-checking library developed collaboratively by LRDE and LIP6. It provides algorithms and data structures to implement the automata-theoretic approach to LTL model checking. This release includes more than two year of work, with contributions from Damien Lefortier, Guillaume Sadegh, Félix Abecassis, and Alexandre Duret-Lutz. We would also like to thank Akim Demaille, Denis Poitrenaud, and Kristin Y. Rozier for their bug reports and help. You can find the new release here: http://spot.lip6.fr/dl/spot-0.5.tar.gz Before listing what is new in this release, let me mention that we have setup two mailing lists so you can stay informed, or discuss spot: - <spot-announce(a)lrde.epita.fr> is read-only and will be used to announce new releases. You may subscribe at https://www.lrde.epita.fr/mailman/listinfo/spot-announce - <spot(a)lrde.epita.fr> can be used to discuss anything related to Spot. You may subscribe at https://www.lrde.epita.fr/mailman/listinfo/spot-announce What is new in spot 0.5 (2010-02-01): * Two new LTL translations have been implemented: - eltl_to_tgba_lacim() is a symbolic translation for ELTL based on Couvreur's LaCIM'00 paper. For this translation (available with ltl2tgba's option -le), all operators are described as finite automata. A default set of operators is provided for LTL (option -lo) and user may add more automaton operators. - ltl_to_taa() is a translation based on Tauriainen's PhD thesis. LTL is translated to "self-loop" alternating automata and then to Transition-based Generalized Automata. (ltl2tgba's option -taa). The "Couvreur/FM" translation remains the best LTL translation available in Spot. * The data structures used to represent LTL formulae have been overhauled, and it resulted in a big performence improvement (in time and memory consumption) for the LTL translation. * Two complementation algorithms for state-based Büchi automata have been implemented: - tgba_kv_complement is an on-the-fly implementation of the Kupferman-Vardi construction (TCS'05) for generalized acceptance conditions. - tgba_safra_complement is an implementation of Safra's complementation. This algorithm takes a degeneralized Büchi automaton as input, but our implementation for the Streett->Büchi step will produce a generalized automaton in the end. * ltl2tgba has gained several options and the help text has been reorganized. Please run src/tgbatest/ltl2tgba without arguments for details. Couvreur/FM is now the default translation. * The ltl2tgba.py CGI script can now run standalone. It also offers the Tauriainen/TAA translation, and some options for SCC-based reductions. * Automata using BDD-encoded transitions relation can now be pruned for useless states symbolically using the delete_unaccepting_scc() function. This is ltl2tgba's -R3b option. * The SCC-based simplification (ltl2tgba's -R3 option) has been rewritten and improved. * The "*" symbol, previously parsed as a synonym for "&" is no longer recognized. This makes room for an upcoming support of rational operators. * More benchmarks in the bench/ directory: - gspn-ssp/ some benchmarks published at ACSD'07, - ltlcounter/ translation of a class of LTL formulae used by Rozier & Vardi at SPIN'07 - scc-stats/ SCC statistics after translation of LTL formulae - split-product/ parallelizing gain after splitting LTL automata * An experimental Kripke interface has been developed to simplify the integration of third party tools that do not use acceptance conditions and that have label on states instead of transitions. This interface has not been used yet. * Experimental interface with the Nips virtual machine. It is not very useful as Spot isn't able to retrieve any property information from the model. This will just check assertions. * Distribution: - The Boost C++ library is now required. - Update to Autoconf 2.65, Automake 1.11.1, Libtool 2.2.6b, Bison 2.4.1, and Swig 1.3.40. - Thanks to the newest Automake, "make check" will now run in parallel if you use "make -j2 check" or more. * Bug fixes: - Disable warnings from the garbage collection of BuDDy, it could break the standard output of ltl2tgba. - Fix several C++ constructs to ensure Spot will build with GCC 4.3, 4.4, and older 3.x releases, as well as with Intel's ICC compiler. - A very old bug in the hash function for LTL formulae caused Spot to sometimes (but very rarely) consider two different LTL formulae as equal. -- Alexandre Duret-Lutz -- Alexandre Duret-Lutz

1 0