Jean-Yves Moyen

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