Annonce

annonce@lrde.epita.fr

564 discussions

Publication: ITiCSE 2008: A Set of Tools to Teach Compiler Construction

by Roland Levillain

We are happy to announce that the following paper has been accepted for publication at the 13th Annual Conference on Innovation and Technology in Computer Science Education (ITiCSE 2008) that will take place at Universidad Politécnica de Madrid, Spain, from June 30th to July 2nd, 2008. Akim Demaille, Roland Levillain and Benoît Perrot A Set of Tools to Teach Compiler Construction http://publis.lrde.epita.fr/200806-ITICSE Compiler construction is a widely used software engineering exercise, but because most students will not be compiler writers, care must be taken to make it relevant in a core curriculum. Auxiliary tools, such as generators and interpreters, often hinder the learning: students have to fight tool idiosyncrasies, mysterious errors, and other poorly educative issues. We introduce a set of tools especially designed or improved for compiler construction educative projects in C++. We also provide suggestions about new approaches to compiler construction. We draw guidelines from our experience to make tools suitable for education purposes.

17 years

Publication : ATPN'08 : Hierarchical Set Decision Diagrams and Automatic Saturation

by Daniela Becker

We are pleased to announce that the following paper has been accepted for publication at the 29th International Conference on Application and Theory of Petri Nets (ATPN'08) that will take place in Xi’an, China, June 23-27, 2008. A. Hamez and Y. Thierry-Mieg and F. Kordon. Hierarchical Set Decision Diagrams and Automatic Saturation. http://publis.lrde.epita.fr/200806-ATPN Shared decision diagram representations of a state-space have been shown to provide efficient solutions for model-checking of large systems. However, decision diagram manipulation is tricky, as the construction procedure is liable to produce intractable intermediate structures (a.k.a peak effect). The definition of the so-called saturation method has empirically been shown to mostly avoid this peak effect, and allows verification of much larger systems. However, applying this algorithm currently requires deep knowledge of the decision diagram data-structures, of the model or formalism manipulated, and a level of interaction that is not offered by the API of public DD packages. Hierarchical Set Decision Diagrams (SDD) are decision diagrams in which arcs of the structure are labeled with sets, themselves stored as SDD. This data structure offers an elegant and very efficient way of encoding structured specifications using decision diagram technology. It also offers, through the concept of inductive homomorphisms, unprecedented freedom to the user when defining the transition relation. Finally, with very limited user input, the SDD library is able to optimize evaluation of a transition relation to produce a saturation effect at runtime. We further show that using recursive folding, SDD are able to offer solutions in logarithmic complexity with respect to other DD. We conclude with some performances on well known examples. -- Daniela Becker

17 years

Séminaire Performance et Généricité du LRDE le 26 mars 2008

by Didier Verna

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 26 mars 2008, à 14h en amphi 4. Au programme: * 14h: Aspect-oriented Programming Anya Helene Bagge, Institutt for Informatikk, Universitetet i Bergen, Norway * 15h15: Context-oriented Programming with ContextL Pascal Costanza, Vrije Universiteit, Brussel, Belgium L'entrée du séminaire est libre. Pour plus de renseignements, consultez http://seminaire.lrde.epita.fr/. Merci de bien vouloir diffuser cette information le plus largement possible. -- 5th European Lisp Workshop at ECOOP 2008, July 7: http://elw.bknr.net/2008/ Didier Verna, didier(a)lrde.epita.fr, http://www.lrde.epita.fr/~didier EPITA / LRDE, 14-16 rue Voltaire Tel.+33 (0)1 44 08 01 85 94276 Le Kremlin-Bicêtre, France Fax.+33 (0)1 53 14 59 22 didier(a)xemacs.org

17 years

SCRIBO financé à hauteur de 2 millions d'euros par l'État

by Roland Levillain

Dans le cadre du 5ème appel à projets du Fonds Interministeriel de Soutien aux Projets de Recherche & Développement Collaboratifs des Pôles de Compétitivité, le projet SCRIBO [1], auquel participe le LRDE, a été soutenu par le pôle de compétitivité System@tic Paris-Région [2], et retenu pour financement par l'État. SCRIBO s'inscrit dans le nouveau Groupe Thématique Logiciel Libre de ce pôle. System@tic Paris-Région a pour objectif de faire de l'Île-de-France un territoire visible au niveau mondial sur le thème de la conception, de la réalisation et de la maîtrise des systèmes complexes. Le Groupe Thématique Logiciel Libre (GTLL) a pour vocation de traiter des sujets de R&D spécifiques au logiciel libre, de contribuer à la structuration et au développement de l'offre en la matière et d'accompagner l'organisation de l'innovation qui en est issue. SCRIBO (Semi-automatic and Collaborative Retrieval of Information Based on Ontologies) a pour but la mise au point d'algorithmes et d'outils collaboratifs pour l'extraction de connaissances à partir de textes et d'images. Il se distingue de l'état de l'art par son ambition de combiner les approches sémantiques et statistiques dans le traitement du langage naturel, par la prise en compte d'une dimension collaborative dans la définition et le paramétrage de règles d'extraction semi-automatique de structures, et par l'accent mis sur l'élaboration (ou le perfectionnement lorsqu'ils existent) de standards de traitement du langage naturel. SCRIBO a l'objectif de concevoir des services d'extraction d'ontologies (systèmes de représentation des connaissances) à partir de corpus de documents, d'extraction de structures dans des documents numériques et d'acquisition de connaissances en mettant en oeuvre des ontologies. Le LRDE contribuera principalement au sous-projet d'extraction de structures dans des documents numérisés. Les autres partenaires du projet, piloté par XPertNet, sont l'AFP, le CEA-LIST, le LRDE, l'INRIA, Mandriva, Nuxeo, Proxem, Tagmatica et Xwiki. Le LRDE a déjà été amené à travailler sur des problématiques de gestion électronique de documents (GED) et de « dématérialisation » de documents papier au cours d'une collaboration de plusieurs années avec l'éditeur de logiciels EMC Captiva (ex-SWT). Le projet SCRIBO permettra d'enrichir la bibliothèque de traitement d'images libre Olena [3] (sous licence GNU GPL) et d'intégrer de nouveaux services dans les outils de GED du LRDE. Notes : [1] SCRIBO : http://scribo.xwiki.com/ [2] System@tic Paris-Région : http://www.systematic-paris-region.org/ [3] Olena : http://olena.lrde.epita.fr -- Roland Levillain - LRDE/EPITA - A2SI/ESIEE/UMLV-Paris Est Laboratoire de Recherche et de Développement de l'EPITA (LRDE) 14-16, rue Voltaire - 94276 Le Kremlin-Bicêtre Cedex Tél. : 01 53 14 59 45 - Fax : 01 53 14 59 22 - www.lrde.epita.fr

