Rui Dong

Rui Dong

Auto-generated profile, based on publicly available information

Rui Dong

University of Michigan, Ann Arbor, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 October 2023
Verified
Conference Paper
Open access
WCWeihao Chen
Weihao Chen
XLXiaoyu Liu
Xiaoyu Liu
JZJiacheng Zhang
Jiacheng Zhang
ILIan Iong Lam
Ian Iong Lam
ZHZhicheng Huang
Zhicheng Huang
TZTianyi Zhang
Tianyi Zhang
In the era of Big Data, web automation is frequently used by data scientists, domain experts, and programmers to complete time-consuming data collection tasks. However, developing web automation scripts requires familiarity with a programming language and HTML, which remains a key learning barrier for non-expert users. We provide MIWA, a mixed-initiative web automation system that enables users to create web automation scripts by demonstrating what content they want from the targeted websites. Compared to existing web automation tools, MIWA helps users better understand a generated script and build trust in it by (1) providing a step-by-step explanation of the script’s behavior with visual correspondence to the target website, (2) supporting greater autonomy and control over web automation via step-through debugging and fine-grained demonstration refinement, and (3) automatically detecting potential corner cases that are handled improperly by the generated script. We conducted a within-subjects user study with 24 participants and compared MIWA with Rousillon, a state-of-the-art web automation tool. Results showed that, compared to Rousillon, MIWA reduced the task completion time by half while helping participants gain more confidence in the generated script.

29 October 2023
Verified
Conference Paper
Open access
KPKevin Pu
Kevin Pu
JYJim Yang
Jim Yang
AYAngel Yuan
Angel Yuan
MMMinyi Ma
Minyi Ma
RDRui Dong
Rui Dong
TGTovi Grossman
Tovi Grossman

2 January 2024 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
XLXiang Li
Xiang Li
XZXiangyu Zhou
Xiangyu Zhou
RDRui Dong
Rui Dong
YZYihong Zhang
Yihong Zhang
XWXinyu Wang
Xinyu Wang
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.

8 June 2026 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
RDRui Dong
Rui Dong
QWQingyue Wu
Qingyue Wu
DDDanny Ding
Danny Ding
ZGZheng Guo
Zheng Guo
RJRuyi Ji
Ruyi Ji
XWXinyu Wang
Xinyu Wang
Semantics has proven to be instrumental for accelerating search-based program synthesis, by enabling the sound pruning of a set of incorrect programs (without enumerating them). One may expect faster synthesis with increasingly finer-grained abstract semantics. Unfortunately, to the best of our knowledge, this is not the case, yet. The reason is because, as abstraction granularity increases -- while fewer programs are enumerated -- pruning becomes more costly. This imposes a fundamental limit on the overall synthesis performance, which we aim to address in this work. Our key idea is to introduce an offline presynthesis phase, which consists of two steps. Given a DSL with abstract semantics, the first semantics modeling step constructs a tree automaton A for a space of inputs -- such that, for any program P and for any considered input I, A has a run that corresponds to P's execution on I under abstract semantics. Then, the second step builds an oracle O for A. This O enables fast pruning during synthesis, by allowing us to efficiently find exactly those DSL programs that satisfy a given input-output example under abstract semantics. We have implemented this presynthesis-based synthesis paradigm in a framework, Foresighter. On top of it, we have developed three instantiations for SQL, string transformation, and matrix manipulation. All of them significantly outperform prior work in the respective domains.