Jialu Zhang

Jialu Zhang

Auto-generated profile, based on publicly available information

Jialu Zhang

University of Waterloo, Waterloo, Canada

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
29 April 2024 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
JZJialu Zhang
Jialu Zhang
JCJosé Pablo Cambronero
José Pablo Cambronero
SGSumit Gulwani
Sumit Gulwani
VLVu Le
Vu Le
RPRuzica Piskac
Ruzica Piskac
GVGust Verbruggen
Gust Verbruggen
Students often make mistakes in their introductory programming assignments as part of their learning process. Unfortunately, providing custom repairs for these mistakes can require a substantial amount of time and effort from class instructors. Automated program repair (APR) techniques can be used to synthesize such fixes. Prior work has explored the use of symbolic and neural techniques for APR in the education domain. Both types of approaches require either substantial engineering efforts or large amounts of data and training. We propose to use a large language model trained on code, such as Codex (a version of GPT), to build an APR system -- PyDex -- for introductory Python programming assignments. Our system can fix both syntactic and semantic mistakes by combining multi-modal prompts, iterative querying, test-case-based selection of few-shots, and program chunking. We evaluate PyDex on 286 real student programs and compare to three baselines, including one that combines a state-of-the-art Python syntax repair engine, BIFI, and a state-of-the-art Python semantic repair engine for student assignments, Refactory. We find that PyDex can fix more programs and produce smaller patches on average.

30 June 2026 in Proceedings of the ACM on Software Engineering
Verified
Journal Article
Open access
YSYuan Si
Yuan Si
DLDaming Li
Daming Li
HSHanyuan Shi
Hanyuan Shi
JZJialu Zhang
Jialu Zhang
Block-based programming environments such as Scratch are increasingly popular in programming education, in particular for young learners. While the use of blocks helps prevent syntax errors, semantic bugs remain common and difficult to debug. Existing tools for Scratch debugging rely heavily on predefined rules or user manual inputs, and crucially, they ignore the platform’s inherently visual nature. We introduce VisionScratch, the first multimodal feedback generation system for Scratch that leverages both the project’s block code and its generated gameplay video to diagnose and repair bugs. VisionScratch uses a two-stage pipeline: a vision-language model first aligns visual symptoms with code structure to identify a single critical issue, then proposes minimal, abstract syntax tree level repairs that are verified via execution in the Scratch virtual machine. We evaluate VisionScratch on a set of real-world Scratch projects against state-of-the-art LLM-based tools and human testers. Results show that gameplay video is a crucial debugging signal: VisionScratch substantially outperforms prior tools in both bug identification and repair quality, even without access to project descriptions or goals. This work demonstrates that video can serve as a first-class specification in visual programming environments, opening new directions for LLM-based debugging beyond symbolic code alone.

1 October 2026 in Proceedings of the ACM on Software Engineering
Verified
Journal Article
Open access
YSYuan Si
Yuan Si
SHSimeng Han
Simeng Han
DLDaming Li
Daming Li
HSHanyuan Shi
Hanyuan Shi
JZJialu Zhang
Jialu Zhang
Large language models (LLMs) have achieved impressive performance on text-based programming tasks, yet they remain unreliable for block-based languages such as Scratch. Scratch programs feature deeply nested, nonlinear structures, event-driven concurrency across multiple sprites, and tight coupling between code and multimedia assets---properties that differ fundamentally from textual code. Consequently, LLMs frequently misinterpret Scratch semantics and propose large, invasive edits that are syntactically valid but semantically misaligned when repairing buggy programs. We introduce ScratchNet, the first executable benchmark designed to systematically evaluate and advance LLM-based repair for Scratch programs. The benchmark comprises 100 carefully curated projects from the public Scratch repository, each selected for high structural and semantic complexity. Every project is paired with an executable test suite, a bug description and corresponding fix, block-level edit constraints that define a minimal semantically correct repair, and the multimedia assets required for faithful execution. We construct the benchmark through a human-in-the-loop pipeline that combines automated project mining with expert validation of trigger--mechanism--outcome semantics and representative bug patterns, with particular emphasis on event ordering, concurrency, and state management. To enable rigorous and reproducible evaluation, we propose a three-layer executable protocol that measures functional correctness through VM-level execution, repair quality through block-level edit distance and behavioral trajectory comparisons, and explanation quality through structured rubrics. Using this benchmark, we study project and bug understanding, trigger and mechanism identification, functional repair, and the effect of lightweight domain adaptation. ScratchNet establishes a reproducible foundation and a closed-loop framework for evaluating and post-training LLMs on block-based programming tasks.

5 July 2026
Verified
Conference Paper
Open access
JGJialiang Gu
Jialiang Gu
KZKeren Zhou
Keren Zhou
DLDaming Li
Daming Li
HSHanyuan Shi
Hanyuan Shi
JZJialu Zhang
Jialu Zhang
Large language models (LLMs) can generate non-trivial programs, yet their reasoning often remains ungrounded: without external verification signals, one-shot generation may drift, repeat failure modes, or overfit to examples. We argue that the missing piece is budgeted feedback compression: turning noisy oracle outputs into compact, actionable hints that reliably drive multi-round code revision under tight context limits. We instantiate this idea in online judge (OJ) style algorithmic programming as a modular interactive agent that couples an LLM core with a sandboxed judger, a feedback-to-hint prompt constructor, and trajectory memory (optional error classifier). The key mechanism is feedback compression: converting noisy execution artifacts into compact, actionable hints within a tight prompt budget. In preliminary experiments, execution-grounded iteration improves debugging success from 83.9% (one-shot) to 93.2% on 570 real failed Codeforces submissions, and yields a clear difficulty trend in solving across 50 problems. Beyond OJ tasks, we envision budgeted oracle-to-hint compression as a general foundation for software engineering assistants that interact with continuous integration (CI) pipelines, tests, and profilers, shifting evaluation from final accuracy toward process metrics such as convergence and patch locality.