An extended and more practical mwp flow analysis. - Clément Aubert; Thomas Rubiano; Neea Rusch; Thomas Seiller (CoRR, 2021)

An implementation of flow calculus for complexity analysis (tool paper). - Clément Aubert; Thomas Rubiano; Neea Rusch; Thomas Seiller (CoRR, 2021)

mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity. - Clément Aubert; Thomas Rubiano; Neea Rusch; Thomas Seiller (FSCD, 2022)

Formally Verified Resource Bounds through Implicit Computational Complexity. - Neea Rusch (SPLASH Companion, 2022)

Realizing Implicit Computational Complexity. - Clément Aubert; Thomas Rubiano; Neea Rusch; Thomas Seiller (CoRR, 2022)

A Novel Loop Fission Technique Inspired by Implicit Computational Complexity. - Clément Aubert; Thomas Rubiano; Neea Rusch; Thomas Seiller (CoRR, 2022)

pymwp: A Static Analyzer Determining Polynomial Growth Bounds. - Clément Aubert; Thomas Rubiano; Neea Rusch; Thomas Seiller (ATVA, 2023)

Classify Me Correctly if You Can: Evaluating Adversarial Machine Learning Threats in NIDS. - Neea Rusch; Asma Jodeiri Akbarfam; Hoda Maleki; Gagan Agrawal; Gokila Dorai (SecureComm (1), 2023)

Distributing and Parallelizing Non-canonical Loops. - Clément Aubert; Thomas Rubiano; Neea Rusch; Thomas Seiller (VMCAI, 2023)