From LaBRI - Laboratoire Bordelais de Recherche en Informatique

Publications: MF2010

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

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

  1. T. Place. Caractérisation décidables de logiques sur les arbres. PhD thesis, Université Sciences et Technologies - Bordeaux I, 2010.
  2. O. Ly and P.-Y. Oudeyer. Acroban the humanoid: Playful and compliant physical child-robot interaction. In ACM SIGGRAPH'2010 Emerging Technologies, 2010.
  3. O. L. Nguena Timo, H. Marchand, and A. Rollet. Automatic test generation for data-flow reactive systems with time constraints. In 22nd IFIP International Conference on Testing Software and Systems, 2010.
  4. K. Makoto and S. Salvati. The copying power of well-nested multiple context-free grammars. In A.-H. Dediu, H. Fernau, and C. Martín-Vide, editors, Language and Automata Theory and Applications, volume 6031 of LNCS, pages 344-355. Springer, 2010.
  5. F. Herbreteau and B. Srivathsan. Efficient on-the-fly emptiness check for timed büchi automata. In A. Bouajjani and W.-N. Chin, editors, ATVA - 8th International Symposium on Automated Technology for Verification and Analysis - 2010, volume 6252 of Lecture Notes in Computer Science, pages 218-232. Springer, 2010.
  6. R. Moot. Wide-coverage french syntax and semantics using grail. In TALN 2010, 2010.
  7. R. Moot. Semi-automated extraction of a wide-coverage type-logical grammar for french. In TALN 2010, 2010.
  8. A. Montanari, G. Puppis, P. Sala, and G. Sciavicco. Decidability of the interval temporal logic abbar over the natural numbers. In J.-Y. Marion and T. Schwentick, editors, 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, pages 597-608, 2010.
  9. P. A. Abdulla, Y.-F. Chen, L. Clemente, L. Holík, C.-D. Hong, R. Mayr, and T. Vojnar. Simulation subsumption in ramsey-based büchi automata universality and inclusion testing. In Computer Aided Verification (CAV), 2010.
  10. G. Puppis, A. Montanari, P. Sala, and G. Sciavicco. Decidability of the interval temporal logic abb over the natural numbers. In Proceedings of STACS 2010, pages 597-608. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2010.
  11. G. Puppis, M. Benedikt, and H. Vu. Positive higher-order queries. In Proceedings of PODS 2010, pages 27-38. ACM, 2010.
  12. G. Puppis, A. Montanari, and P. Sala. Maximal decidable fragments of halpern and shoham's modal logic of intervals. In Proceedings of ICALP 2010, volume 6199 of LNCS, pages 345-356. Springer, 2010.
  13. G. Puppis, C. Ley, and M. Benedikt. What you must remember when processing data words. In Proceedings of AMW 2010, volume 619 of CEUR Workshop Proceedings. CEUR-WS.org, 2010.
  14. G. Puppis, C. Ley, and M. Benedikt. Automata vs. logics on data words. In Proceedings of CSL 2010, volume 6247 of LNCS, pages 110-124. Springer, 2010.
  15. B. Genest, H. Gimbert, A. Muscholl, and I. Walukiewicz. Optimal zielonka-type construction of deterministic asynchronous automata. In International Conference on AUTOMATA, LANGUAGES AND PROGRAMMING, pages 52-63, 2010.
  16. B. Courcelle. Special tree-width and the verification of monadic second-order graph pr operties. In M. M. K.Lodaya, editor, FSTTCS 2010, volume 8. LIPIcs, Leibniz-Zentrum fuer Informatik, 2010.
  17. A. Muscholl. Analysis of communicating automata. In Language and Automata Theory and Applications, 4th International Conference, LATA 2010, 2010.
  18. A. Muscholl. Taming distributed asynchronous systems. In Concurrency Theory, 21th International Conference, CONCUR 2010, 2010.
  19. I. Chahid, S. Maabout, L. Martin, and M. Mosbah. Simplification de données de vol pour un stockage optimal et une visualisation accélérée. In Conférence Internationale Francophone sur l'Extraction et la Gestion de Connaissance (EGC), RNTI (Revue des Nouvelles Technologies de l'Information), pages 393-398. Cepadeues, 2010.
  20. A. Benzakour, S. Maabout, M. Mosbah, and M. Sistiaga. Time constraints extension on frequent sequential patterns. In SciTePress, editor, International Conference on Knowledge Discovery and Information Retrieval (KDIR), pages 281-287, 2010.
  21. K. Musumbu, M. Diouf, and S. Maabout. Business rules generation methods by merging model driven architecture and web semantics. In L. Wenzheng, editor, 2010 First IEEE International Conference On Software Engineering and Service Sciences, volume IEEE of IEEE, pages 33-36. IEEE, 2010.
  22. S. Lombardy and J. Sakarovitch. Radix cross-sections for length morphisms. In L.-O. Alejandro, editor, 9th Latin American Theoretical Informatics Symposium (LATIN'10), volume 6034 of Lecture Notes in Computer Science, pages 184-195. Springer-Verlag, 2010.
  23. B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. Pebble weighted automata and transitive closure logics. In F. M. a. d. H. S. Abramsky and P. Spirakis, editors, Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10) - Part II, volume 6199 of Lecture Notes in Computer Science, pages 587-598. Springer, 2010.
  24. C. Retoré. Talking and understanding: cognitive processes and computational models of the language faculty. In Cognitique / cognitics, volume 10, 2010.
  25. N. Ouled Abdallah, H. Hadj Kacem, M. Mosbah, and A. Zemmari. Broadcast in wireless mobile sensor networks with population protocols and extension with the rendezvous model. In K. Drira, A. H. Kacem, and M. Jmaiel, editors, NOuvelles TEchnologies de la REpartition 2010, IEEE, pages 219-226, 2010.
  26. I. Walukiewicz. Synthesis: Words and traces. In ATVA, volume 6252, pages 18-21, 2010.
  27. B. Genest, H. Gimbert, A. Muscholl, and I. Walukiewicz. Optimal zielonka-type construction of deterministic asynchronous automata. In ICALP, volume 6199 of LNCS, pages 52-63, 2010.
  28. A. Heußner, J. Leroux, A. Muscholl, and G. Sutre. Reachability analysis of communicating pushdown systems. In L. Ong, editor, FOSSACS 2010, volume 6014 of LNCS, pages 267-281, 2010.
  29. O. L. Nguena Timo and A. Rollet. Conformance testing of variable driven automata. In 8th IEEE International Workshop on Factory Communication Systems, pages 241 - 248, 2010.
  30. B. Courcelle and I. Durand. Tractable constructions of finite automata from monadic second-order formula. In Workshop on Logical Approaches to Barriers in Computing and Complexity, 2010.
  31. B. Courcelle and I. Durand. Verifying monadic second order graph properties with tree automata. In C. Rhodes, editor, 3rd European Lisp Symposium, pages 7-21, 2010.
  32. F. Demontoux, E. Belliard, A. Dicky, K. Verdeau, and E. Woirgard. La télé participation aux enseignements de travaux pratiques. application à l'accès à tous les enseignements pour les étudiants handicapés. In 11° Rencontres Mondiales du Logiciel Libre, page 100, 2010.
  33. G. Sénizergues, M. Sylvestre, and I. Durand. Termination of linear bounded term rewriting systems. In C. Lynch, editor, 21st International Conference on Rewriting Techniques and Applications, pages 341-356. L I P I c s, 2010.
  34. G. Bagan, A. Durand, E. Filiot, and O. Gauwin. Efficient enumeration for conjunctive queries over x-underbar structures. In A. Dawar and H. Veith, editors, 19th EACSL Annual Conference on Computer Science Logic, volume 6247 of Lecture Notes in computer science, pages 80-94. Springer, 2010.
  35. F. Herbreteau, B. Srivathsan, and I. Walukiewicz. Efficient emptiness check for timed büchi automata. In T. Touili, B. Cook, and P. Jackson, editors, CAV - 22nd International Conference on Computer Aided Verification - 2010, volume 6174 of Lecture Notes in Computer Science, pages 148-161. Springer, 2010.
  36. P. Castéran and V. Filou. Tâches, types et tactiques pour les systèmes de calculs locaux. In I. Lavallée, editor, Journées Francophones des Langages Applicatifs, Studia Informatica Universalis, pages 83-110. Hermann, 2010.
  37. B. Genest, A. Muscholl, and Z. Wu. Verifying recursive active documents with positive data tree rewriting. In Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), pages 469-480, 2010.
  38. F. Bassino, A. Martino, C. Nicaud, E. Ventura, and P. Weil. On two distributions of subgroups of free groups. In Workshop on Analytic Algorithmics and Combinatorics (ANALCO) 2010, pages 82-89. SIAM, 2010.
  39. H. Gimbert and F. Horn. Solving simple stochastic tail games. In SODA'10 (Symposium on Discrete Algorithms), page 1000, 2010.
  40. R. Moot. Extraction of type-logical supertags from the spoken dutch corpus. In A. Joshi and S. Bangalore, editors, Supertagging: Using Complex Lexical Descriptions in Natural Language Processing. MIT Press, 2010.
  41. B. Courcelle. Structuration des graphes et logique. In F. B. et E. Charpentier, editor, Leçons de Mathématiques d'Aujourd'hui, Volume 4, pages 167-194. Cassini, 2010.
  42. G. Puppis. Automata for Branching and Layered Temporal Structures: an Investigation into Regularities of Infinite Transition Systems. Springer, 2010.
  43. S. Salvati. On the membership problem for non-linear abstract categorial grammars. Journal of Logic, Language and Information, 19(2):163-183, 2010.
  44. C. Retoré and S. Salvati. A faithful representation of non-associative lambek grammars in abstract categorial grammars. Journal of Logic Language and Information, 19(2):185-200, 2010.
  45. C. Bassac, B. Mery, and C. Retoré. Towards a type-theoretical account of lexical semantics. Journal of Logic Language and Information, (19):229-245, 2010.
  46. A. Carayol, C. Loeding, D. Niwinski, and I. Walukiewicz. Choice functions and well-orderings over the infinite binary tree. Central European Journal of Mathematics, 8(6):662-682, 2010.
  47. S. Lombardy and J. Sakarovitch. Corrigendum to our paper : How expressions can code for automata. RAIRO-Theoretical Informatics and Applications, 44(3):339-361, 2010.
  48. J. Leroux. Vector addition system reachability problem: A short self-contained proof. Logical Methods in Computer Science (LMCS), 6(3):1-25, 2010.
  49. M.-P. Béal, S. Lombardy, and D. Perrin. Embeddings of local automata. Illinois J. Math., 54(1):155-174, 2010.
  50. M. Amblard, A. Lecomte, and C. Retoré. Categorial minimalist grammars: From generative syntax to logical form. Linguistic Analysis, 36(1-4):273-306, 2010.
  51. M. Amblard, A. Lecomte, and C. Retoré. Categorial minimalist grammar: From generative syntax to logical form. Linguistic Analysis, 36(1-4):273-306, 2010.
  52. B. Courcelle and A. Twigg. Constrained-path labellings on graphs of bounded clique-width. Theory of Computing Systems, 47:531-567, 2010.
  53. L. Clément. Zeugme sémantique. Revue de Sémantique et de Pragmatique, pages 231-247, 2010.
  54. M. Kufleitner and P. Weil. On the lattice of sub-pseudovarieties of da. Semigroup Forum, 81:243-254, 2010.
  55. B. Derbel, M. Mosbah, and A. Zemmari. Sublinear fully distributed partition with applications. Theory of Computing Systems, 47(3):368-404, 2010.
  56. P. Silva and P. Weil. Automorphic orbits in free groups: words versus subgroups. International Journal of Algebra and Computation, 20:561-590, 2010.
  57. P. Silva and P. Weil. On finite-index extensions of subgroups of free groups. Journal of Group Theory, 13(3):365-381, 2010.
  58. A. Blumensath and B. Courcelle. On the monadic second-order transduction hierarchy. Logical Methods in Computer Science (LMCS), 6(2):1-28, 2010.
  59. Z. Esik and P. Weil. Algebraic characterization of logically defined tree languages. International Journal of Algebra and Computation, 20:195-239, 2010.

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

Récupéré sur http://www.labri.fr/index.php?n=Publications.MF2010
Page mise à jour le 14/12/2017 à 11:07