3 citations · 4 across the 6 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
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…
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…