< 100%">--> tis poujdre for12/12/ons7 &aPlan d 22:34="" /> >-->Amata !--PageT 100%">Amata !--PageT> < 100%> >-->Fli>!--/PageHeatique" Fli>!-ageHead

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

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

  1. B. Boigelot and F. Herbreteau. The power of hybrid acceleration. In T. Ball and R. B. Jones, editors, Computer Aided Verification, 18th International Conference, volume 4144 of Lecture Notes in Computer Science, pages 438-451. Springer, 2006.
  2. S. Salvati. Parsing tag with abstract categorial grammar. In TAG+8: Workshop On Tree Adjoining Grammar And Related Formalisms, 2006.
  3. S. Salvati. Syntactic descriptions: a type system for solving matching equations in the linear lambda-calculus. In F. Pfenning, editor, 17th International Conference on Rewriting Techniques and Applications, RTA 2006, volume LNCS 4098 of Lecture Notes in Computer Science, pages 151-165. Springer-Verlag, 2006.
  4. F. Saad Khorchef, A. Rollet, R. Castanet, and I. Berrada. Cadre formel pour le test de robustesse. application au protocole ssl. In Colloque Francophone sur l'Ingénierie des Protocoles - CFIP 2006, page 12 p. Hermès, 2006.
  5. M.-P. Béal, S. Lombardy, and J. Sakarovitch. Conjugacy and equivalence of weighted automata and functional transducers. In G. Dima, H. John, and H. E. A., editors, 1st International Computer Science Symposium in Russia (CSR 2006), volume 3967 of LNCS, pages 58-69. Springer-Verlag, 2006.
  6. C. Retoré. Proof nets without links for cyclic linear logic and lambek calculus (joint work with s. pogodalla). In GEOCAL Workshop on logic and linguistics, 2006.
  7. L. Clément and K. Gerdes. Analyzing zeugmas in xlfg. In LFG 2006, 2006.
  8. B. Sagot, L. Clément, De La Clergerie, and P. Boullier. The lefff 2 syntactic lexicon for french: architecture, acquisition, use. In LREC 06, pages 1-4, 2006.
  9. P. Weil. Algorithmic problems in free groups: the whitehead minimization problem. In Workshop on Geometric and Asymptotic Group Theory and Applications, 2006.
  10. H. Soueidan, M. Nikolski, and G. Sutre. Model checking alltl properties for set automata. In MOVEP, pages 203-209, 2006.
  11. I. Walukiewicz. Towards understanding tree languages: fixpoint hierarchies. In AIML (Advances in Modal Logic), 2006.
  12. I. Walukiewicz. From logic to games. In IFIP WG 2.2 40th Anniversary meeting, 2006.
  13. R. Castanet, I. Berrada, P. Félix, and S. A. Timed diagnostics and test case minimization for real time systems. In LNCS, editor, TESTCOM/FATES 2006, pages 68-81. Springer, 2006.
  14. M. Lohrey and G. Sénizergues. Theories of HNN-extensions and amalgamated products. In Iinternational Conference on Automata Languages and Programmimg, volume 4052 of LNCS, pages 504-515. Springer, 2006.
  15. F. Saad Khorchef, I. Berrada, A. Rollet, and R. Castanet. Automated robustness testing for reactive systems : Application to communicating protocols. In 6th International Workshop on Innovative Internet Community Systems (I2CS'06), 2006.
  16. G. Behrmann, A. Cougnard, A. David, E. Fleury, K. G. Larsen, and D. Lime. Uppaal-tiga: Timed games for everyone. In Nordic Workshop on Programming Theory (NWPT'06), 2006.
  17. S. Bardin, J. Leroux, and G. Point. Fast extended release. In Computer Aided Verification, CAV'06, volume 4144 of Lecture Notes in Computer Science, pages 63-66. Springer Verlag, 2006.
  18. B. Derbel and M. Mosbah. Distributed graph traversals by relabeling systems with applications. In Workshop on Graph Transformation for Verification and Concurrency, volume 154 of Electronic Notes in Theoretical Computer Science, pages 79-94. Elsevier, 2006.
  19. B. Derbel, M. Mosbah, and A. Zemmari. Fast distributed graph partition and application (extended abstract). In 20<sup>th</sup> IEEE International Parallel & Distributed Processing Symposium (IPDPS), 2006.
  20. Y. Métivier and M. Mosbah. Workshop on graph computation models. In Third International Conference on Graph Transformations, ICGT 2006, volume 4178 of Lecture notes in computer science, pages 463-464. Springer, 2006.
  21. B. Hamid and M. Mosbah. A local self-stabilizing enumeration algorithm. In Proceedings DAIS06, Distributed Applications and Interoperable Systems, 6th IFIP WG 6.1 International Conference, volume 4025 of Lecture Notes in Computer Science, pages 289-302. Springer, 2006.
  22. M. Mosbah, A. Sellami, and A. Zemmari. Using graph relabelling systems for resolving conflicts. In NOuvelles TEchnologies de la REpartition,, pages 283-294. Hermès - Lavoisier, 2006.
  23. A. Shehla, M. Mosbah, and A. Zemmari. Distributed computation of a spanning tree in a dynamic graph by mobile agents. In IEEE International Conference on Engineering of Intelligent Systems, IEEE Xplore, pages 1 - 6. IEEE Computer Science, 2006.
  24. J. Bernet and D. Janin. On distributed program specification and synthesis in architecture with cycles. In Internationnal Conference on Formal Methods for Networked and Distributed Systems (FORTE), volume 4229, pages 175-190. Elie Najim, Jean-Francois Pradat-Peyre, Vronique Vigui Donzeau-Gouge, 2006.
  25. D. Berwanger and D. Janin. Automata on directed graphs : Edge versus vertex marking. In International Conference on Graphs Transformation, volume 4178, pages 46-60. Andrea Corradini, Hartmut Ehrig, Ugo Montanari, Leila Ribeiro, Grzegorz Rozenberg, 2006.
  26. M. Diouf, S. Maabout, and K. Musumbu. Standard business rules language: Why and how? In International Conference on Artificial Intelligence (ICAI), volume 2, pages 414-419. Hamid R. Arabnia, 2006.
  27. P. Gastin, N. Sznajder, and M. Zeitoun. Distributed synthesis for well-connected architectures. In N. Garg and S. Arun-Kumar, editors, FSTTCS06, volume 4337 of Lecture Notes in Computer Science, pages 321-332. Springer, 2006.
  28. O. L. Nguena Timo. Model-cheking game : case of event-recording logic. In Proceedings of the 8th African Conference on Research in Computer Science (CARI ), pages 91-98. K. Assogba, E. Badouel, Y. Slimani (eds.), 2006.
  29. B. Genest and A. Muscholl. Constructing exponential-size deterministic zielonka automata. In International Colloquium on Automata, Languages and Programming, volume 4052 of Lecture Notes in Computer Science, pages 565-576, 2006.
  30. H. Gimbert and W. Zielonka. Deterministic priority mean-payoff games as limits of discounted games. In M. Bugliesi, B. Preneel, V. Sassone, and W. I., editors, Automata, Languages and Programming, Lecture Notes in Comp. Sci. 4051, pages 312-323. Springer, Berlin, 2006.
  31. M. Bojanczyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin. Two-variable logic on data trees and xml reasoning. In twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database system, pages 10-19. ACM Press, 2006.
  32. M. Bojanczyk, A. Muscholl, T. Schwentick, L. Segoufin, and C. David. Two-variable logic on words with data. In 21st Annual IEEE Symposium on Logic in Computer Science , LICS'06, pages 7-16. IEEE, 2006.
  33. H. Gimbert and W. Zielonka. Deterministic priority mean-payoff games as limits of discounted games. In ICALP 06, pages 312-323. Springer Berlin / Heidelberg, 2006.
  34. T. Deis, J. Meakin, and G. Sénizergues. Equations in free inverse monoids. International Journal of Algebra and Computation, 17(4):761-795, 2006.
  35. S. Fratani and G. Sénizergues. Iterated pushdown automata and sequences of rational numbers. Annals of Pure and Applied Logic, 141(3):363-411, 2006.
  36. M. Bojanczyk and I. Walukiewicz. Characterizing ef and ex tree logics. Journal of Theoretical Computer Science (TCS), 358(2-3):255-272, 2006.
  37. E. Graedel and I. Walukiewicz. Positional determinacy of games with infinitely many priorities. Logical Methods in Computer Science (LMCS), pages 1-22, 2006.
  38. B. Courcelle and A. Blumensath. Recognizability, hypergraph operations, and logical types. Information and Computation, 204:173-228, 2006.
  39. B. Courcelle. The monadic second-order logic of graphs xvi : Canonical graph decompositions. Logical Methods in Computer Science (LMCS), 2:1-46, 2006.
  40. B. Courcelle. The monadic second-order logic of graphs xv : On a conjecture by d. seese. Journal of Applied Logic, 4:79-114, 2006.
  41. B. Hamid and M. Mosbah. A local enumeration protocol in spite of corrupted data. Journal of Computers (JCP), 1(7):9-20, 2006.
  42. A. Muscholl, T. Schwentick, and L. Segoufin. Active context-free games. Theory of Computing Systems, 39(1):237-276, 2006.
  43. B. Genest, D. Kuske, and A. Muscholl. A kleene theorem and model checking algorithms for existentially bounded communicating automata. Information and Computation, 204(6):920-956, 2006.
  44. B. Genest, A. Muscholl, H. Seidl, and M. Zeitoun. Infinite-state high-level mscs: Model-checking and realizability. Journal of Computer and System Sciences, 72(4):617-647, 2006.
  45. V. Diekert and A. Muscholl. Solvability of equations in graph groups is decidable. International Journal of Algebra and Computation, 16(6):1047-1070, 2006.
  46. R. Moot and C. Retoré. Les indices pronominaux du français dans les grammaires catégorielles. Lingvisticae Investigationes, 27(1):137-146, 2006.
  47. D. Geoffroy, T. Zimmer, and M. Billaud. Cyberchip pour l'étude àuted ancee desc-t Co2. Srchip pibtr.m>, pagégorielles.Ae r.st95>eles.Ae mpuèmina(J3EAosium (IPDPS), 200bsp;Genest, A.&nbsZimmer, Samgba Besp;Schwentick, and L.&nbsAlgelriell Modential-size deg ef-walkd communicating automata. DistributedLetnal sium (I9tems<33 -yst7(4):761-795, 2006.
  48. al, S.&nsp;Lombardy, and J. SStomat for ?-free gametes in Theoretical Computer Sc356:224 -y24em>, 4:79-114, 2006. al, S.&nsp;Lombardy, Mns lere bSeerguewhich an a o ofmax-plambene tin-plambequences an aunambiguouCo2. SrRAIRO -y gametes in tomata. , 4:79-114, /o/a>

    Années: 2005, 2007, 2008, 2009, 2010, 2011, 2012, 201s='vspac ign="top"aAnnuair val i>

ges/ur border="Urgences" border="0" />