Jean-Yves Moyen

Jean-Yves Moyen
University of Copenhagen · Department of Computer Science

PhD

About

28
Publications
1,017
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
273
Citations
Additional affiliations
September 2015 - present
University of Copenhagen
Position
  • Professor (Associate)
Description
  • Marie Curie fellow.
September 2006 - August 2015
Université Paris 13 Nord
Position
  • Professor (Associate)
September 2005 - August 2006
Université Paris 13 Nord
Position
  • PostDoc Position

Publications

Publications (28)
Chapter
The set of equivalence relations on any non-empty set is equipped with a natural order that makes it a complete lattice. The lattice structure only depends on the cardinality of the set, and thus the study of the lattice structure on any countably infinite set is (up to order-isomorphism) the same as studying the lattice of equivalence relations on...
Chapter
Classic results in computability theory concern extensional results: the behaviour of partial recursive functions rather than the programs computing them. We prove a generalisation of Rice’s Theorem concerning equivalence classes of programs and show how it can be used to study intensional properties such as time and space complexity. While many re...
Article
Full-text available
We consider the partition lattice $\Pi_{\kappa}$ on any set of transfinite cardinality $\kappa$ and properties of $\Pi_{\kappa}$ whose analogues do not hold for finite cardinalities. Assuming the Axiom of Choice we prove: (I) the cardinality of any maximal well-ordered chain is between the cofinality $\mathrm{cf}(\kappa)$ and $\kappa$, and $\kappa$...
Conference Paper
We present a Coq library that allows for readily proving that a function is computable in polynomial time. It is based on quasi-interpretations that, in combination with termination ordering, provide a characterisation of the class fp of functions computable in polynomial time. At the heart of this formalisation is a proof of soundness and extensio...
Conference Paper
We present a Coq library that allows for readily proving that a function is computable in polynomial time. It is based on quasi-interpretations that, in combination with termination ordering, provide a characterisation of the class fp of functions computable in polynomial time. At the heart of this formalisation is a proof of soundness and extensio...
Conference Paper
Several techniques for analysis and transformations are used in compilers. Among them, the peeling of loops for hoisting quasi-invariants can be used to optimize generated code, or simply ease developers’ lives. In this paper, we introduce a new concept of dependency analysis borrowed from the field of Implicit Computational Complexity (ICC), allow...
Article
Full-text available
Several techniques for analysis and transformations are used in compilers. Among them, the peeling of loops for hoisting quasi-invariants can be used to optimize generated code, or simply ease developers' lives. In this paper, we introduce a new concept of dependency analysis borrowed from the field of Implicit Computational Complexity (ICC), allow...
Article
Full-text available
We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time decidable equivalence relations- form sublattices of the lattice.
Article
Full-text available
We present iSAPP (Imperative Static Analyser for Probabilistic Polynomial Time), a complexity verifier tool that is sound and extensionally complete for the Probabilistic Polynomial Time (PP) complexity class. iSAPP works on an imperative programming language for stack machines. The certificate of polynomiality can be built in polytime, with respec...
Article
This paper presents in a reasoned way our works on resource analysis by quasi-interpretations. The controlled resources are typically the runtime, the runspace or the size of a result in a program execution.Quasi-interpretations allow the analysis of system complexity. A quasi-interpretation is a numerical assignment, which provides an upper bound...
Conference Paper
In the paper’s first part, we present a method for certifying that the values computed by a first order imperative program will be bounded by polynomials in the program’s inputs. Our method does not yield concrete polynomials, but shows existence of polynomial bounds and upper bounds to their polynomial degrees. In the second part of the paper, we...
Article
Full-text available
Resource Control Graphs are an abstract representation of programs. Each state of the program is abstracted by its size, and each instruction is abstracted by the effects it has on the state size whenever it is executed. The abstractions of instruction effects are then used as weights on the arcs of a program's Control Flow Graph. Termination is pr...
Article
Full-text available
These notes show how to get rid of the idempotence condition (G=G;G) in (delta)-Size Change Termination.
Article
Full-text available
The problem of compact tables is to maximise the overlap when building a word that is to include permutations of every given words (all the words being the same length). This problem is shown to be NP-complete in the general case, and some specific restrictions are studied.
Article
Full-text available
Quasi-interpretations are a technique to guarantee complexity bounds on first-order functional programs: with termination orderings they give in particular a sufficient condition for a program to be executable in polynomial time, called here the P-criterion. We study properties of the programs satisfying the P-criterion, in order to better understa...
Article
Full-text available
This paper presents complexity results by showing that the synthesis of Max-Poly quasi-interpretations over R+ is decidable in exponential time with xed polyno- mial degrees and xed max-degree and that the synthesis of Max-Plus quasi- interpretations over R+ is NPtime-complete with xed multiplicative degrees and xed max-degree. Quasi-interpretation...
Conference Paper
Full-text available
Quasi-interpretations are an useful tool to control resources usage of term rewriting systems, either time or space. They not only combine well with path orderings and provide characterizations of usual complexity classes but also give hints in order to optimize the program. Moreover, the existence of a quasi-interpretation is decidable. In this p...
Article
Full-text available
We present a survey on methods to analyse the program complexity, based on termination orderings and quasi-interpretations. This method can be implemented to certify the runtime (or space) of programs. We demonstrate that the class of functions computed by first order functional programs over free algebras which terminate by Permutation Path Order-...
Article
Full-text available
This paper describes ICAR, a program which analyses the implicit complexity of first order functionnal programs. ICAR is based on two previous characterizations of Ptime and Pspace by mean of term rewriting termination orderings and quasi-interpretations polynomially bounded.
Conference Paper
Full-text available
We propose a method to analyse the program space complexity, based on termination orderings. This method can be implemented to certify the runspace of programs. We demonstrate that the class of functions computed by first order functional programs over free algebras which terminate by Lexicographic Path Ordering and admit a polynomial quasi-interpr...
Conference Paper
Colloque avec actes et comité de lecture. internationale.
Conference Paper
Full-text available
We demonstrate that the class of rst order functional programs over lists which terminate by multiset path ordering and admit a polynomial quasi-interpretation, is exactly the class of function computable in polynomial time. The interest of this result lies (i) on the simplicity of the conditions on programs to certify their complexity, (ii) on the...

Network

Cited By