We stand with Ukraine  

Jean-Yves Moyen

Orcid: 0000-0002-6883-6993

Affiliations:
  • University of Copenhagen, Denmark
  • University of Paris 13, France


According to our database1, Jean-Yves Moyen authored at least 16 papers between 2000 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Subrecursive Equivalence Relations and (non-)Closure Under Lattice Operations.
[BibTeX]
[DOI]
Jean-Yves Moyen
,
Jakob Grue Simonsen
Proceedings of the Connecting with Computability, 2021

2019
More Intensional Versions of Rice's Theorem.
[BibTeX]
[DOI]
Jean-Yves Moyen
,
Jakob Grue Simonsen
Proceedings of the Computing with Foresight and Industry, 2019

2018
Formal proof of polynomial-time complexity with quasi-interpretations.
[BibTeX]
[DOI]
Hugo Férée
,
Samuel Hym
,
Micaela Mayero
,
Jean-Yves Moyen
,
David Nowak
Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2018

2017
Computability in the Lattice of Equivalence Relations.
[BibTeX]
[DOI]
Jean-Yves Moyen
,
Jakob Grue Simonsen
Proceedings of the Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, 2017

Loop Quasi-Invariant Chunk Motion by peeling with statement composition.
[BibTeX]
[DOI]
Jean-Yves Moyen
,
Thomas Rubiano
,
Thomas Seiller
Proceedings of the Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, 2017

Loop Quasi-Invariant Chunk Detection.
[BibTeX]
[DOI]
Jean-Yves Moyen
,
Thomas Rubiano
,
Thomas Seiller
Proceedings of the Automated Technology for Verification and Analysis, 2017

2013
A polytime complexity analyser for Probabilistic Polynomial Time over imperative stack programs
[BibTeX]
[DOI]
Jean-Yves Moyen
,
Paolo Parisen Toldin
CoRR, 2013

2012
On quasi-interpretations, blind abstractions and implicit complexity.
[BibTeX]
[DOI]
Patrick Baillot
,
Ugo Dal Lago
,
Jean-Yves Moyen
Math. Struct. Comput. Sci., 2012

2011
Quasi-interpretations a way to control resources.
[BibTeX]
[DOI]
Guillaume Bonfante
,
Jean-Yves Marion
,
Jean-Yves Moyen
Theor. Comput. Sci., 2011

2009
Resource control graphs.
[BibTeX]
[DOI]
Jean-Yves Moyen
ACM Trans. Comput. Log., 2009

Static Complexity Analysis of Higher Order Programs.
[BibTeX]
[DOI]
James Avery
,
Lars Kristiansen
,
Jean-Yves Moyen
Proceedings of the Foundational and Practical Aspects of Resource Analysis, 2009

2008
Study of the NP-completeness of the compact table problem.
[BibTeX]
Jean-Christophe Dubacq
,
Jean-Yves Moyen
Proceedings of the First Symposium on Cellular Automata "Journées Automates Cellulaires" (JAC 2008), 2008

2005
Quasi-interpretations and Small Space Bounds.
[BibTeX]
[DOI]
Guillaume Bonfante
,
Jean-Yves Marion
,
Jean-Yves Moyen
Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

2001
System Presentation: An Analyser of Rewriting Systems Complexity.
[BibTeX]
[DOI]
Jean-Yves Moyen
Proceedings of the Second International Workshop on Rule-Based Programming, 2001

On Lexicographic Termination Ordering with Space Bound Certifications.
[BibTeX]
[DOI]
Guillaume Bonfante
,
Jean-Yves Marion
,
Jean-Yves Moyen
Proceedings of the Perspectives of System Informatics, 2001

2000
Efficient First Order Functional Program Interpreter with Time Bound Certifications.
[BibTeX]
[DOI]
Jean-Yves Marion
,
Jean-Yves Moyen
Proceedings of the Logic for Programming and Automated Reasoning, 2000


  Loading...