Neea Rusch
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Certifying Complexity Analysis | CoqPL 2023 | 2023-01-21 |
Plans to formalize the MWP imperative analysis in Coq, with an IMP-like language, MathComp matrices and a type system, and to prove the key soundness theorem… | ||
| Distributing and Parallelizing Non-canonical Loops | VMCAI 2023 | 2023-01-15 |
An algorithm that builds a data flow graph, collapses it into a condensation graph, computes a proper saturated covering and emits loop-fissioned code, proven… | ||
| Formally Verified Resource Bounds through Implicit Computational Complexity | SPLASH 2022 Doctoral Symposium | 2022-12-06 |
Proposes a mechanically checked soundness proof that completing an mwp flow analysis derivation implies polynomial bounds on variable growth, formalizes a… | ||
| nothing matches | ||