My research focuses on the study of programming languages, with emphasis on the theory and practice of program verification and semantics. My interests span multiple application domains, including but not limited to: security, software testing/fuzzing, probabilistic computing, software-defined networks, distributed systems, and concurrency. Many of my works are guided by foundational mathematical frameworks such as coalgebra, Kleene algebra, iteration theory, and category theory. 

Currently, I am interested in questions related to:

• control-flow transformation, a complex and error-prone component of decompilers;
• property-based testing, a convenient and effective way to produce unit tests;
• software-defined networks, distributed computations, concurrency, including quantitative aspects such as probability, throughput, latency, and more. 

The theoretical side of my research focuses on (co)algebraic (sometimes even bialgebraic!) semantics of programming languages and systems. I am interested in producing compositional frameworks and reusable results by leveraging mathematical techniques, such as universal (co)algebra and category theory.

Before joining WPI, I was a postdoctoral research fellow at University College London's PPLV group, working with Prof. Alexandra Silva. I earned my Ph.D. degree from Boston University, working with Prof. Marco Gaboardi and Arthur Azevedo de Amorim on Kleene Algebra. Prior to that, I finished my undergraduate study in Mathematics at Wheaton College (MA), advised by Prof. William Bloch, and completed my honor thesis in graph theory with Prof. Rochelle Leibowitz. 

Outside of work, I enjoy exploring (mostly vegan) food, cooking, and coffee, spending time with my family, and hanging out with my rabbit. I love farmer's markets, street markets, libraries, public transportations (trains🚆!), and thrifting.