22 citations · 108 across the 38 of their papers we have counts for
3 papers · 1 filter
A Cartesian Bicategory of Polynomial Functors in Homotopy Type Theory
Eric Finster, Samuel Mimram, Maxime Lucas +1
Polynomial functors are a categorical generalization of the usual notion of polynomial, which has found many applications in higher categories and type theory: those are generated…
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…