1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.FL2022
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…
cs.CC2022
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…
cs.LO2021★ 1 cited
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…