Published in The Summer Undergraduate Research Fellowship (SURF) Symposium, 2017
Predict size evolution of solute nanoclusters in metallic alloys under irradiation
Recommended citation: Didier Ishimwe, Matthew J. Swenson, and Janelle P. Wharry, "Irradiation-induced NanoCluster Evolution" (August 3, 2017). The Summer Undergraduate Research Fellowship (SURF) Symposium. Paper 56.
Published in International Workshop on Software Security from Design to Deployment, 2020
In this paper, we explore the use of recurrence relation in computing runtime complexity
Recommended citation: ThanhVu Nguyen, Didier Ishimwe, Alexey Malyshev, Timos Antonopoulos, and Quoc-Sang Phan. 2020. Using dynamically inferred invariants to analyze program runtime complexity. Proceedings of the 3rd ACM SIGSOFT International Workshop on Software Security from Design to Deployment. Association for Computing Machinery, New York, NY, USA, 11–14.
Published in Proceedings of the ACM on Programming Languages, 2021
In this paper we infer asymptotic worst case complexity using recurrence relations
Recommended citation: Didier Ishimwe, KimHao Nguyen, and ThanhVu Nguyen. 2021. Dynaplex: analyzing program complexity using dynamically inferred recurrence relations. Proc. ACM Program. Lang. 5, OOPSLA, Article 138 (October 2021), 23 pages.
Published in Proceedings of the 2023 18th Joint Meeting on Foundations of Software Engineering, 2023
In this paper we infer asymptotic worst case complexity using recurrence relations
Recommended citation: Didier Ishimwe. 2023. Inferring Complexity Bounds from Recurrence Relations. In Proceedings of the 2023 18th Joint Meeting on Foundations of Software Engineering.
Published:
I presented our implementation and evaluation of Dynaplex, a novel dynamic analysis approach to computing runtime complexity analysis of recursive programs.
Published:
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.
Published:
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.