I am now a research assistant at Microsoft Research Asia working with Quanlu Zhang, Fan Yang, Yanjie Gao, and Haoxiang Lin on tooling for machine learning and deep learning systems. I will join UC Berkeley EECS as a PhD student in Fall 2022. I was an undergraduate student at Purdue University, working with Guannan Wei and Tiark Rompf. We did research in programming languages, program analysis, and compilers. We are applying compiler technologies to traditional program analysis tools (e.g.. symbolic execution) for flexibility and modularity while achieving the same or better performance.
- Towards Partially Evaluating Symbolic Interpreters for All.
Shangyin Tan, Guannan Wei, Tiark Rompf.
The ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM 2022)
- LLSC: A Parallel Symbolic Execution Compiler for LLVM IR.
Guannan Wei, Shangyin Tan, Oliver Bračevac, Tiark Rompf.
Proceedings of The 29th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE 2021)
[acm dl] [tool]
- Compiling Symbolic Execution with Staging and Algebraic Effects.
Guannan Wei, Oliver Bračevac, Shangyin Tan, Tiark Rompf.
Proceedings of the ACM on Programming Languages, Volume 4 (OOPSLA 2020).
[acm dl] [code]
Teaching - Purdue University
- CS 182 (Discrete Math), UndergradTA, Spring - Summer ‘20
- CS 252 (System Programming), UTA, Spring - Summer ‘20
- CS 381 (Algorithm), UTA, Fall ‘20
- CS 390CP (Competitive Programming), UTA, Spring ‘19 - Spring ‘20
"Simplicity is prerequisite for reliability."-- Edsger W. Dijkstra