Xiangyu Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Xiangyu Zhou has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Rui Dong
University of Michigan, Ann Arbor, USA
1 shared publication - Steve Oney
School of Information, University of Michigan, Ann Arbor, Michigan, USA
1 shared publication - Xiang Li
University of Michigan, Ann Arbor, USA
1 shared publication - Xinyu Wang
University of Michigan, Ann Arbor, USA
1 shared publication - Yihong Zhang
University of Washington, Seattle, USA
1 shared publication
Latest Publications
- Open Access
- 13 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Simulating Human Cursor Trajectories for Path-Sensitive GUI Evaluation
- 13 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Open AccessSimulating Human Cursor Trajectories for Path-Sensitive GUI Evaluation
- Open Access
- 2 January 2024
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 8 (POPL) , 1540-1568
Efficient Bottom-Up Synthesis for Programs with Local Variables
We propose a new synthesis algorithm that can efficiently search programs with local variables (e.g., those introduced by lambdas). Prior bottom-up synthesis algorithms are not able to evaluate programs with free local variables , and therefore cannot effectively reduce the search space of such programs (e.g., using standard observational equivalence reduction techniques), making synthesis slow. Our algorithm can reduce the space of programs with local variables. The key idea, dubbed lifted interpretation , is to lift up the program interpretation process, from evaluating one program at a time to simultaneously evaluating all programs from a grammar. Lifted interpretation provides a mechanism to systematically enumerate all binding contexts for local variables, thereby enabling us to evaluate and reduce the space of programs with local variables. Our ideas are instantiated in the domain of web automation. The resulting tool, Arborist , can automate a significantly broader range of challenging tasks more efficiently than state-of-the-art techniques including WebRobot and Helena.
- 2 January 2024
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 8 (POPL) , 1540-1568
Open AccessEfficient Bottom-Up Synthesis for Programs with Local Variables
We propose a new synthesis algorithm that can efficiently search programs with local variables (e.g., those introduced by lambdas). Prior bottom-up synthesis algorithms are not able to evaluate programs with free local variables , and therefore cannot effectively reduce the search space of such programs (e.g., using standard observational equivalence reduction techniques), making synthesis slow. Our algorithm can reduce the space of programs with local variables. The key idea, dubbed lifted interpretation , is to lift up the program interpretation process, from evaluating one program at a time to simultaneously evaluating all programs from a grammar. Lifted interpretation provides a mechanism to systematically enumerate all binding contexts for local variables, thereby enabling us to evaluate and reduce the space of programs with local variables. Our ideas are instantiated in the domain of web automation. The resulting tool, Arborist , can automate a significantly broader range of challenging tasks more efficiently than state-of-the-art techniques including WebRobot and Helena.