The goal of this research is to develop a precise and scalable framework for static analysis. The research formulates the analysis problems as graph reachability problems based on linear conjunctive language reachability (LCL-reachability). We have two planed directions: (1) automatic average-case analysis of LCL-reachability algorithms; (2) providing extensible supports for debugger testing.
The REU students will be working with my PhD students to get hands-on experience in the exciting research in program analysis. Moreover, the REU students will also be invited to the bi-weekly PLSE meetings at the School of Computer Science, where they can share the project outcomes with the PLSE audience at Georgia Tech. In the COVID-19 pandemic, we will move all meetings online. In-person meetings are not required.
You might find more information about my research at https://www.cc.gatech.edu/~qrzhang/. Please feel free to reach out to me if you have any questions. Two publications related to the project: