Zheng Guo

Zheng Guo

Auto-generated profile, based on publicly available information

Zheng Guo

University of California at San Diego, USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
13 November 2020 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
MJMichael B. James
Michael B. James
ZGZheng Guo
Zheng Guo
ZWZiteng Wang
Ziteng Wang
SDShivani Doshi
Shivani Doshi
HPHila Peleg
Hila Peleg
NPNadia Polikarpova
Nadia Polikarpova
We present Hoogle+, a web-based API discovery tool for Haskell. A Hoogle+ user can specify a programming task using either a type, a set of input-output tests, or both. Given a specification, the tool returns a list of matching programs composed from functions in popular Haskell libraries, and annotated with automatically-generated examples of their behavior. These features of Hoogle+ are powered by three novel techniques. First, to enable efficient type-directed synthesis from tests only, we develop an algorithm that infers likely type specifications from tests . Second, to return high-quality programs even with ambiguous specifications, we develop a technique that automatically eliminates meaningless and repetitive synthesis results . Finally, we show how to extend this elimination technique to automatically generate informative inputs that can be used to demonstrate program behavior to the user. To evaluate the effectiveness of Hoogle+ compared with traditional API search techniques, we perform a user study with 30 participants of varying Haskell proficiency. The study shows that programmers equipped with Hoogle+ generally solve tasks faster and were able to solve 50% more tasks overall.

29 August 2022 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
JKJames Koppel
James Koppel
ZGZheng Guo
Zheng Guo
EVEdsko de Vries
Edsko de Vries
ASArmando Solar-Lezama
Armando Solar-Lezama
NPNadia Polikarpova
Nadia Polikarpova
Many problem domains, including program synthesis and rewrite-based optimization, require searching astronomically large spaces of programs. Existing approaches often rely on building specialized data structures—version-space algebras, finite tree automata, or e-graphs—to compactly represent such spaces. At their core, all these data structures exploit independence of subterms; as a result, they cannot efficiently represent more complex program spaces, where the choices of subterms are entangled. We introduce equality-constrained tree automata (ECTAs), a new data structure, designed to compactly represent large spaces of programs with entangled subterms. We present efficient algorithms for extracting programs from ECTAs, implemented in a performant Haskell library, ecta. Using the ecta library, we construct Hectare, a type-driven program synthesizer for Haskell. Hectare significantly outperforms a state-of-the-art synthesizer Hoogle+—providing an average speedup of 8×—despite its implementation being an order of magnitude smaller.

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.

22 July 2026 in Journal of Computational Physics
Verified
Journal Article
Open access
ZGZheng Guo
Zheng Guo
ADAditya Deshpande
Aditya Deshpande
XWXinyu Wang
Xinyu Wang
BKBrian C. Kiedrowski
Brian C. Kiedrowski
AGAlex A. Gorodetsky
Alex A. Gorodetsky