3 citations · 4 across the 6 of their papers we have counts for
6 papers
A Novel Loop Fission Technique Inspired by Implicit Computational Complexity
Clément Aubert, Thomas Rubiano, Neea Rusch +1
This work explores an unexpected application of Implicit Computational Complexity (ICC) to parallelize loops in imperative programs. Thanks to a lightweight dependency analysis, ou…
mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity
Clément Aubert, Thomas Rubiano, Neea Rusch +1
Implicit Computational Complexity (ICC) drives better understanding of complexity classes, but it also guides the development of resources-aware languages and static source code an…
Realizing Implicit Computational Complexity
Clément Aubert, Thomas Rubiano, Neea Rusch +1
This abstract aims at presenting an ongoing effort to apply a novel typing mechanism stemming from Implicit Computational Complexity (ICC), that tracks dependencies between variabl…
An extended and more practical mwp flow analysis
Clément Aubert, Thomas Rubiano, Neea Rusch +1
We improve and refine a method for certifying that the values' sizes computed by an imperative program will be bounded by polynomials in the program's inputs' sizes. Our work ''tam…
pymwp: A Tool for Guaranteeing Complexity Bounds for C Programs
Clément Aubert, Thomas Rubiano, Neea Rusch +1
Complexity analysis offers assurance of program's runtime behavior, but large classes of programs remain unanalyzable by existing automated techniques.The mwp-flow analysis sideste…
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…