From LaBRI - Laboratoire Bordelais de Recherche en Informatique

Publications: MF2013

Publications de l'équipe Méthodes Formelles pour l'année 2013

Années: 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012

  1. A. Demaille, A. Duret-Lutz, S. Lombardy, and J. Sakarovitch. Implementation concepts in vaucanson 2. In S. Konstantinidis, editor, Implementation and Application of Automata, CIAA 2013, volume 7982 of LNCS, pages 122-133. Springer, 2013.
  2. V. Carnino and S. Lombardy. Factorizations and universal automaton of omega languages. In Developments in Language Theory - 17th International Conference (DLT'13), volume 7907, pages 338-349, 2013.
  3. G. Puppis, C. Riveros, and P. Bourhis. Which dtds are streaming bounded repairable? In International Conference on Database Theory (ICDT), pages 57-68, 2013.
  4. B. Courcelle and I. Durand. Infinite transducers on terms denoting graphs. In European Lisp Symposium, 2013.
  5. R. Moot. Extended lambek calculi and first-order linear logic. In Logic and Language, pages 1-54, 2013.
  6. V. Bruyère, M. Ducobu, and O. Gauwin. Visibly pushdown automata: Universality and inclusion via antichains. In C. M.-V. Adrian-Horia Dediu and B. Truthe, editors, 7th International Conference on Language and Automata Theory and Applications, volume 7810, pages 190-201. Springer, 2013.
  7. G. Kobele and S. Salvati. The io and oi hierarchies revisited. In ICALP (2), 2013.
  8. D. Janin, F. Berthaut, and M. Desainte-Catherine. Multi-scale design of interactive music systems : the libtuiles experiment. In Sound and Music Computing (SMC), 2013.
  9. S. Abiteboul, P. Bourhis, A. Muscholl, and Z. Wu. Recursive queries on trees and data trees. In Proceedings of the 16th International Conference on Database Theory, 2013.
  10. C. Retoré. Type-theoretical natural language semantics: on the system f for meaning assembly. In TYPES 2013, pages 64-65, 2013.
  11. F. Berthaut, D. Janin, and M. Desainte-Catherine. libtuile : un moteur d'exécution multi-échelle de processus musicaux hiérarchisés. In Journées d'Informatique Musicale, pages 45-50, 2013.
  12. C. Retoré. Sémantique des déterminants dans un cadre richement typé. In Traitement Automatique du Langage Naturel 2013, 2013.
  13. D. Janin. Algebras, automata and logic for languages of labeled birooted trees. In F. V. Fomin, M. Kwiatkowska, and D. Peleg, editors, 40th International Colloquium on Automata, Languages and Programming (ICALP), volume 7966 of LNCS, pages 318-329. Springer, 2013.
  14. A. Fontaine and A. Zemmari. Une analyse formelle en coq d'un algorithme distribué probabiliste résolvant le problème du rendez-vous. In D. Pous and C. Tasson, editors, JFLA - Journées francophones des langages applicatifs, 2013.
  15. F. Herbreteau, B. Srivathsan, and I. Walukiewicz. Lazy abstractions for timed automata. In N. Sharygina and H. Veith, editors, CAV - 24th International Conference on Computer Aided Verification - 2013, Lecture Notes in Computer Science. Springer, 2013.
  16. D. Janin. Overlapping tile automata. In A. Bulatov and A. Shu, editors, The 8th International Computer Science Symposium in Russia (CSR), volume 7913 of LNCS, pages 431-443. Springer-Verlag, 2013.
  17. L.-M. Real-Coelho and C. Retoré. A generative montagovian lexicon for polysemous deverbal nouns. In 4th world congress on Universal Logic - workshop on Logic and linguistics, 2013.
  18. L. Clemente, F. Herbreteau, A. Stainer, and G. Sutre. Reachability of communicating timed processes. In F. Pfenning, editor, FoSSaCS - 16th International Conference on Foundations of Software Science and Computation Structures, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS - 2013, volume 7794 of Lecture Notes in Computer Science, pages 81-96. Springer, 2013.
  19. D. Debarbieux, O. Gauwin, J. Niehren, T. Sebastian, and M. Zergaoui. Early nested word automata for xpath query answering on xml streams. In 18th International Conference on Implementation and Application of Automata, page 12, 2013.
  20. D. Janin. On languages of one-dimensional overlapping tiles. In Int. Conf. on Current Thrends in Theo. and Prac. of Comp. Science (SOFSEM), volume 7741 of LNCS, pages 244-256. Springer, 2013.
  21. F. Barbier, P. Castéran, E. Cariou, and O. Le Goaer. Adaptive software based on correct-by-construction metamodels. In V. G. Diaz, J. C. Lovelle, B. C. P. Gracia-Bustelo, and O. S. Martinez, editors, Progressions and Innovations in Model-Driven Software Engineering, pages 308-325. IGI Global, 2013.
  22. C. Retoré. Logique mathématique et linguistique formelle. In G. Sénizergues, editor, Leçons de mathématiques d'aujourd'hui, page 25. Cassini, 2013.
  23. S. Lombardy and J. Sakarovitch. The validity of weighted automata. International Journal of Algebra and Computation, 23:863-913, 2013.
  24. F. Herbreteau and B. Srivathsan. Coarse abstractions make zeno behaviours difficult to detect (extended abstract). Logical Methods in Computer Science, 9(1), 2013.
  25. C. Retoré and R. Moot. Note de lecture sur "discourse processing" de manfred stede. Traitement Automatique des Langues, 53(2):214-217, 2013.
  26. N. Ouled Abdallah, H. Hadj Kacem, M. Mosbah, and A. Zemmari. Randomized broadcasting in wireless mobile sensor networks. Concurrency and Computation: Practice and Experience, 25(2):203-217, 2013.
  27. J. Bernet and D. Janin. Une étude des jeux distribués. Technique et Science Informatiques (TSI), 2013.
  28. F. Bassino, A. Martino, C. Nicaud, E. Ventura, and P. Weil. Statistical properties of subgroups of free groups. Random Structures and Algorithms, 42:349-373, 2013.

Années: 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012

Récupéré sur
Page mise à jour le 08/08/2020 à 06:03