1 citations · 1 across the 5 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2022
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…
cs.PL2021
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…