Hello! I am a computer scientist.
I graduated from Harvey Mudd College in 2012 with a degree in computer science. Before joining UW I worked as a software engineer at Quixey. In 2015 I spent a summer working with Satish Chandra and others at Samsung Research America.
I completed my PhD at the University of Washington in Seattle, where I focused on program synthesis: turning complex programming tasks into simple ones by having the computer write some (or all) of the code automatically. I worked with the programming languages and software engineering group under Michael Ernst.
Today I work at Oracle Cloud Infrastructure with Chris Newcombe doing formal verification for distributed systems.
High-performance data structures are at the heart of many applications. In our PLDI 2016 paper we describe how to generate complex data structure implementations from high-level specifications. Cozy (our implementation of these techniques) is available online.
Our more recent ICSE 2018 paper improves Cozy by widening the class of data structures it can handle and generalizing the synthesis algorithm to require fewer hard-coded heuristics.
My group applied formal verification techniques to the Clinical Neutron Therapy System at the UW Medical Center. The CNTS is used for actual cancer treatments, so we want a high degree of confidence that all the code is correct!
Verifying all the CNTS code is challenging since it is built on many different technologies. Our SNAPL 2015 paper describes the need to combine many disparate verification strategies into a cohesive piece of evidence. In our CAV 2016 paper we describe how we actually achieved this for (parts of) CNTS.
Many developers have horror stories of struggling to diagnose type errors in type-inferred languages like ML and Haskell. Recent research promises far more accurate error messages, but the techniques are difficult to implement and slow to run.
Our OOPSLA 2016 paper describes how to achieve comparable quality at substantially lower run-time cost. Even better, our technique can be implemented with only small modifications to a compiler's existing type inference algorithm!
There is also a tech report on this research that expands some details in the OOPSLA paper. In particular, Appendix C gives advice for compiler writers and future researchers. Note that this is my own version of the paper and has not been peer-reviewed. (Last updated 10 October, 2016.)
Our code and evaluation materials are available on request.