Talks and presentations

Inferring Complexity Bounds from Recurrence Relations

May 19, 2023

Seminar, University of Pennsylvania, Philadelphia, PA

This talk was given at the New Jersey Programming Languages and Systems Seminar (NJPLS), which brings researchers in the New Jersey area together for a day of informal talks and discussions.

Invariant/Specification Discovery using Dynamic and Symbolic Analyses

October 28, 2021

Seminar, George Mason University, Fairfax, VA

This is talk was part of Mason Software Engineering Seminars fall 2021. I discuss the benefit of complexity analysis. I also present a novel dynamic approach for inferring the asymptotic complexity bounds of recursive programs by inferring recurrence relations from program execution traces.