Ziteng Wang

Ziteng Wang

Auto-generated profile, based on publicly available information

Ziteng Wang

University of Texas at Austin, Austin, USA

Research Focus & Metrics

Academic Career Length

9Years (2018-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.

8 October 2024 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
BMBenjamin Mariano
Benjamin Mariano
ZWZiteng Wang
Ziteng Wang
SPShankara Pailoor
Shankara Pailoor
CCChristian Collberg
Christian Collberg
IDIşil Dillig
Işil Dillig
Code deobfuscation, which attempts to simplify code that has been intentionally obfuscated to prevent understanding, is a critical technique for downstream security analysis tasks like malware detection. While there has been significant prior work on code deobfuscation, most techniques either do not handle control flow obfuscations that modify control flow or they target specific classes of control flow obfuscations, making them unsuitable for handling new types of obfuscations or combinations of existing ones. In this paper, we study a new deobfuscation technique that is based on program synthesis and that can handle a broad class of control flow obfuscations. Given an obfuscated program P , our approach aims to synthesize a smallest program that is a control-flow reduction of P and that is semantically equivalent. Since our method does not assume knowledge about the types of obfuscations that have been applied to the original program, the underlying synthesis problem ends up being very challenging. To address this challenge, we propose a novel trace-informed compositional synthesis algorithm that leverages hints present in dynamic traces of the obfuscated program to decompose the synthesis problem into a set of simpler subproblems. In particular, we show how dynamic traces can be useful for inferring a suitable control-flow skeleton of the deobfuscated program and performing independent synthesis of each basic block. We have implemented this approach in a tool called Chisel and evaluate it on 546 benchmarks that have been obfuscated using combinations of six different obfuscation techniques. Our evaluation shows that our approach is effective and that it produces code that is almost identical (modulo variable renaming) to the original (non-obfuscated) program in 86% of cases. Our evaluation also shows that Chisel significantly outperforms existing techniques.

1 November 2018
Verified
Conference Paper
Closed access
XSXingwei Sun
Xingwei Sun
ZWZiteng Wang
Ziteng Wang
RXRisheng Xia
Risheng Xia
JLJunfeng Li
Junfeng Li
YYYan Yonghong
Yan Yonghong
The minimum variance distortionless response (MV-DR) beamformer is a widely used beamforming technique that extracts sound components coming from a direction specified by a steering vector. In this paper, we present four different steering vector estimation methods and analyze their influence on the MVDR beamformer in speech recognition. The first one is based on the direction of arrival under the plane wave propagation assumption with the prior knowledge of microphone array geometry. The other three methods are based on the decomposition of the observed speech covariance matrix, including the covariance subtraction based method, the eigenvalue decomposition based method, and the generalized eigenvalue decomposition (GEVD) based method. We theoretically prove that the three decomposition based methods are equivalent under the narrowband approximation or after the rank -1 speech covariance matrix approximation. The speech recognition experiments conducted on the CHiME-3 dataset shows that the MVDR beamformer using GEVD-based steering vector estimation achieves the best performance, and word error rates can be further reduced with the rank -1 approximation.

25 October 2020
Verified
Conference Paper
Closed access
ZWZiteng Wang
Ziteng Wang
YNYueyue Na
Yueyue Na
ZLZhang Liu
Zhang Liu
YLYun Li
Yun Li
BTBiao Tian
Biao Tian
QFQiang Fu
Qiang Fu

20 June 2024 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
ZWZiteng Wang
Ziteng Wang
SPShankara Pailoor
Shankara Pailoor
APAaryan Prakash
Aaryan Prakash
YWYuepeng Wang
Yuepeng Wang
IDIşıl Dillig
Işıl Dillig
Online streaming algorithms, tailored for continuous data processing, offer substantial benefits but are often more intricate to design than their offline counterparts. This paper introduces a novel approach for automatically synthesizing online streaming algorithms from their offline versions. In particular, we propose a novel methodology, based on the notion of relational function signature (RFS) , for deriving an online algorithm given its offline version. Then, we propose a concrete synthesis algorithm that is an instantiation of the proposed methodology. Our algorithm uses the RFS to decompose the synthesis problem into a set of independent subtasks and uses a combination of symbolic reasoning and search to solve each subproblem. We implement the proposed technique in a new tool called Opera and evaluate it on over 50 tasks spanning two domains: statistical computations and online auctions. Our results show that Opera can automatically derive the online version of the original algorithm for 98% of the tasks. Our experiments also demonstrate that Opera significantly outperforms alternative approaches, including adaptations of SyGuS solvers to this problem as well as two of Opera ’s own ablations.

26 July 2024
Verified
Book Chapter
Open access
PDF file
AMAnders Miltner
Anders Miltner
ZWZiteng Wang
Ziteng Wang
SCSwarat Chaudhuri
Swarat Chaudhuri
IDIsil Dillig
Isil Dillig
In this paper, we present a new synthesis method based on the novel concept of a constraint annotated tree automaton (CATA). A CATA is a variant of a finite tree automaton (FTA) where the acceptance of a term by the automaton is conditioned upon the logical satisfiability of a formula. In the context of program synthesis, CATAs allow the construction of a more precise version space than FTAs by ruling out programs that make inconsistent assumptions about the unknown semantics of functions under synthesis. We apply our proposed algorithm to synthesizing recursive (or mutually recursive) procedures from relational specifications and demonstrate that our method allows solving synthesis problems that are beyond the scope of existing approaches.