| FINAL CALL FOR PARTICIPATION |
| 6th European Lisp Workshop |
| July 6, Genova, Italy - co-located with ECOOP 2009 |
| http://elw.bknr.net/2009 |
ECOOP late registration deadline: July 03, 2009
6th European Lisp Workshop: July 06, 2009
Please note that registration must be done with ECOOP itself.
There is a reduced registration fee for workshop-only attendance.
The early registration deadline is in two days, so register now!
See http://ecoop09.disi.unige.it/ for details.
2009 Special News
* Edi Weitz will give a keynote address on the use of his notorious
open source libraries in commercial / industrial application.
* The workshop is sponsored by ITA Software, Inc.
Please visit them at http://www.itasoftware.com/
* This year, and for the first time, the workshop proceedings
will be published in the ACM Digital Library.
"...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 retains 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.
In addition to Edi Weitz's keynote address, the workshop will feature four
technical papers and two tutorials. Please visit the programme web page
(http://elw2009.bknr.net/programme) for a detailed description.
Didier Verna, EPITA Research and Development Laboratory, Paris
Charlotte Herzeel, Programming Technology Lab, Vrije Universiteit, Brussel
Robert Strandh, LaBRI, University of Bordeaux I, France
Christophe Rhodes, Goldsmiths College, University of London
Hans Hübner, Software Developer, Berlin
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
We are happy to announce that the following paper has been accepted
for publication at the 7th International Symposium on Automated
Technology for Verification and Analysis (ATVA'09) that will take
place at Macao on 14-16 October 2009.
Alexandre Duret-Lutz (1) Denis Poitrenaud (2) Jean-Michel Couvreur (3)
On-the-fly Emptiness Check of Transition-based Streett Automata
(1) EPITA Research and Development Laboratory (LRDE)
(2) Laboratoire d'Informatique de Paris 6 (LIP6)
(3) Laboratoire d'Informatique Fondamentale d'Orléans (LIFO)
In the automata theoretic approach to model checking, checking a
state-space S against a linear-time property F can be done in
O(|S|\times 2^O(|F|)) time. When model checking under n strong
fairness hypotheses expressed as a Generalized Büchi automaton, this
complexity becomes O(|S|*2^O(|F|+n)).
Here we describe an algorithm to check the emptiness of Streett
automata, which allows model checking under n strong fairness
hypotheses in O(|S|*2^O(|F|)*n). We focus on transition-based Streett
automata, because it allows us to express strong fairness hypotheses
by injecting Streett acceptance conditions into the state-space
without any blowup.
We are happy to announce that the following papers have been accepted
for publication at the 10th Annual Conference of the International
Speech Communication Association (INTERSPEECH 2009) that will take place
in Brighton, UK, 6-10 September 2009.
1) "Cepstral and Long-Term Features for Emotion Recognition",
presented at Special Session: INTERSPEECH 2009 Emotion Challenge
2) "Support Vector Machines versus Fast Scoring in the
Low-Dimensional Total Variability Space for Speaker Verification"
Responsable administrative du LRDE