Publications

Pathogen: LLM-Guided Fuzzing for Pathological Input Generation

Published in Proceedings of the International Symposium on Search-Based Software Engineering (SSBSE), 2025

In this paper we generate input leading to worst-case runtime execution using an LLM-guided fuzzing approach.

Recommended citation: Ishimwe, D., & Nguyen, K. (2025, November). LLM-Guided Fuzzing for Pathological Input Generation. In Proceedings of the International Symposium on Search-Based Software Engineering (SSBSE). Cham: Springer Nature Switzerland.

Inferring Complexity Bounds from Recurrence Relations

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.

Dynaplex: Inferring Asymptotic Runtime Complexity of Recursive Programs

Published in Proceedings of the 44th ACM/IEEE International Conference on Software Engineering: Companion Proceedings, 2022

In this paper we present Dynaplex, a tool for the automatic inference of recurrence relations from execution traces, which are subsequently solved to determine the asymptotic complexity bounds of recursive programs.

Recommended citation: Ishimwe, D., Nguyen, T., & Nguyen, K. (2022, May). Dynaplex: inferring asymptotic runtime complexity of recursive programs. In Proceedings of the ACM/IEEE 44th International Conference on Software Engineering: Companion Proceedings (pp. 61-64).

Dynaplex: Analyzing Program Complexity using Dynamically Inferred Recurrence Relations

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.

Using Dynamically Inferred Invariants to Analyze Program Runtime Complexity

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.

Irradiation-induced NanoCluster Evolution

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.