ELS'15 - 8th European Lisp Symposium
Goldsmiths College, London, UK
April 20-21, 2015
Sponsored by EPITA, Franz Inc. and Lispworks Ltd.
- 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
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:
- 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
Julian Padget, University of Bath, UK
Christophe Rhodes, Goldsmiths, University of London, UK
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
#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
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
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.