Nombre de documents

17

CV de Jean-Yves Moyen


Communication dans un congrès9 documents

  • Jean-Yves Moyen, Thomas Rubiano. Detection of Non-Size Increasing Programs in Compilers. Development in Implicit Computational Complexity (DICE 2016), Apr 2016, Eindhoven, Netherlands. <https://lipn.univ-paris13.fr/DICE2016/>. <hal-01310898>
  • Jean-Christophe Dubacq, Jean-Yves Moyen. Study of the NP-completeness of the compact table problem. Bruno Durand. JAC 2008, Apr 2008, Uzès, France. Издательство МЦНМО, pp.228-237, 2008, Exploratory paper track. <hal-00274004>
  • Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen. On Quasi-Interpretations, Blind Abstractions and Implicit Complexity. 8th International Workshop on Logic and Computational Complexity (LCC'06), August 10 - 11, 2006 (Satellite Workshop of FLOC-LICS 2006), 2006, Seattle, United States. 2006, version longue de l'article présenté au workshop. <hal-00023668>
  • Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen, Romain Péchoux. Synthesis of Quasi-interpretations. Seventh International Workshop on Logic and Computational Complexity - LCC 2005, Jun 2005, Chicago/USA, 2005. <inria-00000660>
  • Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen. On complexity analysis by quasi-interpretation. 2nd Appsem II workshop - APPSEM'04, 2004, Tallinn, Estonia, pp.85-95, 2004. <inria-00100099>
  • Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen. On lexicographic termination ordering with space bound certifications. D. Bjorner, M. Broy, A. Zamulin. International Andrei Ershov Memorial Conference - PSI'01, 2001, Novosibirsk, Russia, Springer, 2244, pp.482-493, 2001, Lecture notes in Computer Science. <inria-00100523>
  • Jean-Yves Moyen. System presentation: An analyser of rewriting system complexity. Mark van der Brand. Second International Workshop on Rule-Based Programming - RULE'01, 2001, Firenze, Italy, Elsevier, 59/4 (4), 7 p, 2001, Electronic Notes in Theoretical Computer Science. <inria-00100525>
  • Jean-Yves Moyen. An Analyser of Rewriting Systems Complexity. Workshop on Implicit Computational Complexity, May 2001, Aarhus, Denmark. BRICS, pp.93-99, 2001. <hal-00153132>
  • Jean-Yves Marion, Jean-Yves Moyen. Efficient first order functional program interpreter with time bound certifications. M. Parigot & A. Voronkov. International Conference on Logic Programming & Automated Reasoning - LPAR'2000, Nov 2000, Reunion Island, France, Springer-Verlag, 1955, pp.25-42, 2000, Lecture Notes in Computer Science. <inria-00099178>

Rapport3 documents

  • Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen. Quasi-interpretation: a way to control ressources. [Intern report] 2005, pp.35. <inria-00001257>
  • Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen. Quasi-interpretations and small space bounds. [Research Report] 2005, pp.19. <inria-00001234>
  • Jean-Yves Marion, Jean-Yves Moyen. Termination and resource analysis of assembly programs by Petri nets. [Research Report] A03-R-348 || marion03a, 2003, 13 p. <inria-00147587>

Article dans une revue3 documents

  • Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen. On quasi-interpretations, blind abstractions and implicit complexity.. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2012, 22 (04), pp.549-580. <10.1017/S0960129511000685>. <hal-00798377>
  • Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen. Quasi-interpretations a way to control resources. Theoretical Computer Science, Elsevier, 2011, 412 (25), pp.2776-2796. <10.1016/j.tcs.2011.02.007>. <hal-00591862>
  • Jean-Yves Moyen. Resource Control Graphs. ACM Transactions on Computational Logic, Association for Computing Machinery, 2009, 10 (4), <10.1145/1555746.1555753 >. <hal-00107145v3>

Pré-publication, Document de travail2 documents

  • Jean-Yves Moyen. SCT and the idempotence condition. rapport interne LIPN. 5 pages. 2008. <hal-00278943>
  • Jean-Yves Marion, Jean-Yves Moyen. Heap-size analysis for assembly programs. 2006. <hal-00067838>