17 years

Patcher 3.10 is released

by Didier Verna

I'm happy to announce the release of Patcher 3.10. Patcher is an XEmacs package for automating the maintenance of version control system based projects. It is the official tool for XEmacs development. What's new in this version: ** New feature: provide built-in themes for some revision control systems These are PRCS, CVS, Subversion, Darcs and Mercurial. Also coming with whitespace-resistant counterparts. ** Documentation: a chapter on how to setup Patcher for XEmacs development ** Bugfixes: *** Cleanup the log messages wrt trailing whitespaces *** Correctly display a missing theme name in error message Grab it at http://www.lrde.epita.fr/~didier/software/xemacs.php, or use the standard xemacs-devel package with XEmacs. -- 5th European Lisp Workshop at ECOOP 2008, July 7: http://elw.bknr.net/2008/ Didier Verna, didier(a)lrde.epita.fr, http://www.lrde.epita.fr/~didier EPITA / LRDE, 14-16 rue Voltaire Tel.+33 (0)1 44 08 01 85 94276 Le Kremlin-Bicêtre, France Fax.+33 (0)1 53 14 59 22 didier(a)xemacs.org

17 years, 1 month

FiNK 2.1.1 is released

by Didier Verna

Hello, I'm happy to announce the release of FiNK version 2.1.1. This is a bugfix/documentation release only. What's new in this version: * Fix trailing whitespace in \fink@restore * Added some hints about filenames with special characters Grab it directly here: http://www.lrde.epita.fr/~didier/software/latex.php#fink or wait until it propagates through CTAN... -- 5th European Lisp Workshop at ECOOP 2008, July 7: http://elw.bknr.net/2008/ Didier Verna, didier(a)lrde.epita.fr, http://www.lrde.epita.fr/~didier EPITA / LRDE, 14-16 rue Voltaire Tel.+33 (0)1 44 08 01 85 94276 Le Kremlin-Bicêtre, France Fax.+33 (0)1 53 14 59 22 didier(a)xemacs.org

