Annonce April 2015

annonce@lrde.epita.fr

4 participants
4 discussions

[Seminaire-LRDE] Mercredi 13 mai 2015: Matthieu Garrigues, Laboratoire d'informatique et d'ingénierie des systèmes, ENSTA ParisTech

by Daniela Becker

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 13 mai 2015 (11h00--12h30), Salle L0 du LRDE. 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], le détail de cette séance [3] ainsi que le plan d'accès [4]. [1] http://seminaire.lrde.epita.fr [2] http://seminaire.lrde.epita.fr/Archives [3] http://seminaire.lrde.epita.fr/2015-05-13 [4] http://www.lrde.epita.fr/Contact Au programme du Mercredi 13 mai 2015 : * 11h00: Programmation web haute performance avec C++14 -- Matthieu Garrigues, Laboratoire d'informatique et d'ingénierie des systèmes, ENSTA ParisTech [1] https://github.com/matt-42/iod Le C++ est très impopulaire dans la communauté des développeurs web et ce n'est pas sans raison. Le langage n'offre aucune introspection, ce qui complique la sérialisation automatique de messages. De plus, l'injection de dépendances, un design pattern très utile dans les frameworks web issus d'autres langages, est complexe voire quasi impossible à implémenter en C++98. Nous verrons comment l'introspection statique et l'injection de dépendance ont été implémentés en C++14 grâce à un concept innovant: les symboles de la bibliothèque IOD [1]. Nous verrons ensuite comment Silicon[2], un jeune framework web, tire parti de ces abstractions et aide les développeurs à construire des APIs web aussi simplement qu'ils le feraient en Go ou JavaScript. -- Matthieu Garrigues est diplômé de la promotion CSI 2009 de l'EPITA. Depuis, il s'intéresse au développement et l'implantation d'applications temps réel de vision par ordinateur. Il est actuellement ingénieur de recherche et thésard au laboratoire d'informatique et d'ingénierie des systèmes de l'ENSTA ParisTech. Passionné par le C++ et ses nouveaux standards, il consacre une partie de son temps libre à étudier comment le langage peut simplifier la programmation web haute performance. 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. -- Akim Demaille Akim.Demaille(a)lrde.epita.fr _______________________________________________ Seminaire mailing list Seminaire(a)lrde.epita.fr https://lists.lrde.epita.fr/listinfo/seminaire

9 years, 7 months

New publication: The Hanoi Omega-Automata Format (CAV'15)

by Alexandre Duret-Lutz

I am happy to announce that the following paper has been accepted at the 27th International Conference on Computer Aided Verification (CAV'15), to be held on July 18–24, at San Francisco. The Hanoi Omega-Automata Format Tomáš Babiak¹, František Blahoudek¹, Alexandre Duret-Lutz², Joachim Klein³, Jan Křetínský⁵, David Müller³, David Parker⁴, and Jan Strejček¹ ¹Faculty of Informatics, Masaryk University, Brno, Czech Republic ²LRDE, EPITA, Le Kremlin-Bicêtre, France ³Technische Universität Dresden, Germany ⁴University of Birmingham, UK ⁵IST Austria https://www.lrde.epita.fr/wiki/Publications/babiak.15.cav Abstract: We propose a flexible exchange format for ω-automata, as typically used in formal verification, and implement support for it in a range of established tools. Our aim is to simplify the interaction of tools, helping the research community to build upon other people's work. A key feature of the format is the use of very generic acceptance conditions, specified by Boolean combinations of acceptance primitives, rather than being limited to common cases such as Büchi, Streett, or Rabin. Such flexibility in the choice of acceptance conditions can be exploited in applications, for example in probabilistic model checking, and furthermore encourages the development of acceptance-agnostic tools for automata manipulations. The format allows acceptance conditions that are either state-based or transition-based, and also supports alternating automata. -- Alexandre Duret-Lutz

9 years, 7 months

Publication: Extending Testing Automata to All LTL (FORTE'15)

by Daniela Becker

I am happy to announce that the following paper has been accepted in the Conference on Formal Techniques for Distributed Objects, Components and Systems (FORTE'15), to be held in Grenoble on June 2-5, 2015. Extending Testing Automata to All LTL Ala Eddine Ben Salem LRDE, EPITA, Le Kremlin-Bicêtre, France, ala(a)lrde.epita.fr Abstract: An alternative to the traditional Büchi Automata (BA), called Testing Automata (TA) was proposed by Hansen et al. to improve the automata theoretic approach to LTL model checking. In previous work, we proposed an improvement of this alternative approach called TGTA (Generalized Testing Automata). TGTA mixes features from both TA and TGBA (Generalized Büchi Automata), without the disadvantage of TA, which is the second pass of the emptiness check algorithm. We have shown that TGTA outperform TA, BA and TGBA for explicit and symbolic LTL model checking. However, TA and TGTA are less expressive than Büchi Automata since they are able to represent only stutter-invariant LTL properties (LTL\X). In this paper, we show how to extend Generalized Testing Automata (TGTA) to represent any LTL property. This allows to extend the model checking approach based on this new form of testing automata to check other kinds of properties and also other kinds of models (such as Timed models). Implementation and experimentation of this extended TGTA approach show that it is statistically more efficient than the Büchi Automata approaches (BA and TGBA), for the explicit model checking of LTL properties.

9 years, 8 months

[CfPart] ELS 2015, April 20-21 2015, London

by Didier Verna

ELS'15 - 8th European Lisp Symposium Goldsmiths College, London, UK April 20-21, 2015 http://www.european-lisp-symposium.org/ Sponsored by EPITA, Goldsmiths University of London, Franz Inc., Lispworks Ltd., Clozure Associates and Google Recent news: - A few seats left, still time to register! - Programme now online (schedule may still change a little) - Invited speakers announced: Zach Beane, Bodil Stokke, Martin Cracauer 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 features 3 invited talks, one tutorial, 4 technical sessions and 2 lightning talks slots. The full programme is now available on the website: http://www.european-lisp-symposium.org/. Programme chair: Julian Padget, University of Bath, UK Local chair: Christophe Rhodes, Goldsmiths, University of London, UK Programme committee: 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 Search Keywords: #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

9 years, 8 months

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

Annonce April 2015