Zhilin Wu

Zhilin Wu

Auto-generated profile, based on publicly available information

Zhilin Wu

Institute of Software, Chinese Academy of Sciences

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
12 January 2022 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
TCTaolue Chen
Taolue Chen
AFAlejandro Flores-Lamas
Alejandro Flores-Lamas
MHMatthew Hague
Matthew Hague
ZHZhilei Han
Zhilei Han
DHDenghang Hu
Denghang Hu
ZWZhilin Wu
Zhilin Wu
Regular expressions are a classical concept in formal language theory. Regular expressions in programming languages (RegEx) such as JavaScript, feature non-standard semantics of operators (e.g. greedy/lazy Kleene star), as well as additional features such as capturing groups and references. While symbolic execution of programs containing RegExes appeals to string solvers natively supporting important features of RegEx, such a string solver is hitherto missing. In this paper, we propose the first string theory and string solver that natively provides such support. The key idea of our string solver is to introduce a new automata model, called prioritized streaming string transducers (PSST), to formalize the semantics of RegEx-dependent string functions. PSSTs combine priorities, which have previously been introduced in prioritized finite-state automata to capture greedy/lazy semantics, with string variables as in streaming string transducers to model capturing groups. We validate the consistency of the formal semantics with the actual JavaScript semantics by extensive experiments. Furthermore, to solve the string constraints, we show that PSSTs enjoy nice closure and algorithmic properties, in particular, the regularity-preserving property (i.e., pre-images of regular constraints under PSSTs are regular), and introduce a sound sequent calculus that exploits these properties and performs propagation of regular constraints by means of taking post-images or pre-images. Although the satisfiability of the string constraint language is generally undecidable, we show that our approach is complete for the so-called straight-line fragment. We evaluate the performance of our string solver on over 195000 string constraints generated from an open-source RegEx library. The experimental results show the efficacy of our approach, drastically improving the existing methods (via symbolic execution) in both precision and efficiency.

12 October 2020
Verified
Book Chapter
Closed access
PDF file
TCTaolue Chen
Taolue Chen
MHMatthew Hague
Matthew Hague
JHJinlong He
Jinlong He
DHDenghang Hu
Denghang Hu
ALAnthony Widjaja Lin
Anthony Widjaja Lin
ZWZhilin Wu
Zhilin Wu

12 June 2016
Verified
Book Chapter
Closed access
PDF file
XGXincai Gu
Xincai Gu
TCTaolue Chen
Taolue Chen
ZWZhilin Wu
Zhilin Wu

9 November 2020
Verified
Book Chapter
Closed access
PDF file
XLXie Li
Xie Li
TCTaolue Chen
Taolue Chen
ZWZhilin Wu
Zhilin Wu
MXMingji Xia
Mingji Xia

11 July 2017 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
ZXZhaowei Xu
Zhaowei Xu
TCTaolue Chen
Taolue Chen
ZWZhilin Wu
Zhilin Wu

18 July 2018
Verified
Book Chapter
Open access
PDF file
TCTaolue Chen
Taolue Chen
JHJinlong He
Jinlong He
FSFu Song
Fu Song
GWGuozhen Wang
Guozhen Wang
ZWZhilin Wu
Zhilin Wu
JYJun Yan
Jun Yan
In this paper, we propose Android Stack Machine (ASM), a formal model to capture key mechanisms of Android multi-tasking such as activities, back stacks, launch modes, as well as task affinities. The model is based on pushdown systems with multiple stacks, and focuses on the evolution of the back stack of the Android system when interacting with activities carrying specific launch modes and task affinities. For formal analysis, we study the reachability problem of ASM. While the general problem is shown to be undecidable, we identify expressive fragments for which various verification techniques for pushdown systems or their extensions are harnessed to show decidability of the problem.