Jean-Yves Moyen

Publication Activity (10 Years)

Years Active: 2000-2021
Publications (10 Years): 6

Top Topics

Rough Approximations

Deterministic Finite State Automata

Equivalence Relation

Top Venues

DICE-FOPARA@ETAPS

Math. Struct. Comput. Sci.

Publications

Jean-Yves Moyen, Jakob Grue Simonsen
Subrecursive Equivalence Relations and (non-)Closure Under Lattice Operations. CiE (2021)
Jean-Yves Moyen, Jakob Grue Simonsen
More Intensional Versions of Rice's Theorem. CiE (2019)
Hugo Férée, Samuel Hym, Micaela Mayero, Jean-Yves Moyen, David Nowak
Formal proof of polynomial-time complexity with quasi-interpretations. CPP (2018)
Jean-Yves Moyen, Jakob Grue Simonsen
Computability in the Lattice of Equivalence Relations. DICE-FOPARA@ETAPS (2017)
Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller
Loop Quasi-Invariant Chunk Motion by peeling with statement composition. DICE-FOPARA@ETAPS (2017)
Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller
Loop Quasi-Invariant Chunk Detection. ATVA (2017)
Jean-Yves Moyen, Paolo Parisen Toldin
A polytime complexity analyser for Probabilistic Polynomial Time over imperative stack programs CoRR (2013)
Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen
On quasi-interpretations, blind abstractions and implicit complexity. Math. Struct. Comput. Sci. 22 (4) (2012)
Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen
Quasi-interpretations a way to control resources. Theor. Comput. Sci. 412 (25) (2011)
Jean-Yves Moyen
Resource control graphs. ACM Trans. Comput. Log. 10 (4) (2009)
James Avery, Lars Kristiansen, Jean-Yves Moyen
Static Complexity Analysis of Higher Order Programs. FOPARA (2009)
Jean-Christophe Dubacq, Jean-Yves Moyen
Study of the NP-completeness of the compact table problem. JAC (2008)
Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen
On Quasi-Interpretations, Blind Abstractions and Implicit Complexity CoRR (2006)
Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen
Quasi-interpretations and Small Space Bounds. RTA (2005)
Jean-Yves Moyen
System Presentation: An Analyser of Rewriting Systems Complexity. Electron. Notes Theor. Comput. Sci. 59 (4) (2001)
Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen
On Lexicographic Termination Ordering with Space Bound Certifications. Ershov Memorial Conference (2001)
Jean-Yves Marion, Jean-Yves Moyen
Efficient First Order Functional Program Interpreter with Time Bound Certifications. LPAR (2000)