~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
14th European Lisp Symposium
Call for Papers
May 3 - May 4, 2021
Online / Everywhere
http://www.european-lisp-symposium.org/2021
Sponsored by EPITA and RavenPack
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Invited Speakers
~~~~~~~~~~~~~~~~
Nada Amin - Harvard SEAS
others tba
Important Dates
~~~~~~~~~~~~~~~
- Submission deadline: March 7, 2021
- Author notification: April 6, 2021
- Final papers due: April 19, 2021
- Symposium: May 3 - May 4, 2021
Scope
~~~~~
The European Lisp Symposium is a premier forum for the discussion and
dissemination of all aspects of design, implementation and application
of any of the Lisp dialects, including Common Lisp, Scheme, Emacs
Lisp, Clojure, Racket, ACL2, AutoLisp, ISLISP, Dylan, SKILL, Hy, Shen,
Carp, Janet, uLisp, Picolisp, Gamelisp, TXR, and so on. We encourage
everyone interested in Lisp to participate.
The European Lisp Symposium 2021 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
Technical Program
~~~~~~~~~~~~~~~~~
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 4 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.
All submissions should be formatted following the ACM SIGS guidelines
and include ACM Computing Classification System 2012 concepts and
terms. Submissions should be uploaded to Easy Chair, at the following
http://www.easychair.org/conferences/?conf=els2021
Note: to help us with the review process please indicate the type of
submission by entering either "paper", "demo", or "tutorial" in the
Keywords field.
Programme Chair
~~~~~~~~~~~~~~~
Marco Heisig - FAU Erlangen-Nürnberg, Germany
Local Chairs
~~~~~~~~~~~~
Michał Herda
Mark Evenson - RavenPack
Programme Committee
~~~~~~~~~~~~~~~~~~~
Ioanna Dimitriou - Igalia
Irène Durand - LaBRI University of Bordeaux
R. Matthew Emerson - thoughtstuff LLC
Matthew Flatt - University of Utah
Jonathan Godbout - Google
Paulo Matos - Linki Tools
David McClain - SpectroDynamics, LLC
Stefan Monnier - University of Montreal
Jim Newton - EPITA Research Lab
Kent Pitman - HyperMeta Inc.
Christophe Rhodes - Google
Kai Selgrad - OTH Regensburg
Olin Shivers - Northeastern University
Robert Smith - Rigetti Quantum Computing
Michael Sperber - DeinProgramm
Evrim Ulu - Middle East Technical University
Breanndán Ó Nualláin - Machine Learning Programs
--
Lisp, Jazz, Aïkido: http://www.didierverna.info
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
14th European Lisp Symposium
Call for Papers
May 3 - May 4, 2021
Online / Everywhere
http://www.european-lisp-symposium.org/2021
Sponsored by EPITA and RavenPack
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Invited Speakers
~~~~~~~~~~~~~~~~
tba
Important Dates
~~~~~~~~~~~~~~~
- Submission deadline: March 7, 2021
- Author notification: April 6, 2021
- Final papers due: April 19, 2021
- Symposium: May 3 - May 4, 2021
Scope
~~~~~
The European Lisp Symposium is a premier forum for the discussion and
dissemination of all aspects of design, implementation and application
of any of the Lisp dialects, including Common Lisp, Scheme, Emacs
Lisp, Clojure, Racket, ACL2, AutoLisp, ISLISP, Dylan, SKILL, Hy, Shen,
Carp, Janet, uLisp, Picolisp, Gamelisp, TXR, and so on. We encourage
everyone interested in Lisp to participate.
The European Lisp Symposium 2021 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
Technical Program
~~~~~~~~~~~~~~~~~
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 4 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.
All submissions should be formatted following the ACM SIGS guidelines
and include ACM Computing Classification System 2012 concepts and
terms. Submissions should be uploaded to Easy Chair, at the following
http://www.easychair.org/conferences/?conf=els2021
Note: to help us with the review process please indicate the type of
submission by entering either "paper", "demo", or "tutorial" in the
Keywords field.
Programme Chair
~~~~~~~~~~~~~~~
Marco Heisig - FAU Erlangen-Nürnberg, Germany
Local Chairs
~~~~~~~~~~~~
Michał Herda
Mark Evenson - RavenPack
Programme Committee
~~~~~~~~~~~~~~~~~~~
tba
--
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
Mercredi 16 décembre 2020 (11h -- 12h) en distanciel (en raison des
conditions sanitaires actuelles) au lien suivant:
https://eu.bbcollab.com/collab/ui/session/guest/95a72a9dc7b0405c8c281ea3157… <https://eu.bbcollab.com/collab/ui/session/guest/95a72a9dc7b0405c8c281ea3157…>
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],
et le détail de cette séance [3].
[1] http://seminaire.lrde.epita.fr
[2] http://seminaire.lrde.epita.fr/Archives
[3] http://seminaire.lrde.epita.fr/2020-12-16
Au programme du Mercredi 16 décembre 2020 :
* 11h -- 12h: Diagnosis and Opacity in Partially Observable Systems
-- Stefan Schwoon, ENS Paris-Saclay
http://www.lsv.fr/~schwoon/
In a partially observable system, diagnosis is the task of detecting
certain events, for instance fault occurrences. In the presence of
hostile observers, on the other hand, one is interested in rendering a
system opaque, i.e. making it impossible to detect certain "secret"
events. The talk will present some decidability and complexity results
for these two problems when the system is represented as a finite
automaton or a Petri net. We then also consider the problem of active
diagnosis, where the observer has some control over the system. In this
context, we study problems such as the computational complexity of the
synthesis problem, the memory required for the controller, and the delay
between a fault occurrence and its detection by the diagnoser. The talk
is based on joint work with B. Bérard, S. Haar, S. Haddad, T. Melliti,
and S. Schmitz.
-- Stefan Schwoon studied Computer Science at the University of Hildesheim
and received a PhD from the Technical University of Munich in 2002. He
held the position of Scientific Assistent at the University of Stuttgart
from 2002 to 2007, and at the Technical University in Munich from 2007
to 2009. He is currently Associate Professor (Maître de conférences) at
Laboratoire Spécification et Vérification (LSV), ENS Paris-Saclay, and a
member of the INRIA team Mexico. His research interests include model
checking and diagnosis on concurrent and partially-observable systems.
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.
Dear all,
I am pleased to announce my habilitation defense, entitled
(dynamic (programming paradigms)) ;; performance and expressivity
to be held on Friday, July 10, 14:00 CEST. Due to the current pandemic,
the defense will take place on a Zoom public channel. The actual link to
the video-conference will be provided later on, at the following URL:
https://www.lrde.epita.fr/~didier/research/publications/papers.php#verna.20…
The jury is composed as follows.
Reporters:
Robert Strandh, University of Bordeaux, France
Nicolas Neuß, FAU, Erlangen-Nürnberg, Germany
Manuel Serrano, INRIA, Sophia Antipolis, France
Examiners:
Marco Antoniotti, University of Milan, Italy
Ralf Möller, Université of Lübech, Germany
Gérard Assayag, IRCAM, Paris, France
--
Resistance is futile. You will be jazzimilated.
Lisp, Jazz, Aïkido: http://www.didierverna.info
I am happy to announce that the following paper has been accepted at
the 18th International Symposium on Automated Technology
for Verification and Analysis (ATVA'20)
Practical "paritizing" of Emerson-Lei automata
Florian Renkin, Alexandre Duret-Lutz, Adrien Pommellet
https://www.lrde.epita.fr/wiki/Publications/renkin.20.atva [1]
Abstract:
We introduce a new algorithm that takes a Transition-based
Emerson-Lei Automaton (TELA), that is, an ω-automaton whose
acceptance condition is an arbitrary Boolean formula on sets of
transitions to be seen infinitely or finitely often, and
converts it into a Transition-based Parity Automaton (TPA). To
reduce the size of the output TPA, the algorithm combines and
optimizes two procedures based on a latest appearance record
principle, and introduces a partial degeneralization. Our
motivation is to use this algorithm to improve our LTL synthesis
tool, where producing deterministic parity automata is an
intermediate step.
--
Florian Renkin
Links:
------
[1] https://www.lrde.epita.fr/wiki/Publications/blahoudek.20.atva
**English below**
Bonjour à toutes et à tous,
J'ai le plaisir de vous inviter à la soutenance de ma thèse qui
s'intitule "Non-iterative methods for image improvement in digital
holography of the retina" (ci-joint un court résumé).
Elle aura lieu le 17 juillet à 14h, dans l'amphithéâtre 401 à l'EPITA,
14-16 Rue Voltaire, 94270 Le Kremlin-Bicêtre (pour plus d'informations :
https://www.lrde.epita.fr/wiki/Affiche-these-JR), dans le respect des
distances de sécurité.
Elle sera également diffusée par visioconférence. Le lien pour y accéder
vous sera communiqué prochainement.
La soutenance sera suivie d'un pot à côté de l'amphithéâtre.
A bientôt je l'espère,
Julie Rivet
--
Hello everyone,
I am pleased to invite you to the defense of my thesis entitled
"Non-iterative methods for image improvement in digital holography of
the retina" (a short abstract is attached).
It will take place on July 17th at 2pm, in the amphitheatre 401 at
EPITA, 14-16 Rue Voltaire, 94270 Le Kremlin-Bicêtre (for more
information: https://www.lrde.epita.fr/wiki/Affiche-these-JR), with
respect to safety distances.
It will also be broadcast by videoconference. The link to access it will
be communicated to you shortly.
The defense will be followed by a toast next to the amphitheatre.
See you soon I hope,
Julie Rivet
Greetings,
We are please to announce that the following paper has been accepted for publication in "Innovations in Systems and Software Engineering: a NASA journal (ISSE)".
Title and corresponding authors:
"Improving swarming using genetic algorithms"
Etienne Renault (1)
(1) LRDE, EPITA, Le Kremlin-Bicêtre, France
Abstract:
The verification of temporal properties against a given system may require the exploration of its full state space. In explicit model checking, this exploration uses a depth-first search and can be achieved with multiple randomized threads to increase performance. Nonetheless, the topology of the state space and the exploration order can cap the speedup up to a certain number of threads. This paper proposes a new technique that aims to tackle this limitation by generating artificial initial states, using genetic algorithms. Threads are then launched from these states and thus explore different parts of the state space. Our prototype implementation is 10% faster than state-of-the-art algorithms on a general benchmark and 40% on a specialized benchmark. Even if we expected a decrease in an order of magnitude, these results are still encouraging since they suggest a new way to handle existing limitations. Empirically, our technique seems well suited for "linear topology", i.e., the one we can obtain when combining model checking algorithms with partial-order reduction techniques.
More information at :
https://www.lrde.epita.fr/wiki/Publications/renault.20.isse <https://www.lrde.epita.fr/wiki/Publications/renault.20.isse>
Onward! Essays 2020
ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and
Reflections on Programming and Software
Renaissance Chicago Downtown Hotel
Chicago, USA
November 15--20 2020
Part of SPLASH 2020
Systems, Programming Languages and Applications:
Software for Humanity
https://2020.splashcon.org/track/splash-2020-Onward-essays
Onward! is a premier multidisciplinary conference focused on everything to
do with programming and software: including processes, methods, languages,
communities, applications and education.
Compared to other conferences, Onward! is more radical, more visionary, and
more open to ideas that are well-argued but not yet proven. It is not
looking for research-as-usual papers. To allow room for bigger, bolder
and/or less mature ideas, it accepts less exact methods of validation, such
as compelling arguments, exploratory implementations, and substantial
examples.
Onward! Essays is looking for clear and compelling pieces of writing about
topics important to the software community (there is also a parallel Papers
track with a seperate announcement).
An essay can be an exploration of the topic and its impact, or a story about
the circumstances of its creation; it can present a personal view of what
is, explore a terrain, or lead the reader in an act of discovery; it can be
a philosophical digression or a deep analysis. It can describe a personal
journey, perhaps the one the author took to reach an understanding of the
topic. The subject area—software, programming, and programming
languages—should be interpreted broadly and can include the relationship of
software to human endeavors, or its philosophical, sociological,
psychological, historical, or anthropological underpinnings.
Format and Selection:
Onward! essays must describe unpublished work that is not currently
submitted for publication elsewhere as described by SIGPLAN's Republication
Policy. Submitters should also be aware of ACM's Policy and Procedures on
Plagiarism. Onward! essays should use the ACM SIGPLAN Conference acmart
format. Please refer to the conference's website above for full details.
The Onward! Essays track follows a two-phase review process. Essays are
peer-reviewed in a single-blind manner. Accepted essays will appear in the
Onward! Proceedings in the ACM Digital Library, and must be presented at the
conference. Submissions will be judged on the potential impact of the ideas
and the quality of the presentation.
Important dates:
All deadlines are midnight, anywhere on Earth.
Essay submission: 23 May
First-round notification: 11 July
Second-round submission: 15 August
Final notification: 30 August
Conference: 15--20 November
Programme Committee:
Didier Verna, EPITA Research lab, France (Program Chair)
Anya Helene Bagge, University of Bergen, Norway
Alexandre Bergel, University of Chile
Jean Bresson, Ableton, Germany
Maxime Chevalier-Boisvert, Université de Montréal, Québec
Elisa Gonzalez Boix, Vrije Universiteit Brussel, Belgium
Hidehiko Masuhara, Tokyo Institute of Technology, Japan
Kent Pitman, PTC, USA
Donya Quick, Stevens Institute of Technology, USA
Gordana Rakić, University of Novi Sad, Serbia
--
Resistance is futile. You will be jazzimilated.
Lisp, Jazz, Aïkido: http://www.didierverna.info
I am happy to announce that the following paper has been accepted in the
Innovations in Systems and Software Engineering (ISSE) journal.
LTL Model Checking for Communicating Concurrent Programs
Adrien Pommellet and Tayssir Touili
Abstract:
We present in this paper a new approach to the static analysis of
concurrent programs with procedures. To this end, we model
multi-threaded programs featuring recursive procedure calls and
synchronisation by rendez-vous between parallel threads with
communicating pushdown systems (from now on CPDSs).
The reachability problem for this particular class of automata is
unfortunately undecidable. However, it has been shown that an efficient
abstraction of the execution traces language can nonetheless be
computed. To this end, an algebraic framework to over-approximate
context-free languages has been introduced by Bouajjani et al.
In this paper, we combine this framework with an automata-theoretic
approach in order to approximate an answer to the model checking problem
of the linear-time temporal logic (from now on LTL) on CPDSs. We then
present an algorithm that, given a single-indexed or stutter-invariant
LTL formula, allows us to prove that no run of a CPDS verifies this
formula if the procedure ends.
I am happy to announce that the following paper has been accepted at
the 32nd International Conference on Computer-Aided Verification (CAV'20),
to be held virtually in July 2020.
Seminator 2 Can Complement Generalized Büchi Automata
via Improved Semi-Determinization
František Blahoudek¹, Alexandre Duret-Lutz², Jan Strejček³
¹University of Texas at Austin, USA
²LRDE, EPITA, Le Kremlin-Bicêtre, France
³Faculty of Informatics, Masaryk University, Brno, Czech Republic
https://www.lrde.epita.fr/wiki/Publications/blahoudek.20.atva
Abstract:
We present the second generation of the tool Seminator that
transforms transition-based generalized Büchi automata (TGBAs)
into equivalent semi-deterministic automata. The tool has been
extended with numerous optimizations and produces considerably
smaller automata than its first version. In connection with the
state-of-the-art LTL to TGBAs translator Spot, Seminator 2
produces smaller (on average) semi-deterministic automata than the
direct LTL to semi-deterministic automata translator ltl2ldgba of
the Owl library. Further, Seminator 2 has been extended with an
improved NCSB complementation procedure for semi-deterministic
automata, providing a new way to complement automata that is
competitive with state-of-the-art complementation tools.
--
Alexandre Duret-Lutz