Neea Rusch

I'm a post-doctoral researcher in computer science. I am currently "between institutions" and will have a new affiliation soon. I completed all my studies in Georgia (USA), alternating between Georgia Institute of Technology and Augusta University. You can find my CV here.

Contacts: nrusch3@gatech.edu

Research

I am generally interested in static reasoning about programs (by some interpretation) and ways to ensure programs are correct (by some metric). My topics of interests include program analysis, implicit computational complexity, and formal methods. For a summary of my doctoral research, have a look at this extended abstract. I am a former professional software engineer (perhaps still am, but now on scientific software). That means I enjoy artifacts and seeing theoretical ideas applied in practice.

Publications

Applied Implicit Computational ComplexityPhD dissertation.

Neea Rusch

preprint slides source code

pymwp: A Static Analyzer Determining Polynomial Growth Bounds at ATVA.

Clément Aubert, Thomas Rubiano, Neea Rusch, and Thomas Seiller

preprint slides tool guide web demo

Distributing and Parallelizing Non-canonical Loops at VMCAI.

Clément Aubert, Thomas Rubiano, Neea Rusch, and Thomas Seiller

preprint slides artifact

mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity at FSCD.

Clément Aubert, Thomas Rubiano, Neea Rusch, and Thomas Seiller

paper slides code

Complete list of publications ↗

Recent Talks & Presentations

“Applied Implicit Computational Complexity”

Jul 2025, Doctoral Symposium at ECOOP 2025.

“Fresh Perspectives on Implicit Computational Complexity”

Jun 2025, Programming Languages seminar at Uppsala University.

“An Information Flow Calculus for Non-Interference”

Oct 2024, Workshop on Programming Languages and Analysis for Security (PLAS).

“Implicit Computational Complexity: From Theory to Practice”

Aug 2024, Theoretical Computer Science weekly seminar at Aalto University.

“3MT: Smashing Software Bugs with Proofs”

Apr 2024, The Three Minute Thesis (3MT) research communication competition.

“pymwp: A Static Analyzer Determining Polynomial Growth Bounds”

Oct 2023, International Symposium on Automated Technology for Verification and Analysis (ATVA).

“mwp-Analysis Improvement and Implementation”

Mar 2023, SCOT Seminar on Semantic and Formal Approaches to Complexity.

“Certifying Complexity Analysis”

Jan 2023, International Workshop on Coq for Programming Languages (CoqPL).

Complete list of talks

Professional Service

Artifact Evaluation Committee
^✶ = distinguished reviewer

2025: CAV, ECOOP^✶, ICFP, iFM, OOPSLA, ‹Programming›, POPL, TACAS^✶
2024: CAV, ECOOP, ICFP, ICSE, OOPSLA^✶, POPL
2023: COORDINATION, ECOOP, ICFP, PLDI, PPoPP, SOSP
2022: APLAS, ICFP, PLDI

Extended Review Committee

2024: ECOOP Research papers
2023: ECOOP Research papers

Journal editor

since 5/2025: The Journal of Open Source Software

Journal reviewer

2023: The Journal of Open Source Software
2024: Science of Computer Programming

Organizer

Student volunteer at POPL'25, ETAPS'24, CAV'23, POPL'23, and SPLASH'22
Organization committee member of SERPL 2023

Community Building

During doctoral studies:

Organizer of the weekly programming languages (PL) reading group (2023-2025).
Co-founder of ΔΛΔ student organization, for students interested in PL research.
Representative in two graduate student councils (GSGA, TGS-GSC).
I am institutionally certified in access, success and belonging.
Creator and admin of the CS graduate students discussion channel (now Discord).

Scientific Guides

Research advice guides - collection of writings about doing research.
Doctoral student funding survival guide - strategies for finding research funding.
Introduction to artifact evaluation - my guest lecture about artifact evaluation.

Teaching

I have taught many programming courses at Augusta University.

Teaching experience →

Studies

dblp ORCID GitHub