Efficient First Order Functional Program Interpreter with Time Bound Certifications. - Jean-Yves Marion; Jean-Yves Moyen (LPAR, 2000)

On Lexicographic Termination Ordering with Space Bound Certifications. - Guillaume Bonfante; Jean-Yves Marion; Jean-Yves Moyen (Ershov Memorial Conference, 2001)

System Presentation: An Analyser of Rewriting Systems Complexity. - Jean-Yves Moyen (RULE@PLI, 2001)

Quasi-interpretations and Small Space Bounds. - Guillaume Bonfante; Jean-Yves Marion; Jean-Yves Moyen (RTA, 2005)

Study of the NP-completeness of the compact table problem. - Jean-Christophe Dubacq; Jean-Yves Moyen (JAC, 2008)

Static Complexity Analysis of Higher Order Programs. - James Avery; Lars Kristiansen; Jean-Yves Moyen (FOPARA, 2009)

Resource control graphs. - Jean-Yves Moyen (ACM Trans. Comput. Log., 2009)

Quasi-interpretations a way to control resources. - Guillaume Bonfante; Jean-Yves Marion; Jean-Yves Moyen (Theor. Comput. Sci., 2011)

On quasi-interpretations, blind abstractions and implicit complexity. - Patrick Baillot; Ugo Dal Lago; Jean-Yves Moyen (Math. Struct. Comput. Sci., 2012)

A polytime complexity analyser for Probabilistic Polynomial Time over imperative stack programs - Jean-Yves Moyen; Paolo Parisen Toldin (CoRR, 2013)

Loop Quasi-Invariant Chunk Detection. - Jean-Yves Moyen; Thomas Rubiano; Thomas Seiller (ATVA, 2017)

Loop Quasi-Invariant Chunk Motion by peeling with statement composition. - Jean-Yves Moyen; Thomas Rubiano; Thomas Seiller (DICE-FOPARA@ETAPS, 2017)

Computability in the Lattice of Equivalence Relations. - Jean-Yves Moyen; Jakob Grue Simonsen (DICE-FOPARA@ETAPS, 2017)

Formal proof of polynomial-time complexity with quasi-interpretations. - Hugo Férée; Samuel Hym; Micaela Mayero; Jean-Yves Moyen; David Nowak (CPP, 2018)

More Intensional Versions of Rice's Theorem. - Jean-Yves Moyen; Jakob Grue Simonsen (CiE, 2019)

Subrecursive Equivalence Relations and (non-)Closure Under Lattice Operations. - Jean-Yves Moyen; Jakob Grue Simonsen (CiE, 2021)