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

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

  1. C. Retoré. Specimens: "most of" generic nps in a contextually flexible type theory. In Genius III, 2011.
  2. O. L. Nguena Timo and A. Rollet. Test selection for data-flow reactive systems based on observations. In 7th Workshop on Advances in Model Based Testing A-MOST 2011, page 8p, 2011.
  3. F. Herbreteau and B. Srivathsan. Coarse abstractions make zeno behaviours difficult to detect. In J.-P. Katoen and B. König, editors, CONCUR - 22nd International Conference on Concurrency Theory - 2011, volume 6901 of Lecture Notes in Computer Science, pages 92-107. Springer, 2011.
  4. T.-D. Cao, R. Castanet, and P. Félix. Services web : du test actif au test passif. In CFIP 2011 - Colloque Francophone sur l Ingénierie des Protocoles, 2011.
  5. E. Filiot, O. Gauwin, P.-A. Reynier, and F. Servais. Streamability of nested word transductions. In S. Chakraborty and A. Kumar, editors, FSTTCS - 31st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science - 2011, volume 13 of Leibniz International Proceedings in Informatics (LIPIcs), pages 312-324. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2011.
  6. F. Herbreteau, D. Kini, B. Srivathsan, and I. Walukiewicz. Using non-convex approximations for efficient analysis of timed automata: Extended version. In S. Chakraborty and A. Kumar, editors, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, volume 13 of LIPIcs, pages 78-89. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011.
  7. O. Gauwin and J. Niehren. Streamable fragments of forward xpath. In 16th International Conference on Implementation and Application of Automata, pages 3-15, 2011.
  8. O. Ly, M. Lapeyre, and P.-Y. Oudeyer. Bio-inspired vertebral column, compliance and semi-passive dynamics in a lightweight robot. In International Conference on Robots and Systems, 2011.
  9. P. Bourreau and S. Salvati. A datalog recognizer for almost affine lambda-cfgs. In Springer, editor, Mathematics of Language, volume 6878, pages 21-38, 2011.
  10. P. Bourreau and S. Salvati. Game semantics and uniqueness of type inhabitance in the simply typed lambda-calculus. In Typed Lambda-Calculi and Applications, volume 6878, pages 61-75, 2011.
  11. G. Puppis, M. Benedikt, and C. Riveros. The cost of traveling between languages. In Proceedings of ICALP 2011, volume 6756 of LNCS, pages 234-245. Springer, 2011.
  12. G. Puppis, M. Benedikt, and C. Riveros. Regular repair of specifications. In Proceedings of LICS 2011, pages 335-344. IEEE Computer Society, 2011.
  13. G. Puppis, T. Colcombet, and O. Carton. Regular languages of words over countable linear orderings. In Proceedings of ICALP 2011, volume 6756 of LNCS, pages 125-136. Springer, 2011.
  14. G. Puppis, T. Colcombet, and C. Ley. On the use of guards for logics with data. In Proceedings of MFCS 2011, volume 6907 of LNCS, pages 243-255. Springer, 2011.
  15. K. Musumbu. Optimization strategy apply to an attribute algorithm for the abstract interpretation. In R. N. Bhanu Prasad, Pawan Ligras, editor, The 5the Indian Conference on Artificial Intelligence, Proceedings, pages 618-631. IICAI 2011, 2011.
  16. O. L. Nguena Timo and A. Rollet. A zone-based reachability analysis of variable driven timed automata. In 3rd International Conference on Advances in System Testing and Validation Lifecycle VALID 2011, 2011.
  17. F. Demontoux, A. Dicky, K. Verdeau, and E. Woirgard. La télé participation aux enseignements. un outil pour l'accès à tous les enseignements pour les étudiants handicapés. In 9e Colloque sur l'Enseignement des Technologies et des Sciences de l'Information et des Systèmes, page 100, 2011.
  18. M. Lapeyre, O. Ly, and P.-Y. Oudeyer. Modeling maturational constraints for learning biped humanoid locomotion. In ICDL2011, 2011.
  19. P.-Y. Oudeyer, O. Ly, and P. Rouanet. Exploring robust, intuitive and emergent physical human-robot interaction with the humanoid acroban. In IEEE-RAS International Conference on Humanoid Robots, 2011.
  20. O. Ly, M. Lapeyre, and P.-Y. Oudeyer. Bio-inspired vertebral column, compliance and semi-passive dynamics in a lightweight robot. In IEEE IROS, 2011.
  21. F. Kuntz, S. Gaudan, C. Sannino, Laurent, A. Griffault, and G. Point. Model-based diagnosis for avionics systems using minimal cuts. In M. Sachenbacher, O. Dressler, and M. Hofbaur, editors, DX 2011, pages 138-145, 2011.
  22. S.-R. Noémie-Fleur and R. Moot. Using tree tranducers for grammatical inference. In LACL 2011, 2011.
  23. R. Moot and C. Retoré. Second order lambda calculus for meaning assembly: on the logical syntax of plurals. In Coconat, 2011.
  24. M. Lapeyre, O. Ly, and P.-Y. Oudeyer. Maturational constraints for motor learning in high-dimensions: the case of biped walking. In HUMANOID 2011, 2011.
  25. P. A. Abdulla, Y.-F. Chen, L. Clemente, L. Holík, C.-D. Hong, R. Mayr, and T. Vojnar. Advanced ramsey-based büchi automata inclusion testing. In CONCUR, 2011.
  26. B. Courcelle. Automata for monadic second-order model checking. In I. P. G. Delzanno, editor, Reachability Problems, volume 6945 of Lecture Notes in Computer Science. Springer, 2011.
  27. E. Garnaud, S. Maabout, and M. Mosbah. Dépendances fonctionnelles et matérialisation partielle des cubes de données. In Journées francophones sur les Entrepôts de Données et Analyse en ligne (EDA), RNTI (Revue des Nouvelles Technologies de l'Information). Hermann, 2011.
  28. T. Colcombet, G. Puppis, and C. Ley. On the use of guards for logics with data. In MFCS 2011, volume 6907 of Lecture Notes in Computer Science, pages 243-255. Springer, 2011.
  29. J.-M. Couvreur, D. Poitrenaud, and P. Weil. Unfoldings for general petri nets. In L. Kristensen, Lars M.; Petrucci, editor, Petri Nets 2011, volume 6709 of Lecture Notes in Computer Science, pages 129-148. Springer, 2011.
  30. R. Moot, L. Prévot, and C. Retoré. A discursive analysis of itineraries in an historical and regional corpus of travels. In Constraint in discourse, 2011.
  31. R. Moot, L. Prévot, and C. Retoré. Un calcul de termes typés pour la pragmatique lexicale: chemins et voyageurs fictifs dans un corpus de récits de voyages. In 18e conférence sur le traitement automatique du langage naturel, TALN 2011, pages 161-166, 2011.
  32. M. Abrusci and C. Retoré. Quantification in ordinary language. In 14TH CONGRESS OF LOGIC, METHODOLOGY AND PHILOSOPHY OF SCIENCE, 2011.
  33. M. Abrusci and C. Retoré. Quantification and interaction. In Rebuilding logic and rethinking language in interaction terms (CLMPS workshop), 2011.
  34. J. Leroux. The vector addition system reversible reachability problem. In CONCUR 2011 - Concurrency Theory, 22th International Conference, Aachen, Germany, 5-10 September, 2011, Proceedings, LNCS, pages 327-341. Springer, 2011.
  35. J. Leroux. Vector addition system reachability problem: A short self-contained proof. In A. H. Dediu, S. Inenaga, and C. Martín-Vide, editors, Language and Automata Theory and Applications - 5th International Conference, LATA 2011, Tarragona, Spain, May 26-31, 2011. Proceedings, volume 6638, pages 41-64. Springer, 2011.
  36. B. Bollig, A. Cyriac, P. Gastin, and M. Zeitoun. Temporal logics for concurrent recursive programs: Satisfiability and model checking. In F. Murlak and P. Sankowski, editors, MFCS 2011, volume 6907 of LNCS, pages 132-144. Springer, 2011.
  37. B. Courcelle and I. Durand. Fly-automata, their properties and applications. In B. B.-M. et al., editor, 16th International Conference on Implementation and Application of Automata, volume 6807 of Lecture Notes in Computer Science, pages 264-272. Springer Verlag, 2011.
  38. I. Durand and M. Sylvestre. Left-linear bounded term rewriting systems are inverse recognizability preserving. In M. Schmidt-Schauß, editor, 22nd International Conference on Rewriting Techniques and Applications, volume 10 of Leibniz International Proceedings in Informatics (LIPIcs), pages 361-376. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2011.
  39. I. Durand. Implementing huge term automata. In 4th European Lisp Symposium, pages 17-27, 2011.
  40. D. Méry, M. Mosbah, and M. Tounsi. Refinement-based verification of local synchronization algorithms. In 17TH INTERNATIONAL SYMPOSIUM ON FORMAL METHODS, Lecture Notes in Computer Science. Springer, 2011.
  41. S. Salvati and I. Walukiewicz. Krivine machines and higher-order schemes. In ICALP, volume 6756 of LNCS, pages 162-173, 2011.
  42. J. Leroux. Vector addition system reachability problem (a short self-contained proof). In Principles of Programming Languages, POPL '11, pages 307-316. ACM, 2011.
  43. T. Colcombet, O. Carton, and G. Puppis. Regular languages of words over countable linear orderings. In Icalp 2011, volume 6756 of Lecture Notes in Computer Science, pages 125-136. Springer, 2011.
  44. M. Mosbah, R. Echahed, and A. Habel. Graph computation models. In Graph Computation Models., page 1. EASST, 2011.
  45. O. Gauwin, J. Niehren, and S. Tison. Queries on xml streams with bounded delay and concurrency. Information and Computation, 209(3):409-442, 2011.
  46. K. Gerdes, L. Clémént, and R. Marlet. A grammar correction algorithm. Lecture notes in computer science, 5591:47-63, 2011.
  47. J. Ferté, V. Pilaud, and M. Pocchiola. On the number of simple arrangements of five double pseudolines. Discrete and Computational Geometry, 45(2):279-302, 2011.
  48. R. Moot. Categorial grammars and minimalist grammars. Springer LNAI, 6700, 2011.
  49. M. Bojanczyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin. Two-variable logic on data words. ACM Transactions on Computational Logic (TOCL), 12:27, 2011.
  50. M. Tounsi, M. Mosbah, and D. Méry. Proving distributed algorithms by combining refinement and local computations. Electronic Communications of the EASST, 35, 2011.
  51. C. Retoré. Logic, categories and natural language semantics. Language and linguistic compass, 7(3), 2011.
  52. P. Castéran and V. Filou. Tasks, types and tactics for local computation systems. Studia Informatica Universalis, 9(1):39-86, 2011.
  53. B. Courcelle, C. Gavoille, and M. M. Kanté. Compact labelings for efficient first-order model-checking. Journal of Combinatorial Optimization, 21(1):19-46, 2011.

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

Page mise à jour le 30/04/2017 à 18:47