From LaBRI - Laboratoire Bordelais de Recherche en Informatique

Publications: MF2009

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

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

  1. O. L. Nguena Timo. Synthèse pour une Logique Temps-Réel Faible. PhD thesis, Université Sciences et Technologies - Bordeaux I, 2009.
  2. O. Gauwin. Flux XML, Requêtes XPath et Automates. PhD thesis, Université Sciences et Technologies - Bordeaux I, 2009.
  3. S. Salvati. Recognizability in the simply typed lambda-calculus. In 16th Workshop on Logic, Language, Information and Computation, 2009.
  4. L. Clément, K. Gerdes, and R. Marlet. A grammar correction algorithm – deep parsing and minimal corrections for a grammar checker. In 14th conference on Formal Grammar (FG 2009), 2009.
  5. L. Clément, K. Gerdes, and R. Marlet. Grammaires d'erreur – correction grammaticale avec analyse profonde et proposition de corrections minimales. In 16e conférence sur le Traitement Automatique des Langues Naturelles (TALN 2009), 2009.
  6. O. Gauwin, J. Niehren, and S. Tison. Earliest query answering for deterministic nested word automata. In 17th International Symposium on Fundamentals of Computer Theory, volume 5699 of LNCS, pages 121-132. SV, 2009.
  7. D. Kirsten and S. Lombardy. Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata. In S. Albers and J.-Y. Marion, editors, 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, pages 589-600. IBFI Schloss Dagstuhl, 2009.
  8. O. Gauwin, J. Niehren, and S. Tison. Bounded delay and concurrency for earliest query answering. In A. H. Dediu, A. M. Ionescu, and C. Martin-Vide, editors, 3rd International Conference on Language and Automata Theory and Applications, volume 5457 of Lecture Notes in Computer Science, pages 350-361. Springer, 2009.
  9. L. Clément, K. Gerdes, and R. Marlet. Grammaires d'erreur. In TALN 2009, pages 1-10, 2009.
  10. G. Puppis, P. Sala, and A. Montanari. A decidable spatial logic with cone-shaped cardinal directions. In Proceedings of CSL 2009, volume 5771 of LNCS, pages 394-408. Springer, 2009.
  11. K. Musumbu. A new operational semantics for prolog. In A. R. Bhanu Prasad, Pawan Lingras, editor, 4th Indian International Conference on Artificial Intelligence, number ISBN 978-0-9727412-7-9, pages 251-261, 2009.
  12. K. Musumbu. Staff scheduling problem by means of optimization algorithms. In D. A. Karas, Z. Majkoc, E. E. Kerre, and C. Li, editors, International Conference on Artificial Intelligence and Pattern Recognition,, number ISBN 978-1-60651-007-0, pages 261-268, 2009.
  13. P.-Y. Angrand, S. Lombardy, and J. Sakarovitch. On the number of broken derived terms of a rational expression. In D. Jürgen, P. Giovanni, and T. Bianca, editors, 11th Workshop on Descriptional Complexity of Formal Systems (DCFS'09), pages 79-90. University of Magdeburg, 2009.
  14. H. Hamdi and M. Mosbah. A dsl framework for policy-based security of distributed systems. In Third IEEE International Conference on Secure Software Integration and Reliability Improvement, pages 150 - 158. IEEE Computer Society, 2009.
  15. I. Jemili, A. Belghith, and M. Mosbah. Exploiting a clustering mechanism for power saving in ad hoc networks: Performance evaluation. In IEEE/ACS International Conference on Computer Systems and Applications, 2009. AICCSA 2009., pages 717-724. IEEE Computer Science, 2009.
  16. B. Boigelot, J. Brusten, and J. Leroux. A generalization of semenov's theorem to automata over real numbers. In R. A. Schmidt, editor, Automated Deduction, 22nd International Conference, CADE 2009, volume 5663 of Lecture Notes in Computer Science, pages 469-484. Springer Berlin, 2009.
  17. T. Gawlitza, J. Leroux, J. Reineke, H. Seidl, G. Sutre, and R. Wilhelm. Polynomial precise interval analysis revisited. In S. Albers, H. Alt, and S. Näher, editors, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, volume 5760 of Lecture Notes in Computer Science, pages 422-437. Springer Berlin, 2009.
  18. P. Weil. Distributions of finitely generated subgroups of free groups. In International Conference on Geometric and Combinatorial Methods in Group Theory and Semigroup Theory, 2009.
  19. P. Weil. On two distributions of finitely generated subgroups of free groups. In Workshop on Geometric and Asymptotic Group Theory and Applications, 2009.
  20. H. Soueidan, G. Sutre, and M. Nikolski. Qualitative transition systems for the abstraction and comparison of transient behavior in parametrized dynamic models. In 21, editor, Computational Methods in Systems Biology (CMSB'09), volume 5688 of Lecture notes in BioInformatics, pages 313-327. Springer Verlag, 2009.
  21. D. Cao, P. Felix, R. Castanet, and I. Berrada. Testing service composition using tgse tool. In I. C. S. Press, editor, IEEE 3rd International Workshop on Web Services Testing (WS-Testing 2009). In conjunction with 7th IEEE International Conference on Web Services (ICWS 2009). IEEE Computer Society Press., 2009.
  22. M. Mosbah and M. Tounsi. Automatic implementation of distributed algorithms specified in event-b. In Symbolic Computation in Software Science (SCSS 2009), 2009.
  23. P. Castéran, V. Filou, and M. Mosbah. Certifying distributed algorithms by embedding local computation systems in the coq proof assistant. In Symbolic Computation in Software Science (SCSS 2009), 2009.
  24. S. Salva and A. Rollet. Test purpose generation for timed protocol testing. In 2nd International Conference on Communication Theory, Reliability, and Quality of Service (CTRQ 2009), July 20-25, 2009 - Colmar, France, page 7p, 2009.
  25. A. Rollet and S. Salva. Testing robustness of communicating systems using ioco-based approach. In 1st IEEE Workshop on Performance evaluation of communications in distributed systems and Web based service architectures, in conjunction with IEEE ISCC 2009, July 5 - 8, 2009, Sousse, Tunisia, pages 67-72, 2009.
  26. H. Fouchal, A. Rollet, and A. Tarhini. Robustness testing on composed timed systems. In 18th International Conference on Software Engineering and Data Engineering (SEDE'09), pages 161-167, 2009.
  27. I. Walukiewicz. Synthesis: words and traces. In AutoMathA 2009 Conference of the AutoMathA programme, 2009.
  28. M. Bojanczyk, H. Straubing, and I. Walukiewicz. Wreath products of forest algebras, with applications to tree logics. In LICS'09, pages 1-10, 2009.
  29. A. Heußner, G. Sutre, and T. Le Gall. Extrapolation-based path invariants for abstraction refinement of fifo systems. In C. S. Pasareanu, editor, SPIN 2009, volume 5578 of LNCS, pages 107-124, 2009.
  30. B. Courcelle. On several proofs of the recognizability theorem. In G. R. S. Bozapalidis, editor, CAI 2009 : Conference on Algebraic Informatics, volume 5725 of Lecture Notes in Computer Science, pages 78-80. Springer, 2009.
  31. O. Ly, M. Bauderon, and R. Chen. Context-free categorical grammars. In 3rd International Conference on Algebraic Informatics, 2009.
  32. O. Ly, F. Krief, and M. Ben Mbarka. Entrusting remote software executed in an untrusted computation helper. In Network and Service Security (N2S'2009), 2009.
  33. O. Ly, P. Andouard, and C. Thuillet. A smartcard power analysis simulator. In IEEE International Symposium on Trusted Computing and Communication, 2009.
  34. M. Kufleitner and P. Weil. On fo2 quantifier alternation over words. In D. N. R. Kralovic, editor, Mathematical Foundations of Computer Science 2009, Lecture Notes in Computer Science 5734, pages 513-524. Springer, 2009.
  35. J. Leroux and G. Point. Tapas : The talence presburger arithmetic suite. In S. Kowalewski and A. Philippou, editors, TACAS, volume 5505 of Lecture Notes in Computer Science, pages 182-185. Springer, 2009.
  36. B. Courcelle. Monadic second-order logic for graphs : algorithmic and language theoretical applications. In A. D. et. al., editor, Language Automata Theory and Applications, volume 5457 of Lecture Notes in Computer Science, pages 19-22. Springer, 2009.
  37. M. Tounsi, A. Hadj Kacem, M. Mosbah, and D. Méry. A refinement approach for proving distributed algorithms : Examples of spanning tree problems. In Integration of Model-based Formal Methods and Tools - IM_FMT'2009 - in IFM'2009, 2009.
  38. P. Parys and I. Walukiewicz. Weak alternating timed automata. In ICALP'09, volume 5556 of LNCS, pages 273-284, 2009.
  39. N. Bertrand, B. Genest, and H. Gimbert. Qualitative determinacy and decidability of stochastic games with signals. In LICS'09, IEEE Symposium on logic in computer science, 2009.
  40. H. Gimbert and F. Horn. Simple stochastic games with few random vertices are easy to solve. In FOSSACS, pages 5-19, 2009.
  41. S. Abbas, M. Mosbah, and A. Zemmari. A generic distributed algorithm for computing by random mobile agents. In 10th Pacific Rim International Workshop on Multi-Agents (PRIMA), volume 5044 of Lecture Notes in Artificial Intelligence, pages 392-397. Springer, 2009.
  42. A. Haddar, A. Hadj Kacem, Y. Métivier, M. Mosbah, and M. Jmaiel. A distributed computational model for mobile agents. In 10th Pacific Rim International Workshop on Multi-Agents, volume 5044 of Lecture Notes in Artificial Intelligence, pages 417-421. Springer, 2009.
  43. J. Leroux. The general vector addition system reachability problem by presburger inductive invariants. In Logic in Computer Science (LICS 2009), pages 4-13. IEEE Computer Society., 2009.
  44. H. Gimbert and W. Zielonka. Limits of multi-discounted markov decision processes. In LICS 07, pages 89-98. IEEE, 2009.
  45. A. Muscholl, I. Walukiewicz, and M. Zeitoun. A look at the control of asynchronous automata. In R. R. K. Lodaya, M. Mukund, editor, Perspectives in Concurrency Theory, pages 356-371. Universities Press India, 2009.
  46. B. Courcelle. Program semantics and infinite regular terms. In Y. B. et al., editor, From Semantics to Computer Science, Essays in Honour of Gilles Kahn, pages 160-163. Cambridge University Press, 2009.
  47. G. Puppis, A. Montanari, and D. Bresolin. A theory of ultimately periodic languages and automata with an application to time granularity. Acta Informatica, 46(5):331-360, 2009.
  48. D. Renault. The vertex-transitive tlf-planar graphs. Discrete Mathematics, 309(9), 2009.
  49. P. Gastin, N. Sznajder, and M. Zeitoun. Distributed synthesis for well-connected architectures. Formal Methods in System Design, 34(3):215-237, 2009.
  50. F. Carrere. Inductive computations on graphs defined by clique-width expressions. RAIRO - Theoretical Informatics and Applications, 43:625-651, 2009.
  51. V. Bruyère, O. Carton, and G. Sénizergues. Tree automata and automata on linear orderings. RAIRO-Theor. Inf. Appl., 43(2):321-338, 2009.
  52. M. Bojanczyk, A. Muscholl, T. Schwentick, and L. Segoufin. Two-variable logic on data trees and xml reasoning. Journal of the ACM, 56(3):1-48, 2009.
  53. O. Ly and L. Goubin. Sûreté de fonctionnement et sécurité des algorithmes cryptographiques. Multi-system & Internet Security Cookbook (MISC), 42:6, 2009.
  54. B. Courcelle and M. M. Kanté. Graph operations characterizing rank-width. Discrete Applied Mathematics, 157:627-640, 2009.
  55. B. Courcelle. Linear delay enumeration and monadic second-order logic. Discrete Applied Mathematics, 157:2675-2700, 2009.
  56. C. Retoré. Note de lecture sur two-step approaches to natural language formalisms de frank morawietz. Traitement Automatique des Langues, 48(3):227-229, 2009.

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

Récupéré sur
Page mise à jour le 20/09/2020 à 00:29