17 years, 1 month

CurVe 1.15 is out

by Didier Verna

Hello, I'm happy to announce the release of CurVe version 1.15. CurVe is a LaTeX2e class for writing curricula vitae. What's new in this version: * Support for itemize environments * Added some documentation about vertical spacing problems in |bbl| files Grab it directly here: http://www.lrde.epita.fr/~didier/software/latex.php#curve or wait until it propagates through CTAN... -- 5th European Lisp Workshop at ECOOP 2008, July 7: http://elw.bknr.net/2008/ Didier Verna, didier(a)lrde.epita.fr, http://www.lrde.epita.fr/~didier EPITA / LRDE, 14-16 rue Voltaire Tel.+33 (0)1 44 08 01 85 94276 Le Kremlin-Bicêtre, France Fax.+33 (0)1 53 14 59 22 didier(a)xemacs.org

17 years, 1 month

Publication : LDTA'08 : Semantics driven disambiguation: A comparison of different approaches

by Daniela Becker

We are happy to announce that the following paper has been accepted for publication at the 8th workshop on Language Descriptions,Tools and Applications (LDTA'08) that will take place in Budapest, Hungary, on April 5th, 2008. Akim Demaille and Renaud Durlin and Nicolas Pierron and Benoît Sigoure. Semantics driven disambiguation: A comparison of different approaches. http://publis.lrde.epita.fr/200802-LDTA Context-sensitive languages such as C or C++ can be parsed using a context-free but ambiguous grammar, which requires another stage, disambiguation, in order to select the single parse tree that complies with the language's semantical rules. Naturally, large and complex languages induce large and complex disambiguation stages. If, in addition, the parser should be extensible, for instance to enable the embedding of domain specific languages, the disambiguation techniques should feature traditional software-engineering qualities: modularity, extensibility, scalability and expressiveness. We evaluate three approaches to write disambiguation filters for SDF grammars: algebraic equations with ASF, rewrite-rules with programmable traversals for Stratego, and attribute grammars with TAG, our system. To this end we introduce Phenix, a highly ambiguous language. Its ``standard'' grammar exhibits ambiguities inspired by those found in the C and C++ standard grammars. To evaluate modularity, the grammar is layered: it starts with a small core language, and several layers add new features, new production rules, and new ambiguities. -- Daniela Becker

17 years, 1 month

Publication : ISPEC'08 : Towards the World-Wide Quantum Network

by Daniela Becker

We are pleased to announce that the following paper has been accepted for publication at the 4th Information Security Practice and Experience Conference (ISPEC'08) that will take place in Sydney, Australia, 21-23 April 2008. Cuong Le Quoc and Patrick Bellot and Akim Demaille. Towards the World-Wide Quantum Network. http://publis.lrde.epita.fr/200804-ISPEC Quantum Key Distribution (QKD) networks are of much interest due to their capacity of providing extremely high security keys to network participants. Most QKD network studies so far focus on trusted models where all the network nodes are assumed to be perfectly secured. This restricts QKD networks to be small. In this paper, we first develop a novel model dedicated to large-scale QKD networks, some of whose nodes could be eavesdropped secretely. Then, we investigate the key transmission problem in the new model by an approach based on percolation theory and stochastic routing. Analyses show that under computable conditions large-scale QKD networks could protect secret keys with an extremely high probability. Simulations validate our results. -- Daniela Becker

17 years, 1 month

[CFP] 5th European Lisp Workshop, July 07 - Paphos, Cyprus

by Didier Verna

+------------------------------------------------------------+ | CALL FOR PAPERS | | 5th European Lisp Workshop | | July 7, Paphos, Cyprus - co-located with ECOOP 2008 | +------------------------------------------------------------+ Important Dates: **************** Submission deadline (papers & breakout groups): May 04, 2008 Notification of acceptance: May 19, 2008 ECOOP early registration deadline: June 01, 2008 5th European Lisp Workshop: July 07, 2008 For more information visit http://elw.bknr.net/2008/ Contact: Didier Verna, didier(a)lrde.epita.fr Organizers ********** Didier Verna, EPITA Research and Development Laboratory, Paris Christophe Rhodes, Goldsmiths College, University of London Charlotte Herzeel, Programming Technology Lab, Vrije Universiteit, Brussel Hans Hübner, Software Developer, Berlin Overview ******** "...Please don't assume Lisp is only useful for Animation and Graphics, AI, Bioinformatics, 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 is one of the oldest computer languages still in use today. In the decades of its existence, Lisp has been a fruitful basis for language design experiments as well as the preferred implementation language for applications in diverse fields. The structure of Lisp makes it easy to extend the language or even to implement entirely new dialects without starting from scratch. Common Lisp, with the Common Lisp Object System (CLOS), was the first object-oriented programming language to receive an ANSI standard and retains the most complete and advanced object system of any programming language, while influencing many other object-oriented programming languages that followed. It is clear that Lisp is gaining momentum: there is a steadily growing interest in Lisp itself, with numerous user groups in existence worldwide, and in Lisp's metaprogramming notions which are being transferred to other languages, as for example in Aspect-Oriented Programming, support for Domain-Specific Languages, and so on. This workshop will address the near-future role of Lisp-based languages in research, industry and education. We solicit papers and suggestions for breakout groups 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 formally-presented talks, and breakout groups discussing or working on particular topics. Additionally, there will be opportunities for short, informal talks and demonstrations on experience reports, underappreciated results, software under development, or other topics of interest. Papers ****** Formal presentations in the workshop should take between 20 minutes and half an hour; additional time will be given for questions and answers. We encourage that papers be published on the website, to provide all participants with background information in advance. Suggested Topics: - New language features or abstractions - Experience reports or case studies - Protocol Metaprogramming and Libraries - Educational approaches - Software Evolution - Development Aids - Persistent Systems - Dynamic Optimization - Implementation techniques - Innovative Applications - Hardware Support for Lisp systems - Macro-, reflective-, meta- and/or rule-based development approaches - Aspect-Oriented, Domain-Oriented and Generative Programming Breakout Groups *************** The workshop will provide for the opportunity to meet face to face and work on focused topics. We will organize these breakout groups and provide for rooms and infrastructure. Suggested Topics for Breakout Groups: - Lisp Infrastructure Development and Distribution - Language Features (e.g. Predicate Dispatching) - Environments for creating web applications - Brainstorming sessions for new or existing open source projects - Persistence Systems - Compiler technology - Lisp on bare metal / Lisp hardware / Lisp operating systems - Compare and enhance curricula for computer science education Submission Guidelines ********************* Potential attendees are encouraged to submit: - a long paper (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 a breakout group (1-2 pages) describing the theme, an agenda and/or expected results. Submissions should be mailed as PDF to Didier Verna (didier(a)lrde.epita.fr) before the submission deadline. -- Resistance is futile. You will be jazzimilated. Didier Verna, didier(a)lrde.epita.fr, http://www.lrde.epita.fr/~didier EPITA / LRDE, 14-16 rue Voltaire Tel.+33 (0)1 44 08 01 85 94276 Le Kremlin-Bicêtre, France Fax.+33 (0)1 53 14 59 22 didier(a)xemacs.org

17 years, 1 month

← Newer
1
...
46
47
48
49
50
51
52
...
57
Older →

Jump to page:

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

Annonce