Won "Best Presentation" award at IntelliSys2023
Talked about array languages with Richard Feldman on the Software Unscripted podcast
One of my papers will be part of the upcoming Lecture Notes in Networks and Systems
Research committee approved my dissertation plan
IntelliSys paper accepted
AISC2022 presentation, paper, proceedings
Research committee form approved
AISC2022 paper accepted
Coursework complete, I am officially a Ph.D. candidate
Qualifying exam passed


I use deep learning and graph analytics to expose secrets hidden inside obfuscated binary programs.

Some of these secrets are malicious, like trojans and ransomware, so better detection means better protection against attackers. Other times, obfuscation is hiding stolen code or buggy versions you thought you patched ages ago.

When we can quickly find or prevent vulnerabilities in low-level binary code, we get more trustworthy hardware and software supply chains, which in turn means more secure and reliable software for millions of users.


About Me

This website contains my personal blog, CV/résumé, and a few projects. Here's a little more info about me. Some of my favorite things to do include hiking with my family, riding bikes, hand tool woodworking, road trips, and puzzles. Currently I work as a systems engineer at Indiana University, where I build high performance systems and teach about computer architecture.

I enjoy learning about and using array languages in the APL family, especially K, J, and BQN. My favorite bands are Meshuggah and Mestis and my favorite movie is Denis Villeneuve's Dune. My favorite woodworking tool is the shavehorse, and my favorite visual artist is Piet Mondrian (especially his "Gray Tree" series).

To contact me: last name preceded by first initial at gmail dot com.