I study programming-language semantics, with applications to verification, testing, and optimization. My work uses algebraic, coalgebraic, and iteration-theoretic perspectives to make complex computational systems intelligible, then builds modular frameworks that serve practical needs without sacrificing mathematical elegance or rigor. To this end, I often draw on inspiration and techniques from 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;
• e-graphs, a compact data structure to encode equivalences, widely used in domains like compiler, SMT solving, and verification;
• software-defined networks, distributed computations, concurrency, including quantitative aspects such as probability, throughput, latency, and more. 

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 often explore (mostly vegetarian) food, hang out with my pet rabbit, and volunteer on community farms. I love farmer’s markets, street markets, night markets, libraries, public transportations (trains🚆!), and thrifting.