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

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

  1. O. Gauwin, A.-C. Caron, J. Niehren, and S. Tison. Complexity of earliest query answering with streaming tree automata. In ACM SIGPLAN Workshop on Programming Language Techniques for XML (PLAN-X), 2008.
  2. M. Diouf, K. Musumbu, and S. Maabout. Methodological aspects of semantics enrichment in model driven architecture. In Abdelhamid, J. Bi, D. K. W. Chiu, G. Ortiz, and M. Popescu, editors, The Third International Conference on Internet and Web Applications and Services, number ISBN 978-0-7695-3163-2 in IEEE. IEEE Computer Society Conference Publishing Service (CPS), 2008.
  3. M.-P. Béal, S. Lombardy, and D. Perrin. Embeddings of local automata. In IEEE International Symposium on Information Theory (ISIT'08), pages 2351-2355, 2008.
  4. I. Jemili, A. Belghith, and M. Mosbah. Cluster based prioritized power conservation mechanism. In IEEE - IFIP Wireless Days, 2008. WD '08, pages 1-5. IEEE Computer Science, 2008.
  5. I. Jemili, A. Belghith, and M. Mosbah. A synchronous tiered based clustering algorithm for large-scale ad hoc networks. In Z. Mammeri, editor, Wireless and Mobile Networking, IFIP Joint Conference on Mobile and Wireless Communications Networks (MWCN'2008), volume 284 of IFIP, pages 41-55. Springer, 2008.
  6. I. Jemili, A. Belghith, and M. Mosbah. Evaluating the efficiency of clustering on routing and network performance. In International Conference on Wireless Networks, pages 634-639. CSREA Press, 2008.
  7. D. Porello and C. Retoré. Proof nets without links for lambek calculus and partially commutative linear logic. In 50 years of the Syntactic calculus, 2008.
  8. S. Chaumette, O. Ly, and R. Tabary. Secure program partitioning for hardware-based software protection. In First International Workshop on Remote Entrusting (RE-TRUST 2008), pages 1-3, 2008.
  9. I. Walukiewicz. Traces and distributed synthesis. In Workshop on Perspectives in Concurrency Theory on the occasion of P. S. Thiagarajan's 60th birthday, 2008.
  10. K. Musumbu. Static checking by means of abstract interpretation. In 2008 International Conference on Computer Science and Information Technology, volume ICCSIT-2008 of IEEE-Computer Society, pages 107 - 112, 2008.
  11. M. Mosbah and A. Habel. Workshop on graph computation models. In 4th International Conference on Graph Transformations, volume 5214 of Lecture Notes in Computer Science, pages 460-462. Springer, 2008.
  12. S. Salva and A. Rollet. Automatic web service testing from wsdl descriptions. In 8th IEEE International Conference on Innovative Internet Community Systems (I2CS'08), page 9 p., 2008.
  13. A. Rollet and S. Salva. Two complementary approaches to test robustness of reactive systems. In IEEE international conference on Automation, Quality and Testing, Robotics, 2008. AQTR 2008., 2008.
  14. R. Bernard, S. Metge, F. Pouzolz, P. Bieber, A. Griffault, and M. Zeitoun. Altarica refinement for heterogeneous granularity models analysis. In Lambda-Mu 16, pages 2B-3, 2008.
  15. N. Caniart, E. Fleury, J. Leroux, and M. Zeitoun. Accelerating interpolation-based model-checking. In C. R. Ramakrishnan and J. Rehof, editors, 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'08), volume 4963 of Lecture Notes in Computer Science, pages 428-442. Springer, 2008.
  16. I. Walukiewicz. Finding your way in a forest: On different types of trees and their properties. In FOSSACS, volume 4962 of LNCS, pages 1-4. Springer, 2008.
  17. J. Leroux. Convex hull of arithmetic automata. In Static Analysis, volume 5079 of LNCS, pages 47-61. Springer, 2008.
  18. F. Bouchy, A. Finkel, and J. Leroux. Decomposition of decidable first-order logics over integers and reals. In I. C. S. Press, editor, Temporal Representation and Reasoning, 2008. TIME '08. 15th International Symposium on, pages 147-155, 2008.
  19. S. Maabout, M. Diouf, and K. Musumbu. Methodological aspects of semantics enrichment in model driven architecture. In I. C. Society, editor, Third International Conference on Internet and Web Applications and Service, pages 205-210, 2008.
  20. S. Abbas, M. Mosbah, and A. Zemmari. A probabilistic model for distributed merging of mobile agents. In Second International Workshop on Verification and Evaluation of Computer and Communication Systems (VECoS 2008). eWIC, 2008.
  21. B. Genest, A. Muscholl, O. Serre, and M. Zeitoun. Tree pattern rewriting systems. In Automated Technology for Verification and Analysis, volume 5311 of Lecture Notes in Computer Science, pages 332-346, 2008.
  22. H. Gimbert and F. Horn. Solving simple stochastic games. In B. L. Arnold Beckmann, Costas Dimitracopoulos, editor, CIE 2008, volume 5028 of LNCS, page 206/209. Springer, 2008.
  23. J. Bernet and D. Janin. From asynchronous to syntchronous specification for distributed program synthesis. In International Conference on Current Trends in Theory and Practice of Computer Sience, volume 4910 of LNCS, pages 161-173. Springer, 2008.
  24. B. Courcelle, C. Gavoille, and M. M. Kanté. Efficient first-order model-checking using short labels. In X. W. Franco P. Preparata and J. Yin, editors, Frontiers in Algorithmics, Second Annual International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceeedings, volume 5059 of Lecture Notes in Computer Science, pages 159-170. Springer, 2008.
  25. B. Courcelle. Graph structure and monadic second-order logic : Language theoretical aspects. In L. A. et al., editor, ICALP 2008, volume 5125 of Lecture Notes in Computer Science, pages 1-13. Springer, 2008.
  26. H. Mnif, S. Sahnoun, F. Hdiji, D. Geoffroy, M. Billaud, N. Lewis, and T. Zimmer. Electronic practical course via the web in a virtual laboratory. In Conference REV 2008, 2008.
  27. N. Lewis, T. Zimmer, M. Billaud, and D. Geoffroy. An e-learning experience in practical electronics: Technological and pedagogical aspects. In 5th Congress of Scientific Research Outlook in the Arab World, 2008.
  28. M. Mosbah, B. Derbel, and S. Gruner. Mobile agents implementing local computations in graphs. In International Conference on Graph Transformations, volume 5214/2008 of Lecture Notes in Computer Science, pages 99-114. Springer, 2008.
  29. O. Ly, P. Andouard, and D. Rouillard. Visaa: Visual analyzer for assembler. In International Conference on Risks and Security of Internet and Systems, 2008.
  30. O. Ly, R. Chen, and M. Bauderon. Pullback grammars are context-free. In 4th International Conference on Graph Transformation (ICGT'08), 2008.
  31. J. Almeida, J.-C. Costa, and M. Zeitoun. Omega-terms over finite aperiodic semigroups. In ROGICS'08, pages 364-371, 2008.
  32. I. Durand and S. Schwer. Reasoning about qualitative temporal information with s-words and s-languages. In European Lisp Symposium, pages 1-15, 2008.
  33. A. Haddar, A. Hadj Kacem, Y. Métivier, M. Mosbah, and M. Jmaiel. Proving distributed algorithms for mobile agents: Examples of spanning tree computation in anonymous networks. In S. Rao, M. Chatterjee, P. Jayanti, C. S. R. Murthy, and S. K. Saha, editors, International Conference on Distributed Computing and Networking (ICDCN), volume 4904 of Lecture notes in computer science, pages 286-291. Springer, 2008.
  34. M. Jmaiel, M. Mosbah, Y. Métivier, A. Hadj Kacem, and A. Haddar. Electing a leader in the local computation model using mobile agents. In International Conference on Computer Systems and Applications (ACS/IEEE) (AICCSA-08), pages 473-480, 2008.
  35. R. Moot. Lambek grammars, tree adjoining grammars and hyperedge replacement grammars. In Ninth International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+ 9), pages 1-8, 2008.
  36. S. Lombardy and J. Sakarovitch. The universal automaton. In W. T. Flum Jörg, Grädel Erich, editor, Logic and Automata, History and Perspectives, volume 2, pages 457-504. Amsterdam Univiversity Press, 2008.
  37. B. Courcelle. Quantifier-free definable graph operations preserving recognizability. In T. W. J. Flum, E. Graedel, editor, Logic and Automata, History and perspectives, pages 251-260. Amsterdam University Press, 2008.
  38. L. Aceto, L. Ann Goldberg, I. Damgard, A. Ingolfsdottir, M. M. Halldorsson, and I. Walukiewicz. Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack B: Algorithms, Automata, Complexity, and Games. Springer, 2008.
  39. O. Gauwin, J. Niehren, and Y. Roos. Streaming tree automata. Information Processing Letters, 109(1):13-17, 2008.
  40. D. Marchio, S. Filfli, J.-R. Millet, E. Fleury, J.-M. Alessandrini, P. Damolis, and D. Gourmez. Quelles solutions pour des établissements de santé climatisés à moins de 100 kwh/m. e-Cahiers du CSTB : Guide technique des solutions pratiques, 3622, 2008.
  41. I. Durand and S. Schwer. A tool for reasoning about qualitative temporal information: the theory of s-languages with a lisp implementation. Journal of Universal Computer Science, 14(20):3282-3306, 2008.
  42. M. Le Moal, J. Battin, B. Bioulac, M. L. Bourgeois, P. Henry, C. Vital, and J.-D. Vincent. [neurosciences in bordeaux]. Bulletin de l'Académie Nationale de Médecine, 192(4):817-31, 2008.
  43. K. Musumbu. Abstraction and refinement in static model-checking. IEEE-Computer Society, International Conference on Computer Science and Information Technology(ICCSIT-2008):107 - 112, 2008.
  44. S. Salva and A. Rollet. Testabilité des services web. Ingénierie des Systèmes d'Information RSTI série ISI, 13(3):35-58, 2008.
  45. I. Durand and S. Schwer. A tool for reasoning about qualitative temporal information: the theory of s-languages with a lisp implementation. J.UCS Journal of Universal Computer Science, 14(20):3282-3306, 2008.
  46. J. Leroux. Structural presburger digit vector automata. Theoretical Computer Science, 409(3):549-556, 2008.
  47. S. Bardin, A. Finkel, J. Leroux, and L. Petrucci. Fast: acceleration from theory to practice. International Journal on Software Tools for Technology Transfer, 10(5):401-424, 2008.
  48. B. Genest and A. Muscholl. Pattern matching and membership for hierarchical message sequence charts. Theory of Computing Systems, 42(4):536-567, 2008.
  49. A. Muscholl and I. Walukiewicz. A lower bound on web services composition. Logical Methods in Computer Science (LMCS), 4(2:5):1-14, 2008.
  50. S. Lasota and I. Walukiewicz. Alternating timed automata. ACM Transactions on Computational Logic, 9(2):1-26, 2008.
  51. A. Murawski and I. Walukiewicz. Third-order idealized algol with iteration is decidable. Journal of Theoretical Computer Science (TCS), 390(2-3):214-229, 2008.
  52. B. Courcelle, C. Gavoille, M. M. Kanté, and A. Twigg. Connectivity check in 3-connected planar graphs with obstacles. Electronic Notes in Discrete Mathematics, 31:151-155, 2008.
  53. B. Courcelle. Circle graphs and monadic second-order logic. Journal of Applied Logic, 6:416-442, 2008.
  54. J. Almeida, J.-C. Costa, and M. Zeitoun. Pointlike sets with respect to r and j. Journal of Pure and Applied Algebra, 212:486-499, 2008.
  55. J. Almeida and M. Zeitoun. Description and analysis of a bottom-up dfa minimization algorithm. Information Processing Letters, 107:52-59, 2008.
  56. C. Retoré. Les mathématiques de la linguistique computationnelle. premier volet: la théorie des langages. La gazette des mathématiciens, pages 35-62, 2008.
  57. C. Retoré. Les mathématiques de la linguistique computationnelle. second volet: Logique. La gazette des mathématiciens, pages 29-63, 2008.
  58. H. Hamdi, M. Mosbah, and A. Bouhoula. A declarative approach for easy specification and automated enforcement of security policy. International Journal of Computer Science, 8:60-71, 2008.
  59. B. Courcelle and C. Delhommé. The modular decomposition of countable graphs : Definition and construction in monadic second-order logic. Theoretical Computer Science, 394:1-38, 2008.
  60. F. Bassino, C. Nicaud, and P. Weil. Random generation of finitely generated subgroups of a free group. International Journal of Algebra and Computation, 18(1):375-405, 2008.
  61. B. Courcelle. A multivariate interlace polynomial. Electronic Journal of Combinatories, 15(1), 2008.
  62. P. Silva and P. Weil. On an algorithm to decide whether a free group is a free factor of another. Theoretical Informatics and Applications, 42:395-414, 2008.

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

Page mise à jour le 11/12/2017 à 16:26