3 citations · 6 across the 4 of their papers we have counts for
5 papers
Loop Quasi-Invariant Chunk Motion by peeling with statement composition
Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller
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…
Computability in the Lattice of Equivalence Relations
Jean-Yves Moyen, Jakob Grue Simonsen
We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equival…
Chains, Antichains, and Complements in Infinite Partition Lattices
James Emil Avery, Jean-Yves Moyen, Pavel Ruzicka +1
We consider the partition lattice on any set of transfinite cardinality and properties of whose analogues do not hold for finite cardinalities. Assuming the Axiom o…
A polytime complexity analyser for Probabilistic Polynomial Time over imperative stack programs
Jean-Yves Moyen, Paolo Parisen Toldin
We present iSAPP (Imperative Static Analyser for Probabilistic Polynomial Time), a complexity verifier tool that is sound and extensionally complete for the Probabilistic Polynomia…
On Quasi-Interpretations, Blind Abstractions and Implicit Complexity
Patrick Baillot, Ugo Dal Lago, Jean-Yves Moyen
Quasi-interpretations are a technique to guarantee complexity bounds on first-order functional programs: with termination orderings they give in particular a sufficient condition f…