Shangyin Tan

I am a first-year Ph.D. student at UC Berkeley EECS advised by Professor Koushik Sen affilated with the Programming System Group and the Sky Lab. My research interests center around programming languages, including program analysis, testing, deep learning compiler, etc. In spare time, I also enjoy readng and writing functional programs. I did my undergrad at Purdue University, working with Guannan Wei and Tiark Rompf on building symbolic execution compilers with staging. I also spent some time as a research assistant doing ML system at Microsoft Research.

I am open to colloborate on a few fuzzing projects. Feel free to drop me an email, especially if you are an undergrad!

Find me at \(\text{shangyin}\ at\ \text{berkeley.edu}\), Twitter, or Github. Here is my CV (last updated Dec 14, 2022).

Publications

1. Compiling parallel symbolic execution with continuations.
   Guannan Wei, Songlin Jia, Ruiqi Gao, Haotian Deng, Shangyin Tan, Oliver Bračevac, Tiark Rompf
   The IEEE/ACM International Conference on Software Engineering (ICSE) 2023
2. INTENT: Interactive Tensor Transformation Synthesis.
   Zhanhui Zhou, Man To Tang, Qiping Pan, Shangyin Tan, Xinyu Wang, Tianyi Zhang
   Symposium on User Interface Software and Technology (UIST) 2022
   [paper]     [tool]
3. 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)
   [paper]     [tool]
4. 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]
   
5. 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

Quote

"Simplicity is prerequisite for reliability."

-- Edsger W. Dijkstra

"A composition is always more than the sum of its parts."

-- Yo-Yo Ma