From LaBRI - Laboratoire Bordelais de Recherche en Informatique

Publications: MF2005

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

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

  1. D. Janin. Contribution aux fondements des méthodes formelles : jeux, logique et automates. PhD thesis, Université Sciences et Technologies - Bordeaux I, 2005.
  2. S. Lombardy. Contribution aux problèmes de réalisation des langages et séries rationnels. PhD thesis, Université Sciences et Technologies - Bordeaux I, 2005.
  3. I. Durand. Call by need computations in orthogonal term rewriting systems. PhD thesis, Université Sciences et Technologies - Bordeaux I, 2005.
  4. T. Claveirole, S. Lombardy, S. Oconnor, L.-N. Pouchet, and J. Sakarovitch. Inside vaucanson. In F. Jacques, L. Igor, and S. Sylvain, editors, 10th International Conference on Implementation and Application of Automata (CIAA 2005), volume 3845 of LNCS, pages 116-128. Springer-Verlag, 2005.
  5. O. Gauwin, S. Konieczny, and P. Marquis. Iterated belief merging as conciliation operators. In 7th International Symposium on Logical Formalizations of Commonsense Reasoning(CommonSense'05), 2005.
  6. B. Sagot, L. Clément, De La Clergerie, and P. Boullier. Vers un méta-lexique pour le français: architecture, acquisition, utilisation. In Journée ATALA sur l'interface lexique-grammaire, 2005.
  7. P. Boullier, L. Clément, De La Clergerie, and B. Sagot. Simple comme easy. In TALN 05, pages 57-60, 2005.
  8. P. Boullier, L. Clément, B. Sagot, and De La Clergerie. Chaînes de traitement syntaxique. In TALN 05, pages 103-112, 2005.
  9. P. Boullier, B. Sagot, and L. Clément. Un analyseur lfg efficace pour le français: Sxlfg. In Ttraitement Automatique des Langues Naturelles, pages 403-408, 2005.
  10. P. Weil. Algebraic extensions of finitely generated subgroups of free groups. In International Conference on Semigroups and Languages, 2005.
  11. I. Berrada and P. Felix. Tgse : Un outil générique pour le test. In Hermes, editor, CFIP'05 - Colloque Francophone sur l'Ingénierie des Protocoles, pages 67-84. Hermes, 2005.
  12. I. Walukiewicz. Pushing the limits of pushdown verification. In Perspectives in verification, workshop in honour of Prof. Dr. Wolfgang Thomas on the occasion of his doctorate Honoris Causa, 2005.
  13. I. Walukiewicz. From logic to games. In FSTTCS, volume 3821, pages 79-91, 2005.
  14. I. Walukiewicz. On importance of logic in informatics. In Colloquium of Polish Mathematical Society, 2005.
  15. I. Berrada, R. Castanet, and P. Félix. Testing communicating systems : a model, a methodology and a tool. In TESTCOM, LNCS, pages 115-130. Springer, 2005.
  16. H. Fouchal, L. Pierre, S. Gruson, C. Rabat, and A. Rollet. Integrated tool for testing timed systems. In Fifth IEEE International Symposium and School on Advance Distributed Systems (ISSADS 2005), volume 3563 of Springer LNCS, pages 153-166, 2005.
  17. A. Tarhini, A. Rollet, and H. Fouchal. A pragmatic approach for testing robustness on real-time component based systems. In 3rd ACS/IEEE International Conference on Computer Systems and Applications (AICCSA'05),, pages 143-149, 2005.
  18. H. Fouchal, A. Rollet, and A. Tarhini. Robustness of composed timed systems. In 31st Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'05), volume 3381 of Springer LNCS, pages 155-164, 2005.
  19. B. Courcelle and C. Delhommé. The modular decomposition of countable graphs : Constructions in monadic second-order logic. In L. Ong, editor, Computer Science Logic, volume 3634 of Lecture Notes in Computer Science, pages 325-338. Springer, 2005.
  20. O. Ly and C. Gavoille. Distance labeling in hyperbolic graphs. In 16th Annual International Symposium on Algorithms and Computation, ISAAC, volume 3827 of Lectures Notes in Computer Science, pages 1071-1081, 2005.
  21. P. Bouyer, F. Cassez, E. Fleury, and K. G. Larsen. Synthesis of optimal strategies using hytech. In Workshop on Games in Design and Verification (GDV'04), volume 119 of Electronic Notes in Theoretical Computer Science, pages 11-31. Elsevier, 2005.
  22. F. Cassez, A. David, E. Fleury, K. G. Larsen, and D. Lime. Efficient on-the-fly algorithms for the analysis of timed games. In L. d. A. Martín Abadi, editor, 16th International Conference on Concurrency Theory (CONCUR'05), volume 3653 of Lecture Notes in Computer Science, pages 66-80. Springer, 2005.
  23. J. Leroux and G. Sutre. Flat counter automata almost everywhere! In Third International Symposium, ATVA 2005, volume 3707 of Lecture Notes in Computer Science, pages 489-503. Springer, 2005.
  24. J. Leroux. A polynomial time presburger criterion and synthesis for number decision diagrams. In LICS, IEEE, pages 147 - 156. IEEE Computer Society Washington, DC, USA, 2005.
  25. S. Bardin, A. Finkel, J. Leroux, and P. Schnoebelen. Flat acceleration in symbolic model checking. In Third International Symposium, ATVA 2005, volume 3707 of Lecture Notes in Computer Science, pages 474-488. Springer, 2005.
  26. A. Arnold, X. Briand, G. Point, and A. Vincent. A generic approach to the control of discrete event systems. In Conference on Decision and Control and European Control Conference ECC (CDC-ECC), pages 1-5. IEEE, 2005.
  27. T. Knapik, D. Niwinski, P. Urzyczyn, and I. Walukiewicz. Unsafe grammars and panic automata. In ICALP'05, volume 3580 of LNCS, pages 1450-1461, 2005.
  28. A. Murawski, L. Ong, and I. Walukiewicz. Idealized algol with ground recursion, and pda equivalence. In ICALP'05, volume 3580 of LNCS, pages 917-926, 2005.
  29. N. Bonichon, S. Felsner, and M. Mosbah. Convex drawings of 3-connected planar graphs - (extended abstract). In Graph Drawing: 12th International Symposium, GD 2004, volume 3383, pages 60-70, 2005.
  30. B. Hamid and M. Mosbah. An automatic approach to self-stabilization. In Proceedings SNPD05, 6th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/ Distributed Computing, pages 123-128, 2005.
  31. B. Hamid and M. Mosbah. Visualization of self-stabilizing distributed algorithms. In Proceedings IV05, 9th International conference on information visualization,, pages 550-555, 2005.
  32. B. Hamid and M. Mosbah. An implementation of a failure detector for local computations in graphs. In Proceedings of the 23rd IASTED International multi-conference on parallel and distributed computing and networks, pages 473-478, 2005.
  33. B. Hamid and M. Mosbah. A formal model for fault-tolerance in distributed systems. In Proceedings SAFECOM05, 24th International Conference on Computer Safety, Reliability and Security, volume LNCS 3688, pages 108-121, 2005.
  34. J. Bernet and D. Janin. Tree automata and discrete distributed games. In Fundamentals of Computation Theory (FCT), volume 3623, pages 540-551. Maciej Liskiewicz and Rdiger Reischuk, 2005.
  35. L. Hélouët, M. Zeitoun, and A. Degorre. Scenarios and covert channels, another game... In GDV 04, volume 119, pages 93-116, 2005.
  36. B. Genest, D. Kuske, A. Muscholl, and D. Peled. Snapshot verification. In Tools and Algorithms for the Construction and Analysis of Systems, volume 3440 of Lecture Notes in Computer Science, pages 510-525, 2005.
  37. H. Gimbert and W. Zielonka. Games where you can play optimally without any memory. In M. Abadi and L. de Alfaro, editors, CONCUR 2005, Lecture Notes in Comp. Sci. 3653, pages 428-442. Springer, 2005.
  38. M.-P. Béal, S. Lombardy, and J. Sakarovitch. On the equivalence of z-automata. In L. Caires, G. Italiano, L. Monteiro, C. Palamidessi, and M. Yung, editors, Automata Languages and Programming. 32nd international colloquium, ICALP 2005, Lisbon, Portugal, July 2005. Proceedings., LNCS 3580, pages 397-409. Springer-Verlag, 2005.
  39. P. Blache, E. Stabler, J. Busquets, and R. Moot. 5th international conference on logical aspects of computational linguistics, lacl 05. In LACL 2005, 2005.
  40. C. Retoré. Syntaxe et traitement automatique des langues. In F. L. et H. Nolke, editor, La syntaxe au cœur de la grammaire, mélanges offerts à Claude Muller, pages 271-286. Presses Universitaires de Rennes, 2005.
  41. M. Billaud, D. Geoffroy, and T. Zimmer. Running remote lab experiments through the elab platform. In Innovations 2005, World Innovations in Engineering Education and Research. Ed, Win Aung, et al. INEER (2005), Begell House Publishing, 2005.
  42. R. Strandh and I. Durand. Architecture de l'ordinateur. Dunod, 2005.
  43. G. Sénizergues. The bisimulation problem for equational graphs of finite out-degree. SIAM Journal on Computing, 34(5):1025-1106, 2005.
  44. Y. Matiyasevich and G. Sénizergues. Decision problems for semi-Thue systems with a few rules. Theoretical Computer Science, 330(1):145-169, 2005.
  45. K. Musumbu. The semantics of kalah game. ACM International conference Proceeding series, (ISBN 0-9544145-6-X):191 - 196, 2005.
  46. I. Walukiewicz. Difficult configurations - on the complexity of ltrl. Formal Methods in System Design, 26(1):27-43, 2005.
  47. D. Niwinski and I. Walukiewicz. Deciding nondeterministic hierarchy of deterministic tree automata. Electronic Notes in Theoretical Computer Science, 123:195-208, 2005.
  48. A. Finkel and J. Leroux. The convex hull of a regular set of integer vectors is polyhedral and effectively computable. Information Processing Letters, 96(1):30 - 35, 2005.
  49. I. Durand. Autowrite: A tool for term rewrite systems and tree automata. Electronic Notes in Computer Science, 124(2):29-49, 2005.
  50. I. Durand and A. Middeldorp. Decidable call-by-need computations in term rewriting. Information and Computation, 2(196):95-126, 2005.
  51. J. Almeida, J.-C. Costa, and M. Zeitoun. Tameness of pseudovariety joins involving r. Monatshefte für Mathematik, 146:89-111, 2005.
  52. A. Muscholl and I. Walukiewicz. An np-complete fragment of ltl. International Journal of Foundations of Computer Science, 16(4):743-754, 2005.
  53. D. Renault. Enumerating planar locally finite cayley graphs. Geometriae Dedicata, 112:25-49, 2005.
  54. G. Senizergues. The bisimulation problem for equational graphs of finite out-degree. SIAM Journal on Computing, 34:1025-1106, 2005.
  55. Z. Esik and P. Weil. Algebraic recognizability of regular tree languages. Theoretical Computer Science, 340:291-321, 2005.
  56. B. Courcelle and P. Weil. The recognizability of sets of graphs is a robust property. Theoretical Computer Science, 342:173-228, 2005.
  57. S. Lombardy and J. Sakarovitch. How expressions can code for automata. RAIRO - Theoretical Informatics and Applications, 39:217-237, 2005.

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

Récupéré sur
Page mise à jour le 08/08/2020 à 04:41