I am part of the programming languages group and work with Prof. Thomas Reps on machine-code analysis, abstract interpretation, and decision procedures.
My research interests lie in developing tools and techniques that make the process of developing, deploying, and executing software more reliable, efficient, and fun.
Click on the projects and publications below to learn more.
| Bilateral Algorithms for Symbolic Abstraction | SAS |
| A Generalization of Stålmarck's Method | SAS |
| Bilateral Algorithms for Symbolic Abstraction | TR-1713 |
| A Method for Symbolic Computation of Abstract Operations | CAV |
| OpenNWA: A Nested-Word Automaton Library | CAV |
| A Method for Symbolic Computation of Abstract Operations | TR-1708 |
| A Method for Symbolic Computation of Precise Abstract Transformers | TR-1702 |
| A Generalization of Stålmarck's Method | TR-1699 |
| WALi: Nested-word automata | TR-1675 |
| Instrumentation and Sampling Strategies for Cooperative Concurrency Bug Isolation | OOPSLA |
| There's Plenty of Room at the Bottom: Analyzing and Verifying Machine Code | CAV |
| Directed Proof Generation for Machine Code | CAV |
| Proofs from Tests | TSE |
| Cooperative Crug Isolation | WODA |
| The Yogi Project: Software Property Checking via Static Analysis and Testing | TACAS |
| Comprehensive Path-sensitive Data-flow Analysis | CGO |