Follow
Jean-Yves Moyen
Jean-Yves Moyen
University of Copenhagen
Verified email at lipn.univ-paris13.fr
Title
Cited by
Cited by
Year
Quasi-interpretations a way to control resources
G Bonfante, JY Marion, JY Moyen
Theoretical computer science 412 (25), 2776-2796, 2011
992011
Efficient first order functional program interpreter with time bound certifications
M Jean-Yves, JY Moyen
Logic for Programming and Automated Reasoning: 7th International Conference …, 2000
702000
On lexicographic termination ordering with space bound certifications
G Bonfante, JY Marion, JY Moyen
Perspectives of System Informatics: 4th International Andrei Ershov Memorial …, 2001
472001
Quasi-interpretations and small space bounds
G Bonfante, JY Marion, JY Moyen
Term Rewriting and Applications: 16th International Conference, RTA 2005 …, 2005
302005
Resource control graphs
JY Moyen
ACM Transactions on Computational Logic (TOCL) 10 (4), 1-44, 2009
202009
Synthesis of quasi-interpretations
G Bonfante, JY Marion, JY Moyen, R Péchoux
Seventh International Workshop on Logic and Computational Complexity-LCC 2005, 2005
192005
Analyse de la complexité et transformation de programmes
JY Moyen
These d’université, Nancy 2, 2003
132003
Quasi-interpretations
G Bonfante, JY Marion, JY Moyen
Theor. Comput. Sci.. to appear, 2004
102004
Loop quasi-invariant chunk detection
JY Moyen, T Rubiano, T Seiller
Automated Technology for Verification and Analysis: 15th International …, 2017
92017
More intensional versions of Rice’s Theorem
JY Moyen, JG Simonsen
Computing with Foresight and Industry: 15th Conference on Computability in …, 2019
72019
Termination and resource analysis of assembly programs by Petri Nets
JY Marion, JY Moyen, IEM de Nancy
Technical Report, Université de Nancy, 2003
72003
System Presentation: An analyser of rewriting systems complexity
JY Moyen
Electronic Notes in Theoretical Computer Science 59 (4), 412-424, 2001
72001
On quasi-interpretations, blind abstractions and implicit complexity
P Baillot, U Dal Lago, JY Moyen
Mathematical Structures in Computer Science 22 (4), 549-580, 2012
62012
Static complexity analysis of higher order programs
J Avery, L Kristiansen, JY Moyen
Foundational and Practical Aspects of Resource Analysis: First International …, 2010
62010
Quasi-interpretation a way to control resources. Submitted to Theoretical Computer Science, 2005
G Bonfante, JY Marion, JY Moyen
62005
On lexicographic termination ordering with space bound certifications
G Bonfante, JY Marion, JY Moyen
PSI, 482-493, 2001
62001
Chains, antichains, and complements in infinite partition lattices
JE Avery, JY Moyen, P Růžička, JG Simonsen
Algebra universalis 79, 1-21, 2018
52018
On complexity analysis by Quasi-interpretation
G Bonfante, JY Marion, JY Moyen
Theoretical Computer Science, 2004
52004
Formal proof of polynomial-time complexity with quasi-interpretations
H Férée, S Hym, M Mayero, JY Moyen, D Nowak
Proceedings of the 7th ACM SIGPLAN International Conference on Certified …, 2018
42018
Loop quasi-invariant chunk motion by peeling with statement composition
JY Moyen, T Rubiano, T Seiller
arXiv preprint arXiv:1704.05589, 2017
42017
The system can't perform the operation now. Try again later.
Articles 1–20